353 search results - page 34 / 71 » Two-phase Algorithms for the Parametric Shortest Path Proble... |
AINA
2008
IEEE
14 years 3 months ago
2008
IEEE
In this paper, we propose a map matching algorithm for car navigation systems that predict user destination. This car navigation system is a novel system that automatically predict...
ICC
2011
IEEE
12 years 8 months ago
2011
IEEE
— Anypath routing, a new routing paradigm, has been proposed to improve the performance of wireless networks by exploiting the spatial diversity and broadcast nature of the wirel...
ICPP
2009
IEEE
13 years 6 months ago
2009
IEEE
In this paper we work on the parallelization of the inherently serial Dijkstra's algorithm on modern multicore platforms. Dijkstra's algorithm is a greedy algorithm that ...
IPCO
2004
13 years 10 months ago
2004
Abstract. We study two-stage, finite-scenario stochastic versions of several combinatorial optimization problems, and provide nearly tight approximation algorithms for them. Our pr...
INFOCOM
2007
IEEE
14 years 3 months ago
2007
IEEE
—We study the problem of supporting VoIP calls in a wireless mesh network. Specifically, we propose solutions for call admission control (CAC) and route selection for VoIP calls...