The value of information in shortest path optimization/
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2010. === Cataloged from PDF version of thesis. === Includes bibliographical references (p. 92-93). === Information about a random event (termed the source) is typically treated as a (possib...
Main Author: | Rinehart, Michael David |
---|---|
Other Authors: | Munther A. Dahleh. |
Format: | Others |
Language: | English |
Published: |
Massachusetts Institute of Technology
2010
|
Subjects: | |
Online Access: | http://hdl.handle.net/1721.1/58452 |
Similar Items
-
Algorithms for the shortest path problem with time windows and shortest path reoptimization in time-dependent networks
by: Glenn, Andrew M., 1978-
Published: (2014) -
Stochastic and shortest path games : theory and algorithms
by: Patek, Stephen D. (Stephen David)
Published: (2005) -
Continuous-time dynamics shortest path algorithms
by: Dean, Brian C. (Brian Christopher), 1975-
Published: (2013) -
Analysis of parallel asynchronous schemes for the auction shortest path algorithm
by: Polymenakos, Lazaros
Published: (2005) -
Shortest path optimization under limited information
by: Dahleh, Munther A., et al.
Published: (2010)