 |
|
|
Item Details
| Title:
|
ONLINE STOCHASTIC COMBINATORIAL OPTIMIZATION
|
| By: |
Pascal Van Hentenryck, Russell Bent |
| Format: |
Paperback |
| List price:
|
£7.99 |
| Our price: |
£5.99 |
| Discount: |
|
| You save:
|
£2.00 |
|
|
|
|
|
| ISBN 10: |
0262513471 |
| ISBN 13: |
9780262513470 |
| Availability: |
Usually dispatched within 1-3 weeks.
 Delivery
rates
|
| Stock: |
Currently 0 available |
| Publisher: |
MIT PRESS LTD |
| Pub. date: |
21 August, 2009 |
| Series: |
Online Stochastic Combinatorial Optimization |
| Pages: |
248 |
| Description: |
A framework for online decision making under uncertainty and time constraints, with online stochastic algorithms for implementing the framework, performance guarantees, and demonstrations of a variety of applications. |
| Synopsis: |
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. |
| Reader Age: |
From 18 years |
| Illustrations: |
75 illus. |
| Publication: |
US |
| Imprint: |
MIT Press |
| Returns: |
Returnable |
|
|
|
 |
|
|
|
|
|
Little Worried Caterpillar (PB)
Little Green knows she''s about to make a big change - transformingfrom a caterpillar into a beautiful butterfly. Everyone is VERYexcited! But Little Green is VERY worried. What if being a butterflyisn''t as brilliant as everyone says?Join Little Green as she finds her own path ... with just a littlehelp from her friends.
|
|
All the Things We Carry PB
What can you carry?A pebble? A teddy? A bright red balloon? A painting you''ve made?A hope or a dream?This gorgeous, reassuring picture book celebrates all the preciousthings we can carry, from toys and treasures to love and hope. With comforting rhymes and fabulous illustrations, this is a warmhug of a picture book.
|
|
|
|