Sciweavers

2174 search results - page 22 / 435
» On the Brittleness of Evolutionary Algorithms
Sort
View
AUSAI
2005
Springer
14 years 12 months ago
A Comparison of Evolutionary Methods for the Discovery of Local Search Heuristics
Abstract. Methods of adaptive constraint satisfaction have recently become of interest to overcome the limitations imposed on “black-box” search algorithms by the no free lunch...
Stuart Bain, John Thornton, Abdul Sattar
KES
2007
Springer
14 years 10 months ago
Experimental Analysis of the Aging Operator for Static and Dynamic Optimisation Problems
Abstract. This work presents an analysis of the static Aging operator for different evolutionary algorithms: two immunological algorithms (OptIA and Clonalg), a standard genetic a...
Mario Castrogiovanni, Giuseppe Nicosia, Rosario Ra...
ICMLC
2005
Springer
15 years 3 months ago
Evolutionary Synthesis of Micromachines Using Supervisory Multiobjective Interactive Evolutionary Computation
A novel method of Interactive Evolutionary Computation (IEC) for the design of microelectromechanical systems (MEMS) is presented. As the main limitation of IEC is human fatigue, a...
Raffi R. Kamalian, Ying Zhang, Hideyuki Takagi, Al...
GECCO
2007
Springer
153views Optimization» more  GECCO 2007»
15 years 4 months ago
Analyzing the effects of module encapsulation on search space bias
Modularity is thought to improve the evolvability of biological systems [18, 22]. Recent studies in the field of evolutionary computation show that the use of modularity improves...
Ozlem O. Garibay, Annie S. Wu
EOR
2000
43views more  EOR 2000»
14 years 9 months ago
A framework for the description of evolutionary algorithms
Evolutionary algorithms (EA) are optimisation techniques inspired from natural evolution processes. They handle a population of individuals that evolve with the help of informatio...
Alain Hertz, Daniel Kobler