866 search results - page 61 / 174 » On Dynamic Shortest Paths Problems |
141
click to vote
IPCO
2004
15 years 3 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...
135
click to vote
DISOPT
2010
15 years 1 months ago
2010
While the complexity of min-max and min-max regret versions of most classical combinatorial optimization problems has been thoroughly investigated, there are very few studies abou...
111
click to vote
INFOCOM
2002
IEEE
15 years 6 months ago
2002
IEEE
—The majority of the existing ad hoc wireless network routing protocols has a tendency to use the shortest single path from the source to the destination. However, in constantly ...
141
click to vote
IJCAI
1997
15 years 3 months ago
1997
In the dynamical systems approach to robot path planning both sensed and remembered information contribute to shape a nonlinear vector eld that governs the behavior of an autonomo...
118
click to vote
INFOCOM
2007
IEEE
15 years 8 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...