Elementary bit string mutation landscapes

DOI10.1145/1967654.1967658MaRDI QIDQ5276081zbMATH OpenOpenAlexFDO

Authors William B. Langdon

Publication date 14 July 2017

Published in Proceedings of the 11th workshop proceedings on Foundations of genetic algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/1967654.1967658

zbMATH Keywords

elementary fitness autocorrelationfitness distance correlationgenetic algorithmsgenetic programminggraph theoryHamming cubeLaplacianoptimisationsearchWalsh transform

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• scientific article; zbMATH DE number 1664954
• Rugged and elementary landscapes
• A study of the neutrality of Boolean function landscapes in genetic programming
• scientific article; zbMATH DE number 2040710
• scientific article; zbMATH DE number 1617336

Cited in

(6)

• scientific article; zbMATH DE number 1664954 (Why is no real title available?)
• Exact computation of the fitness-distance correlation for pseudoboolean functions with one global optimum
• A study of the neutrality of Boolean function landscapes in genetic programming
• scientific article; zbMATH DE number 2040710 (Why is no real title available?)
• scientific article; zbMATH DE number 1872148 (Why is no real title available?)
• On the Effects of Bit-Wise Neutrality on Fitness Distance Correlation, Phenotypic Mutation Rates and Problem Hardness

This page was built for publication: Elementary bit string mutation landscapes

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