A platform for research: civil engineering, architecture and urbanism
A platform for research: civil engineering, architecture and urbanism
Shortest Paths in Randomly Time Varying Networks
Shortest Paths in Randomly Time Varying Networks
Shortest Paths in Randomly Time Varying Networks
Cerulli, R. (author) / Festa, P. (author) / Raiconi, G. (author) / IEEE
Conference, Intelligent transportation systems ; 2001 ; Oakland, CA
2001-01-01
6 pages
Also known as ITSC 2001. IEEE cat no 01TH8585
Conference paper
English
© Metadata Copyright the British Library Board and other contributors. All rights reserved.
Shortest paths in randomly time varying networks
| IEEE | 2001
Shortest Paths in Stochastic Time-Dependent Networks with Link Travel Time Correlation
| British Library Online Contents | 2013
Finding Reliable Shortest Paths in Dynamic Stochastic Networks
| British Library Online Contents | 2013
ACCELERATING THE K-SHORTEST PATHS COMPUTATION IN MULTIMODAL TRANSPORTATION NETWORKS
| British Library Conference Proceedings | 2002