- author = "W. B. Langdon and R. Poli",
- title = "Boolean Functions Fitness Spaces",
- booktitle = "Late Breaking Papers at the Genetic Programming 1998 Conference",
- year = "1998",
- editor = "John R. Koza",
- pages = "125--133",
- address = "University of Wisconsin, Madison, Wisconsin, USA",
- publisher_address = "Stanford, California, 94305-3079 USA",
- month = "22-25 " # jul,
- publisher = "Stanford University Bookstore",
- keywords = "genetic algorithms, genetic programming",
-
URL = "
http://www.cs.ucl.ac.uk/staff/W.Langdon/ftp/papers/CSRP-98-16.ps.gz",
-
URL = "
http://www.cs.ucl.ac.uk/staff/W.Langdon/csrp-98-16",
- size = "9 pages",
-
abstract = "We investigate the distribution of performance of the
Boolean functions of 3 Boolean inputs (particularly
that of the parity functions), the always-on-6 and
even-6 parity functions. We use enumeration, uniform
Monte-Carlo random sampling and sampling random full
trees. As expected XOR dramatically changes the fitness
distributions. In all cases once some minimum size
threshold has been exceeded, the distribution of
performance is approximately independent of program
length. However the distribution of the performance of
full trees is different from that of asymmetric trees
and varies with tree depth.
We consider but reject testing the No Free Lunch (NFL) theorems on these functions.",
-
notes = "GP-98LB, see also \cite{langdon:1999:bool},
\cite{langdon:1999:sptfs}
Also available as Technical Report CSRP-98-16, University of Birmingham, School of Computer Science, June 1998.",
