265 search results - page 6 / 53 » Neighborhood Composition: A Parallelization of Local Search ... |
AAAI
2000
13 years 8 months ago
2000
Local search algorithms often get trapped in local optima. Algorithms such as tabu search and simulated annealing 'escape' local optima by accepting nonimproving moves. ...
PAMI
2006
13 years 7 months ago
2006
In previous work on point matching, a set of points is often treated as an instance of a joint distribution to exploit global relationships in the point set. For nonrigid shapes, h...
AAAI
2010
13 years 8 months ago
2010
We present a fast local search algorithm that finds an improved solution (if there is any) in the k-exchange neighborhood of the given solution to an instance of WEIGHTED FEEDBACK...
CEC
2007
IEEE
13 years 7 months ago
2007
IEEE
— Memetic algorithms (MAs) combine the global exploration abilities of evolutionary algorithms with a local search to further improve the solutions. While a neighborhood can be e...
SLS
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. We present a software tool, called EasySyn++, for the automatic synthesis of the source code for a set of stochastic local search (SLS) algorithms. EasySyn++ uses C++ as ...