Eine Plattform für die Wissenschaft: Bauingenieurwesen, Architektur und Urbanistik
Computing Fastest Paths in Continuous-Time Dynamic Networks with Piecewise Linear Link Travel-Time Functions
Computing Fastest Paths in Continuous-Time Dynamic Networks with Piecewise Linear Link Travel-Time Functions
Computing Fastest Paths in Continuous-Time Dynamic Networks with Piecewise Linear Link Travel-Time Functions
Chabini, I. (Autor:in)
01.01.2001
8 pages
Aufsatz (Zeitschrift)
Englisch
DDC:
388
© Metadata Copyright the British Library Board and other contributors. All rights reserved.
Bitwise Algorithm for Fastest Paths in Time-Dependent Networks
British Library Online Contents | 2001
|Shortest Paths in Stochastic Time-Dependent Networks with Link Travel Time Correlation
British Library Online Contents | 2013
|Rule Based Prediction of Fastest Paths on Urban Networks
British Library Conference Proceedings | 2005
|Rule based prediction of fastest paths on urban networks
IEEE | 2005
|