2899 search results - page 132 / 580 » On the Complexity of Exclusion Algorithms for Optimization |
160
click to vote
GECCO
2005
Springer
15 years 10 months ago
2005
Springer
Memetic algorithms have become to gain increasingly important for solving large scale combinatorial optimization problems. Typically, the extent of the application of local search...
205
click to vote
EVOW
2009
Springer
15 years 12 months ago
2009
Springer
This paper proposes a discrete particle swarm optimization (DPSO) to solve the multiple destination routing (MDR) problems. The problem has been proven to be NP-complete and the tr...
132
click to vote
POPL
2000
ACM
15 years 9 months ago
2000
ACM
In 1998 Asperti and Mairson proved that the cost of reducing a lambda-term using an optimal lambda-reducer (a la L´evy) cannot be bound by any elementary function in the number o...
176
click to vote
CVPR
2010
IEEE
16 years 1 months ago
2010
IEEE
This paper presents an algorithm for recovering the globally optimal 2D human figure detection using a loopy graph model. This is computationally challenging because the time comp...
151
click to vote
GECCO
2005
Springer
15 years 10 months ago
2005
Springer
Based on the Antibody Clonal Selection Theory of immunology, we put forward a novel clonal selection algorithm for multiuser detection in Code-division Multiple-access Systems. By...