Sciweavers

940 search results - page 5 / 188
» Control Abstractions for Local Search
Sort
View
JAIR
2006
92views more  JAIR 2006»
13 years 7 months ago
Dynamic Local Search for the Maximum Clique Problem
In this paper, we introduce DLS-MC, a new stochastic local search algorithm for the maximum clique problem. DLS-MC alternates between phases of iterative improvement, during which...
Wayne J. Pullan, Holger H. Hoos
EVOW
2007
Springer
14 years 1 months ago
Iterated k-Opt Local Search for the Maximum Clique Problem
Abstract. This paper presents a simple iterated local search metaheuristic incorporating a k-opt local search (KLS), called Iterated KLS (IKLS for short), for solving the maximum c...
Kengo Katayama, Masashi Sadamatsu, Hiroyuki Narihi...
PVM
2004
Springer
14 years 21 days ago
Neighborhood Composition: A Parallelization of Local Search Algorithms
Abstract. To practically solve NP-hard combinatorial optimization problems, local search algorithms and their parallel implementations on PVM or MPI have been frequently discussed....
Yuichi Handa, Hirotaka Ono, Kunihiko Sadakane, Mas...
GECCO
2005
Springer
101views Optimization» more  GECCO 2005»
14 years 26 days ago
Measuring mobility and the performance of global search algorithms
The global search properties of heuristic search algorithms are not well understood. In this paper, we introduce a new metric, mobility, that quantifies the dispersion of local o...
Monte Lunacek, L. Darrell Whitley, James N. Knight
CP
2008
Springer
13 years 9 months ago
Engineering Stochastic Local Search for the Low Autocorrelation Binary Sequence Problem
Abstract. This paper engineers a new state-of-the-art Stochastic Local Search (SLS) for the Low Autocorrelation Binary Sequence (LABS) problem. The new SLS solver is obtained with ...
Steven Halim, Roland H. C. Yap, Felix Halim