Sciweavers

10 search results - page 1 / 2
» Distributed Time-Dependent Contraction Hierarchies
Sort
View
WEA
2010
Springer
281views Algorithms» more  WEA 2010»
13 years 10 months ago
Distributed Time-Dependent Contraction Hierarchies
Server based route planning in road networks is now powerful enough to find quickest paths in a matter of milliseconds, even if detailed information on time-dependent travel times...
Tim Kieritz, Dennis Luxen, Peter Sanders, Christia...
CORR
2008
Springer
96views Education» more  CORR 2008»
13 years 5 months ago
Time Dependent Contraction Hierarchies -- Basic Algorithmic Ideas
Contraction hierarchies are a simple hierarchical routing technique that has proved extremely efficient for static road networks. We explain how to generalize them to networks wit...
Peter Sanders
ICS
2005
Tsinghua U.
13 years 10 months ago
The implications of working set analysis on supercomputing memory hierarchy design
Supercomputer architects strive to maximize the performance of scientific applications. Unfortunately, the large, unwieldy nature of most scientific applications has lead to the...
Richard C. Murphy, Arun Rodrigues, Peter M. Kogge,...
WMCSA
2000
IEEE
13 years 9 months ago
ARC: A Bottom-Up Approach to Negotiated QoS
Mobile systems operate in a resource-scarce environment and thus must adapt to external conditions; all layers must make cost-based decisions about what mode of operation to use i...
Hylke W. van Dijk, Koen Langendoen, Henk J. Sips
POLICY
2004
Springer
13 years 10 months ago
Policy Based Management for Internet Communities
Policy Based Management (PBM) is a research topic that has been driven by the tremendous complexity inherent in the administration and management of present-day networking and tel...
Kevin Chekov Feeney, David Lewis, Vincent P. Wade