1594 search results - page 131 / 319 » An Algorithm to Compute Collusion Paths |
130
click to vote
SPAA
2003
ACM
15 years 8 months ago
2003
ACM
In a (randomized) oblivious routing scheme the path chosen for a request between a source s and a target t is independent from the current traffic in the network. Hence, such a sc...
153
click to vote
ICPP
1998
IEEE
15 years 7 months ago
1998
IEEE
Use of anycast service can considerably simplify many communication applications. Two approaches can be used for routing anycast packets. Single-path routing always uses the same ...
127
click to vote
EMMCVPR
2001
Springer
15 years 7 months ago
2001
Springer
After [15, 31, 19, 8, 25, 5] minimum cut/maximum flow algorithms on graphs emerged as an increasingly useful tool for exact or approximate energy minimization in low-level vision...
101
click to vote
FOCS
2003
IEEE
15 years 8 months ago
2003
IEEE
In this paper, we give the rst constant-factor approximationalgorithmfor the rooted Orienteering problem, as well as a new problem that we call the Discounted-Reward TSP, motivate...
125
click to vote
MUE
2008
IEEE
15 years 9 months ago
2008
IEEE
The route guidance system, which provides driving advice based on traffic information about an origin and a destination, has become very popular along with the advancement of hand...