2899 search results - page 45 / 580 » On the Complexity of Exclusion Algorithms for Optimization |
142
click to vote
COCOA
2010
Springer
14 years 11 months ago
2010
Springer
In a network environments supporting mobile entities (called robots or agents), a black hole is harmful site that destroys any incoming entity without leaving any visible trace. Th...
117
click to vote
MST
2007
15 years 25 days ago
2007
In 1996, Khanna and Motwani [KM96] proposed three logic-based optimization problems constrained by planar structure, and offered the hypothesis that these putatively fundamental ...
GECCO
2007
Springer
15 years 7 months ago
2007
Springer
A limited memory version of the covariance matrix adaptation evolution strategy (CMA-ES) is presented. This algorithm, L-CMA-ES, improves the space and time complexity of the CMA-...
116
click to vote
WSC
2007
15 years 3 months ago
2007
In a supply chain, there are wide variety of problems, such as transportation scheduling problems and warehouse location problems. These problems are independently defined as opt...
151
click to vote
TEC
2002
15 years 29 days ago
2002
Abstract--The particle swarm is an algorithm for finding optimal regions of complex search spaces through the interaction of individuals in a population of particles. Even though t...