1594 search results - page 50 / 319 » An Algorithm to Compute Collusion Paths |
120
Voted
ISAAC
2010
Springer
15 years 17 days ago
2010
Springer
Abstract. In this paper, we consider the problem of computing a minimum bending energy path (or MinBEP) in a simple corridor. Given a simple 2D corridor C bounded by straight line ...
119
Voted
WADS
2005
Springer
15 years 8 months ago
2005
Springer
We study the shortest path problem in weighted polygonal subdivisions of the plane, with the additional constraint of an upper bound, k, on the number of links (segments) in the pa...
112
Voted
CORR
2007
Springer
15 years 2 months ago
2007
Springer
Efficiently computing fast paths in large-scale dynamic road networks (where dynamic traffic information is known over a part of the network) is a practical problem faced by sever...
117
Voted
WADS
2007
Springer
15 years 8 months ago
2007
Springer
Distance oracles and graph spanners are excerpts of a graph that allow to compute approximate shortest paths. Here, we consider the situation where it is possible to access the ori...
118
Voted
CORR
2002
Springer
15 years 2 months ago
2002
Springer
We study routing and scheduling in packet-switched networks. We assume an adversary that controls the injection time, source, and destination for each packet injected. A set of pat...