A platform for research: civil engineering, architecture and urbanism
ACCELERATING THE K-SHORTEST PATHS COMPUTATION IN MULTIMODAL TRANSPORTATION NETWORKS
ACCELERATING THE K-SHORTEST PATHS COMPUTATION IN MULTIMODAL TRANSPORTATION NETWORKS
ACCELERATING THE K-SHORTEST PATHS COMPUTATION IN MULTIMODAL TRANSPORTATION NETWORKS
Lam, S. K. (author) / Srikanthan, T. (author) / IEEE
International conference; 5th, Intelligent transportation systems ; 2002 ; Singapore
2002-01-01
5 pages
Also known as ITSC 2002. IEEE cat no 02TH8613
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 Randomly Time Varying Networks
British Library Conference Proceedings | 2001
|Shortest viable path algorithm in multimodal networks
Online Contents | 2001
|Finding Reliable Shortest Paths in Dynamic Stochastic Networks
British Library Online Contents | 2013
|