681 search results - page 88 / 137 » General Polynomial Time Decomposition Algorithms |
CORR
2010
Springer
13 years 11 months ago
2010
Springer
We consider the question of the stability of evolutionary algorithms to gradual changes, or drift, in the target concept. We define an algorithm to be resistant to drift if, for s...
COLT
2004
Springer
14 years 4 months ago
2004
Springer
We give an algorithm for the bandit version of a very general online optimization problem considered by Kalai and Vempala [1], for the case of an adaptive adversary. In this proble...
AMAI
2008
Springer
13 years 11 months ago
2008
Springer
This paper discusses the problem of building efficient coverage paths for a team of robots. An efficient multi-robot coverage algorithm should result in a coverage path for every ...
COMPGEOM
2009
ACM
14 years 5 months ago
2009
ACM
We consider the problem of computing minimum geometric hitting sets in which, given a set of geometric objects and a set of points, the goal is to compute the smallest subset of p...
GECCO
2007
Springer
14 years 5 months ago
2007
Springer
One of the most controversial yet enduring hypotheses about what genetic algorithms (GAs) are good for concerns the idea that GAs process building-blocks. More specifically, it ha...