Sciweavers

715 search results - page 78 / 143
» Neighborhood structures for genetic local search algorithms
Sort
View
CORR
2010
Springer
102views Education» more  CORR 2010»
14 years 4 months ago
Superior Exploration-Exploitation Balance with Quantum-Inspired Hadamard Walks
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-...
Sisir Koppaka, Ashish Ranjan Hota
MICAI
2004
Springer
15 years 3 months ago
A Preprocessing That Combines Heuristic and Surrogate Constraint Analysis to Fix Variables in TSP
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 ...
María Auxilio Osorio Lama, David Pinto
TCAD
2002
93views more  TCAD 2002»
14 years 9 months ago
Hierarchical buffered routing tree generation
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...
Amir H. Salek, Jinan Lou, Massoud Pedram
GECCO
2004
Springer
129views Optimization» more  GECCO 2004»
15 years 3 months ago
Memetic Optimization of Video Chain Designs
Abstract. Improving image quality is the backbone of highly competitive display industry. Contemporary video processing system design is a challenging optimization problem. General...
Walid Ali, Alexander P. Topchy
PPSN
2010
Springer
14 years 8 months ago
First-Improvement vs. Best-Improvement Local Optima Networks of NK Landscapes
Abstract. This paper extends a recently proposed model for combinatorial landscapes: Local Optima Networks (LON), to incorporate a first-improvement (greedyascent) hill-climbing a...
Gabriela Ochoa, Sébastien Vérel, Mar...