Online Stochastic Combinatorial Optimization

Autor: Pascal Van Hentenryck, Russell Bent

Limbă:

Legare: Carte broșată

Editura: MIT Press Ltd

Disponibilitate: șansă 50%

Şanse de a obține acest titlu

63.08 lei

Online decision making under uncertainty and time constraints represents one of the most challenging...

Informații despre carte

Autor

Pascal Van Hentenryck, Russell Bent

Limbă

engleză

Legare

Carte - Carte broșată

Publicat

2009

Pagini

248

EAN

9780262513470

ISBN

0262513471

Enbook ID

04561532

Editura

MIT Press Ltd

Greutate

430

Dimensiuni

195 x 223 x 13

Descriere completă

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.

S-ar putea să te intereseze

Clienții care au cumpărat această carte au mai cumpărat și

Cele mai căutate

Categories

Authors

Publishers

Produse

Produse

Cele mai căutate

Categories

Authors

Publishers

Produse

Produse

Online Stochastic Combinatorial Optimization

Informații despre carte

Descriere completă

S-ar putea să te intereseze

Clienții care au cumpărat această carte au mai cumpărat și