๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Dynamic connectivity and path formation time in Poisson networks

โœ Scribed by Ganti, Radha Krishna; Haenggi, Martin

Book ID
121630371
Publisher
Springer
Year
2013
Tongue
English
Weight
806 KB
Volume
20
Category
Article
ISSN
1022-0038

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Dynamic and stochastic shortest path in
Dynamic and stochastic shortest path in transportation networks with two components of travel time uncertainty
โœ Parichart Pattanamekar; Dongjoo Park; Laurence R. Rilett; Jeomho Lee; Choulki Le ๐Ÿ“‚ Article ๐Ÿ“… 2003 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 682 KB

The existing dynamic and stochastic shortest path problem (DSSPP) algorithms assume that the mean and variance of link travel time (or other specific random variable such as cost) are available. When they are used with observed data from previous time periods, this assumption is reasonable. However,