We investigate the distribution of performance of the
parity and always-on Boolean functions given only the
appropriate building block. These problems have
``needle in a haystack'' fitness landscape and so are
unsuitable for genetic programming or other progressive
search techniques. Theoretical analysis shows in the
limit as program size grows the density of solutions is
independent of size but falls exponentially with number
of inputs.(more)
Please log in to take part in the discussion (add own reviews or comments).
Cite this publication
More citation styles
- please select -
%0 Report
%1 langdon:1998:BBparity
%A Langdon, W. B.
%A Poli, R.
%D 1998
%K algorithms, genetic programming
%N CSRP-98-17
%T Why ``Building Blocks'' Don't Work on Parity
Problems
%U ftp://ftp.cs.bham.ac.uk/pub/tech-reports/1998/CSRP-98-17.ps.gz
%X We investigate the distribution of performance of the
parity and always-on Boolean functions given only the
appropriate building block. These problems have
``needle in a haystack'' fitness landscape and so are
unsuitable for genetic programming or other progressive
search techniques. Theoretical analysis shows in the
limit as program size grows the density of solutions is
independent of size but falls exponentially with number
of inputs.
@techreport{langdon:1998:BBparity,
abstract = {We investigate the distribution of performance of the
parity and always-on Boolean functions given only the
appropriate building block. These problems have
``needle in a haystack'' fitness landscape and so are
unsuitable for genetic programming or other progressive
search techniques. Theoretical analysis shows in the
limit as program size grows the density of solutions is
independent of size but falls exponentially with number
of inputs.},
added-at = {2008-06-19T17:35:00.000+0200},
author = {Langdon, W. B. and Poli, R.},
biburl = {https://www.bibsonomy.org/bibtex/2ca5e954d6cdfcd5daac6d0f4d414e85c/brazovayeye},
file = {/1998/CSRP-98-17.ps.gz},
institution = {University of Birmingham, School of Computer Science},
interhash = {d2f2b367c824c74e9ab252e07fe1ff3c},
intrahash = {ca5e954d6cdfcd5daac6d0f4d414e85c},
keywords = {algorithms, genetic programming},
month = {13 July},
number = {CSRP-98-17},
timestamp = {2008-06-19T17:44:52.000+0200},
title = {Why ``Building Blocks'' Don't Work on Parity
Problems},
url = {ftp://ftp.cs.bham.ac.uk/pub/tech-reports/1998/CSRP-98-17.ps.gz},
year = 1998
}