Neutrality and self-adaptation

DOI10.1023/A:1024906105255zbMath1059.68088OpenAlexW2143581805MaRDI QIDQ1424774

Christian Igel, Marc Toussaint

Publication date: 15 March 2004

Published in: Natural Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1024906105255

zbMATH Keywords

redundancyevolutionary computationneutralityself-adaptationgenotype-phenotype mappingNo-Free-Lunch theorem

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Learning and adaptive systems in artificial intelligence (68T05)

Related Items (4)

Graph 3-coloring with a hybrid self-adaptive evolutionary algorithm ⋮ No Free Lunch Theorems: Limitations and Perspectives of Metaheuristics ⋮ When to use bit-wise neutrality ⋮ A no-free-lunch theorem for non-uniform distributions of target functions

This page was built for publication: Neutrality and self-adaptation