Bitwise Algorithm for Fastest Paths in Time-Dependent Networks
Session, Transportation network modeling ; 2001 ; Washington, DC
2001-01-01
8 pages
Held as part of the 80th annual meeting of the Transportation Research Board
Aufsatz (Konferenz)
Englisch
© Metadata Copyright the British Library Board and other contributors. All rights reserved.
Bitwise Algorithm for Fastest Paths in Time-Dependent Networks
Online Contents | 2001
|Bitwise Algorithm for Fastest Paths in Time-Dependent Networks
Transportation Research Record | 2001
|FASTEST PATHS IN TIME-DEPENDENT NETWORKS FOR IVHS APPLICATION
Taylor & Francis Verlag | 1993
FASTEST PATHS IN TIME-DEPENDENT NETWORKS FOR INTELLIGENT VEHICLE-HIGHWAY SYSTEMS APPLICATION
Taylor & Francis Verlag | 1993
|Construction of Fastest Curvature-Constrained Paths in Direction-Dependent Media
Online Contents | 2014
|