- author = "W. B. Langdon",
- title = "2-bit Flip Mutation Elementary Fitness Landscapes",
- institution = "Department of Computer Science, University College London",
- year = "2010",
- type = "Research Note",
- number = "RN/10/04",
- address = "Gower Street, London WC1E 6BT, UK",
- month = "15 " # sep,
- note = "Presented at Dagstuhl Seminar 10361, Theory of Evolutionary Algorithms, 8 September 2010",
- keywords = "genetic algorithms, genetic programming, search, optimisation, graph theory, Laplacian, Hamming cube",
-
URL = "
http://www.cs.ucl.ac.uk/research/researchnotes/documents/RN_10_04_000.pdf",
-
URL = "
http://www.dagstuhl.de/Materials/Files/10/10361/10361.LangdonWilliam.Abstract.txt",
-
URL = "http://drops.dagstuhl.de/opus/volltexte/2010/2814/pdf/10361.LangdonWilliam.Paper.2814.pdf",
- abstract = "Genetic Programming parity with only XOR is not elementary. GP parity can be represented as the sum of 1+0.5k elementary landscapes. Statistics, including fitness distance correlation (FDC), 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. Tests support lambda/node degree as a measure of the ruggedness of elementary landscapes for predicting problem difficulty. An elementary needle in a haystack (NIH) landscape is given.",
-
notes = "Cf \cite{langdon:2011:foga} Slides
http://www.dagstuhl.de/Materials/Files/10/10361/10361.LangdonWilliam.Slides.pdf
Also available as part of: booktitle = Theory of Evolutionary Algorithms, year = 2010, editor = Anne Auger and Jonathan L. Shapiro and L. Darrell Whitley and Carsten Witt, number = 10361, series = Dagstuhl Seminar Proceedings, ISSN = 1862-4405, publisher = Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, Germany, address = Dagstuhl, Germany, URL = http://drops.dagstuhl.de/opus/volltexte/2010/2814,
Also known as \cite{langdon:DSP:2010:2814}",
- size = "20 pages",
