2174 search results - page 147 / 435 » On the Brittleness of Evolutionary Algorithms |
158
click to vote
CEC
2003
IEEE
15 years 11 months ago
2003
IEEE
Neural networks and the Kriging method are compared for constructing £tness approximation models in evolutionary optimization algorithms. The two models are applied in an identica...
222
click to vote
EC
2007
15 years 6 months ago
2007
Randomized search heuristics (e.g., evolutionary algorithms, simulated annealing etc.) are very appealing to practitioners, they are easy to implement and usually provide good per...
163
click to vote
GECCO
2006
Springer
15 years 10 months ago
2006
Springer
1 Learnable Evolution Model (LEM) is a form of non-Darwinian evolutionary computation that employs machine learning to guide evolutionary processes. Its main novelty are new type o...
187
click to vote
EC
2000
15 years 6 months ago
2000
To successfully apply evolutionary algorithms to the solution of increasingly complex problems, we must develop effective techniques for evolving solutions in the form of interact...
153
click to vote
GPEM
2007
15 years 6 months ago
2007
We present a novel means of algorithmically describing a growth process that is an extension of Lindenmayer’s Map L-systems. This growth process relies upon a set of rewrite rule...