Dagstuhl Seminar Proceedings. 10361 - Theory of Evolutionary Algorithms
Doi
Abstract
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\u27s 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
