2026-07-22T17:01:27Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:2814 2024-03-06T11:09:27Z ddc:004 open_access

2-bit Flip Mutation Elementary Fitness Landscapes Langdon, William Genetic Algorithms Genetic Programming search optimisation graph theory Laplacian Hamming cube Genetic Programming parity is not elementary. GP parity cannot be represented as the sum of a small number of elementary landscapes. Statistics, including fitness distance correlation, of Parity's fitness landscape are calculated. Using Walsh analysis the eigen values and eigenvectors of the Laplacian of the two bit flip fitness landscape are given and a ruggedness measure for elementary landscapes is proposed. An elementary needle in a haystack (NIH) landscape is given. Schloss Dagstuhl – Leibniz-Zentrum für Informatik William Langdon 2010 Is Part Of Dagstuhl Seminar Proceedings, Volume 10361, Theory of Evolutionary Algorithms (2010) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/DagSemProc.10361.2 urn:nbn:de:0030-drops-28146 https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.10361.2 eng https://creativecommons.org/licenses/by/4.0/legalcode