OPEN EDUCATIONAL RESOURCES

UPA PERPUSTAKAAN UNEJ | NPP. 3509212D1000001

  • Home
  • Admin
  • Select Language :
    Arabic Bengali Brazilian Portuguese English Espanol German Indonesian Japanese Malay Persian Russian Thai Turkish Urdu

Search by :

ALL Author Subject ISBN/ISSN Advanced Search

Last search:

{{tmpObj[k].text}}
Image of Online stochastic combinatorial optimization
Bookmark Share

Text

Online stochastic combinatorial optimization

Van Hentenryck, Pascal. - Personal Name; Bent, Russell. - Personal Name;

"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.OCLC-licensed vendor bibliographic record.


Availability

No copy data

Detail Information
Series Title
-
Call Number
-
Publisher
Cambridge, Mass. : : MIT Press,., 2006
Collation
1 online resource (xiii, 232 pages) :illustrations
Language
English
ISBN/ISSN
9780262257152
Classification
NONE
Content Type
text
Media Type
computer
Carrier Type
online resource
Edition
-
Subject(s)
Stochastic processes.
Combinatorial optimization.
Online algorithms.
Operations research.
Specific Detail Info
-
Statement of Responsibility
Pascal Van Hentenryck and Russell Bent.
Other Information
Cataloger
Kholif Basri
Source
https://doi.org/10.7551/mitpress/5140.001.0001
Validator
Kholif Basri
Digital Object Identifier (DOI)
-
Journal Volume
-
Journal Issue
-
Subtitle
-
Parallel Title
-
Other version/related

No other version available

File Attachment
No Data
Comments

You must be logged in to post a comment

OPEN EDUCATIONAL RESOURCES

Search

start it by typing one or more keywords for title, author or subject


Select the topic you are interested in
  • Computer Science, Information & General Works
  • Philosophy & Psychology
  • Religion
  • Social Sciences
  • Language
  • Pure Science
  • Applied Sciences
  • Art & Recreation
  • Literature
  • History & Geography
Icons made by Freepik from www.flaticon.com
Advanced Search
Where do you want to share?