UCL  IRIS
Institutional Research Information Service
UCL Logo
Please report any queries concerning the funding data grouped in the sections named "Externally Awarded" or "Internally Disbursed" (shown on the profile page) to your Research Finance Administrator. Your can find your Research Finance Administrator at http://www.ucl.ac.uk/finance/research/post_award/post_award_contacts.php by entering your department
Please report any queries concerning the student data shown on the profile page to:

Email: portico-services@ucl.ac.uk

Help Desk: http://www.ucl.ac.uk/ras/portico/helpdesk
Publication Detail
2-bit Flip Mutation Elementary Fitness Landscapes
  • Publication Type:
    Report
  • Authors:
    Langdon WB
  • publication date:
    15/09/2010
  • Place of publication:
    Gower Street, London WC1E 6BT, UK
  • Report number:
    RN/10/04
  • Notes:
    Presented at Dagstuhl Seminar 10361, Theory of Evolutionary Algorithms, 8 September 2010 keywords: genetic algorithms, genetic programming, search, optimisation, graph theory, Laplacian, Hamming cube notes: Cf \citelangdon: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 \citelangdon:DSP:2010:2814 size: 20 pages
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.
Publication data is maintained in RPS. Visit https://rps.ucl.ac.uk
 More search options
UCL Researchers
Author
Dept of Computer Science
University College London - Gower Street - London - WC1E 6BT Tel:+44 (0)20 7679 2000

© UCL 1999–2011

Search by