2457 search results - page 137 / 492 » Local Search with Bootstrapping |
FLAIRS
2004
14 years 11 months ago
2004
The distributed constraint satisfaction problem (CSP) is a general formalization used to represent problems in distributed multi-agent systems. To deal with realistic problems, mu...
ICASSP
2011
IEEE
14 years 1 months ago
2011
IEEE
This work focuses on the convergence analysis of adaptive distributed beamforming schemes that can be reformulated as local random search algorithms via a random search framework....
ECCV
1996
Springer
15 years 12 months ago
1996
Springer
Search is not inherent in the correspondence problem. We propose a representation of images, called intrinsic curves, that combines the ideas of associative storage of images with...
GECCO
2006
Springer
15 years 1 months ago
2006
Springer
Surprisingly, general search heuristics often solve combinatorial problems quite sufficiently, although they do not outperform specialized algorithms. Here, the behavior of simple...
GECCO
2006
Springer
15 years 1 months ago
2006
Springer
In recent decades, many meta-heuristics, including genetic algorithm (GA), ant colony optimization (ACO) and various local search (LS) procedures have been developed for solving a...