Sciweavers

1026 search results - page 137 / 206
» An Optimal Solution to Room Search Problem
Sort
View
GECCO
2007
Springer
150views Optimization» more  GECCO 2007»
15 years 10 months ago
Overcoming hierarchical difficulty by hill-climbing the building block structure
The Building Block Hypothesis suggests that Genetic Algorithms (GAs) are well-suited for hierarchical problems, where efficient solving requires proper problem decomposition and a...
David Iclanzan, Dan Dumitrescu
GECCO
2006
Springer
164views Optimization» more  GECCO 2006»
15 years 10 months ago
Adaptation for parallel memetic algorithm based on population entropy
In this paper, we propose the island model parallel memetic algorithm with diversity-based dynamic adaptive strategy (PMADLS) for controlling the local search frequency and demons...
Jing Tang, Meng-Hiot Lim, Yew-Soon Ong
IEICET
2007
90views more  IEICET 2007»
15 years 5 months ago
Multi-Point Simulated Annealing with Adaptive Neighborhood
—When SA is applied to continuous optimization problems, the design of the neighborhood used in SA becomes important. A lot of experiments are necessary to determine an appropria...
Keiko Ando, Mitsunori Miki, Tomoyuki Hiroyasu
ICGA
1993
140views Optimization» more  ICGA 1993»
15 years 7 months ago
Expected Allele Coverage and the Role of Mutation in Genetic Algorithms
It is part of the traditional lore of genetic algorithms that low mutation rates lead to efficient search of the solution space, while high mutation rates result in diffusion of s...
David M. Tate, Alice E. Smith
GECCO
2005
Springer
153views Optimization» more  GECCO 2005»
15 years 12 months ago
Finding needles in haystacks is harder with neutrality
This research presents an analysis of the reported successes of the Cartesian Genetic Programming method on a simplified form of the Boolean parity problem. We show the method of...
M. Collins