1594 search results - page 32 / 319 » An Algorithm to Compute Collusion Paths |
127
click to vote
GECCO
2010
Springer
14 years 12 months ago
2010
Springer
This paper takes an economic approach to derive an evolutionary learning model based entirely on the endogenous employment of genetic operators in the service of self-interested a...
TAPIA
2003
ACM
15 years 5 months ago
2003
ACM
In this paper we present an infeasible path-following interiorpoint algorithm for solving linear programs using a relaxed notion of the central path, called quasicentral path, as ...
120
click to vote
FOCS
1998
IEEE
15 years 4 months ago
1998
IEEE
This paper considers the problem of designing fast, approximate, combinatorial algorithms for multicommodity flows and other fractional packing problems. We provide a different ap...
105
click to vote
IJRR
2008
14 years 11 months ago
2008
The motion-planning problem, involving the computation of a collision-free path for a moving entity amidst obstacles, is a central problem in fields like Robotics and Game Design....
CLUSTER
2004
IEEE
14 years 11 months ago
2004
IEEE
The efficient use of network capacity in shared restoration schemes strongly depends upon the path selection procedure. In this paper we propose and evaluate path selection algorit...