Online stochastic combinatorial optimization / Pascal Van Hentenryck and Russell Bent.
2006
T57.32 .V36 2006eb
Linked e-resources
Linked Resource
Online Access
Details
Title
Online stochastic combinatorial optimization / Pascal Van Hentenryck and Russell Bent.
Author
Van Hentenryck, Pascal.
ISBN
9780262257152 (electronic bk.)
0262257157 (electronic bk.)
9781429477741 (electronic bk.)
1429477741 (electronic bk.)
0262220806 (alk. paper)
9780262220804 (alk. paper)
0262257157 (electronic bk.)
9781429477741 (electronic bk.)
1429477741 (electronic bk.)
0262220806 (alk. paper)
9780262220804 (alk. paper)
Publication Details
Cambridge, Mass. : MIT Press, 2006.
Language
English
Description
1 online resource (xiii, 232 pages) : illustrations
Call Number
T57.32 .V36 2006eb
Dewey Decimal Classification
003
Summary
"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."--Publisher's website.
Access Note
Access limited to authorized users.
Source of Description
OCLC-licensed vendor bibliographic record.
Added Author
Bent, Russell.
Linked Resources
Online Access
OCLC metadata license agreement
OCLC metadata license agreement
Record Appears in
Online Resources > Ebooks
All Resources
All Resources