Vyhledávat v databázi titulů je možné dle ISBN, ISSN, EAN, č. ČNB, OCLC či vlastního identifikátoru. Vyhledávat lze i v databázi autorů dle id autority či jména.

Projekt ObalkyKnih.cz sdružuje různé zdroje informací o knížkách do jedné, snadno použitelné webové služby. Naše databáze v tuto chvíli obsahuje 2896830 obálek a 875360 obsahů českých a zahraničních publikací. Naše API využívá většina knihoven v ČR.

Registrovat »    Zapomenuté heslo?

Online stochastic combinatorial optimization hardcover



Autor: Van Hentenryck, Pascal
Rok: c2006.
ISBN: 9780262220804
OKCZID: 110418136

Citace (dle ČSN ISO 690):
VAN HENTENRYCK, Pascal a BENT, Russell, ed. Online stochastic combinatorial optimization [elektronický zdroj]. Cambridge, Mass.: MIT Press, c2006. xiii, 232 p.


Anotace

 

Online decision making under uncertainty and time constraints represents one of the most challenging problems for robust intelligent agents. In an increasingly dynamic, interconnected, and real-time world, intelligent systems must adapt dynamically to uncertainties, update existing plans to accommodate new requests and events, and produce high-quality decisions under severe time constraints. Such online decision-making applications are becoming increasingly common: ambulance dispatching and emergency city-evacuation routing, for example, are inherently online decision-making problems; other applications include packet scheduling for Internet communications and reservation systems. This book presents a novel framework, online stochastic optimization, to address this challenge. This framework assumes that the distribution of future requests, or an approximation thereof, is available for sampling, as is the case in many applications that make either historical data or predictive models available. It assumes additionally that the distribution of future requests is independent of current decisions, which is also the case in a variety of applications and holds significant computational advantages. The book presents several online stochastic algorithms implementing the framework, provides performance guarantees, and demonstrates a variety of applications. It discusses how to relax some of the assumptions in using historical sampling and machine learning and analyzes different underlying algorithmic problems. And finally, the book discusses the framework's possible limitations and suggests directions for future research.


Dostupné zdroje

Amazon


Přidat komentář a hodnocení

Od: (127.0.0...)