Sciweavers

105 search results - page 6 / 21
» Dynamic travel time provision for road networks
Sort
View
WEA
2010
Springer
281views Algorithms» more  WEA 2010»
15 years 2 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...
ICAC
2007
IEEE
15 years 3 months ago
A Regression-Based Analytic Model for Dynamic Resource Provisioning of Multi-Tier Applications
— The multi-tier implementation has become the industry standard for developing scalable client-server enterprise applications. Since these applications are performance sensitive...
Qi Zhang, Ludmila Cherkasova, Evgenia Smirni
ATAL
2007
Springer
15 years 3 months ago
Information searching and sharing in large-scale dynamic networks
Finding the right agents in a large and dynamic network to provide the needed resources in a timely fashion, is a long standing problem. This paper presents a method for informati...
George A. Vouros
EOR
2010
87views more  EOR 2010»
14 years 9 months ago
On the system optimum of traffic assignment in M/G/c/c state-dependent queueing networks
-- The classical Wardrop System Optimum (SO) assignment model assumes that the users will cooperate with each other in order to minimize the overall travel costs. The importance of...
Frederico R. B. Cruz, Tom Van Woensel, James MacGr...
ALENEX
2010
161views Algorithms» more  ALENEX 2010»
14 years 11 months ago
Route Planning with Flexible Objective Functions
We present the first fast route planning algorithm that answers shortest paths queries for a customizable linear combination of two different metrics, e. g. travel time and energy...
Robert Geisberger, Moritz Kobitzsch, Peter Sanders