715 search results - page 78 / 143 » Neighborhood structures for genetic local search algorithms |
191
click to vote
CORR
2010
Springer
15 years 1 months ago
2010
Springer
This paper extends the analogies employed in the development of quantum-inspired evolutionary algorithms by proposing quantum-inspired Hadamard walks, called QHW. A novel quantum-...
144
click to vote
MICAI
2004
Springer
15 years 11 months ago
2004
Springer
A preprocessing procedure that uses a local guided search defined in terms of a neighborhood structure to get a feasible solution (UB) and the Osorio and Glover[18, 20] exploiting ...
154
click to vote
TCAD
2002
15 years 5 months ago
2002
Abstract--This paper presents a solution to the problem of performance-driven buffered routing tree generation for VLSI circuits. Using a novel bottom-up construction algorithm and...
218
Voted
GECCO
2004
Springer
15 years 11 months ago
2004
Springer
Abstract. Improving image quality is the backbone of highly competitive display industry. Contemporary video processing system design is a challenging optimization problem. General...
143
Voted
PPSN
2010
Springer
15 years 4 months ago
2010
Springer
Abstract. This paper extends a recently proposed model for combinatorial landscapes: Local Optima Networks (LON), to incorporate a first-improvement (greedyascent) hill-climbing a...