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 https://www.ucl.ac.uk/finance/research/rs-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
Email: portico-services@ucl.ac.uk
Help Desk: http://www.ucl.ac.uk/ras/portico/helpdesk
Publication Detail
Elementary bit string mutation landscapes
-
Publication Type:Journal article
-
Publication Sub Type:Article
-
Authors:Langdon WB
-
Publisher:ACM
-
Publication date:2011
-
Pagination:25, 41
-
Journal:FOGA'11 - Proceedings of the 2011 ACM/SIGEVO Foundations of Genetic Algorithms XI
-
Editors:Beyer H-G,Langdon WB
-
Country:Schwarzenberg, Austria
Abstract
Genetic Programming parity with only XOR is not elementary. GP parity can be represented as the sum of k/2+1
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, three bit, n-bit and mutation only Genetic Algorithm fitness
landscapes are given. Indeed all elementary bit string landscapes are
related to the discrete Fourier functions. However most are rough (lambda/d approx 1). Also in many cases fitness autocorrelation falls rapidly with distance. GA runs support eigenvalue/graph degree (lambda/d)
as a measure of the ruggedness of elementary landscapes for predicting
problem difficulty. The elementary needle in a haystack (NIH) landscape
is described.
› More search options
UCL Researchers