Sciweavers

105 search results - page 4 / 21
» Dynamic travel time provision for road networks
Sort
View
SAGT
2009
Springer
163views Game Theory» more  SAGT 2009»
15 years 4 months ago
Nash Equilibria and the Price of Anarchy for Flows over Time
We study Nash equilibria and the price of anarchy in the context of flows over time. Many results on static routing games have been obtained over the last ten years. In flows ov...
Ronald Koch, Martin Skutella
90
Voted
SIGMOD
2010
ACM
267views Database» more  SIGMOD 2010»
15 years 2 months ago
Processing proximity relations in road networks
Applications ranging from location-based services to multi-player online gaming require continuous query support to monitor, track, and detect events of interest among sets of mov...
Zhengdao Xu, Hans-Arno Jacobsen
WSC
2007
14 years 11 months ago
Towards a user-centred road safety management method based on road traffic simulation
One of the most important gaps in road safety management practises is the lack of mature methods for estimating reliability. Road safety performance assessment systems have been d...
Andreas Gregoriades
WEA
2009
Springer
103views Algorithms» more  WEA 2009»
15 years 4 months ago
Pareto Paths with SHARC
Abstract. Up to now, research on speed-up techniques for DIJKSTRA’s algorithm focused on single-criteria scenarios. The goal was to find the quickest route within a transportati...
Daniel Delling, Dorothea Wagner
JCM
2006
96views more  JCM 2006»
14 years 9 months ago
Distributed Algorithms for Dynamic Bandwidth Provisioning in Communication Networks
Efficient dynamic resource provisioning algorithms are necessary to the development and automation of Quality of Service (QoS) networks. The main goal of these algorithms is to off...
Jocelyne Elias, Fabio Martignon, Antonio Capone, G...