Transport gratuit la punctele de livrare Pick Up peste 299 lei
Packeta 15 lei Easybox 20 lei Cargus 25 lei FAN 25 lei

Online Stochastic Combinatorial Optimization

Limba englezăengleză
Carte Carte broșată
Carte Online Stochastic Combinatorial Optimization Pascal Van Hentenryck
Codul Libristo: 04561532
Editura MIT Press Ltd, august 2009
Online decision making under uncertainty and time constraints represents one of the most challenging... Descrierea completă
? points 24 b
58 lei -16 %
49 lei
șansă 50% Şanse de a obține acest titlu Când primesc cărțile?

30 de zile pentru retur bunuri


Ar putea de asemenea, să te intereseze


Chazzie Jazzie Goes to Sunday School Rochelle Johnson Wiggins / Carte broșată
common.buy 83 lei
BVR's Guide to Restaurant Valuation Edward Moran / Copertă tare
common.buy 1.066 lei
Opposite the Jail MARY ANDREW DENISON / Copertă tare
common.buy 193 lei
Bizarre Competitions Richard Happer / Carte broșată
common.buy 106 lei
HISTORY OF THE GENERAL OR SIX PRINCIPLE RICHARD KNIGHT / Carte broșată
common.buy 140 lei
Die Schildbürger Heidi Campidell Troi / Copertă tare
common.buy 148 lei
Onesimus: Memoirs of a Disciple of St. Paul Edwin A. Abbott / Carte broșată
common.buy 136 lei

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.

Informații despre carte

Titlu complet Online Stochastic Combinatorial Optimization
Limba engleză
Legare Carte - Carte broșată
Data publicării 2009
Număr pagini 248
EAN 9780262513470
ISBN 0262513471
Codul Libristo 04561532
Editura MIT Press Ltd
Greutatea 430
Dimensiuni 195 x 223 x 13
Dăruiește această carte chiar astăzi
Este foarte ușor
1 Adaugă cartea în coș și selectează Livrează ca un cadou 2 Îți vom trimite un voucher în schimb 3 Cartea va ajunge direct la adresa destinatarului

Logare

Conectare la contul de utilizator Încă nu ai un cont Libristo? Crează acum!

 
obligatoriu
obligatoriu

Nu ai un cont? Beneficii cu contul Libristo!

Datorită contului Libristo, vei avea totul sub control.

Creare cont Libristo