Neutrality and the evolvability of Boolean function landscape

DOI10.1007/3-540-45355-5_16MaRDI QIDQ2768632zbMATH OpenFDO

Authors Tina Yu, Julian F. Miller

Publication date 3 February 2002

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2038/20380204

Mathematics Subject Classification ID

Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Learning and adaptive systems in artificial intelligence (68T05) Computing methodologies and applications (68U99)

Recommendations

• A study of the neutrality of Boolean function landscapes in genetic programming
• Neutrality and self-adaptation
• Synthetic neutrality for artificial evolution
• On the Effects of Bit-Wise Neutrality on Fitness Distance Correlation, Phenotypic Mutation Rates and Problem Hardness
• scientific article; zbMATH DE number 1901180

Cited in

(9)

• Neutrality and self-adaptation
• Synthetic neutrality for artificial evolution
• Neutral Fitness Landscape in the Cellular Automata Majority Problem
• A study of the neutrality of Boolean function landscapes in genetic programming
• scientific article; zbMATH DE number 2087177 (Why is no real title available?)
• Percolation in bipartite Boolean networks and its role in sustaining life
• On the Effects of Bit-Wise Neutrality on Fitness Distance Correlation, Phenotypic Mutation Rates and Problem Hardness
• Weighted Mutation of Connections To Mitigate Search Space Limitations in Cartesian Genetic Programming
• When to use bit-wise neutrality

This page was built for publication: Neutrality and the evolvability of Boolean function landscape

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2768632)