Sciweavers

894 search results - page 9 / 179
» Parameter-less evolutionary search
Sort
View
UPP
2004
Springer
15 years 2 months ago
Inverse Design of Cellular Automata by Genetic Algorithms: An Unconventional Programming Paradigm
Evolving solutions rather than computing them certainly represents an unconventional programming approach. The general methodology of evolutionary computation has already been know...
Thomas Bäck, Ron Breukelaar, Lars Willmes
83
Voted
GECCO
2003
Springer
15 years 2 months ago
HEMO: A Sustainable Multi-objective Evolutionary Optimization Framework
The capability of multi-objective evolutionary algorithms (MOEAs) to handle premature convergence is critically important when applied to real-world problems. Their highly multi-mo...
Jianjun Hu, Kisung Seo, Zhun Fan, Ronald C. Rosenb...
GECCO
2004
Springer
119views Optimization» more  GECCO 2004»
15 years 2 months ago
Randomized Local Search, Evolutionary Algorithms, and the Minimum Spanning Tree Problem
Randomized search heuristics, among them randomized local search and evolutionary algorithms, are applied to problems whose structure is not well understood, as well as to problems...
Frank Neumann, Ingo Wegener
GECCO
2006
Springer
135views Optimization» more  GECCO 2006»
15 years 1 months ago
A simple line search operator for ridged landscapes
This paper describes a new simple operator for Evolutionary Algorithms (EA) to climb ridged landscapes. Categories and Subject Descriptors: I.2.8 [Computing Methodologies]: Proble...
Andrea Soltoggio
GECCO
2010
Springer
148views Optimization» more  GECCO 2010»
15 years 2 months ago
Guarding against premature convergence while accelerating evolutionary search
The fundamental dichotomy in evolutionary algorithms is that between exploration and exploitation. Recently, several algorithms [8, 9, 14, 16, 17, 20] have been introduced that gu...
Josh C. Bongard, Gregory S. Hornby