Boolean Functions Fitness Spaces

Created by W.Langdon from gp-bibliography.bib Revision:1.4524

  author =       "W. B. Langdon and R. Poli",
  title =        "Boolean Functions Fitness Spaces",
  booktitle =    "Late Breaking Papers at the Genetic Programming 1998
  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 =          "",
  URL =          "",
  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},

                 Also available as Technical Report CSRP-98-16,
                 University of Birmingham, School of Computer Science,
                 June 1998.",

Genetic Programming entries for William B Langdon Riccardo Poli