Why ``Building Blocks'' Don't Work on Parity Problems

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

@TechReport{langdon:1998:BBparity,
  author =       "W. B. Langdon and R. Poli",
  title =        "Why ``Building Blocks'' Don't Work on Parity
                 Problems",
  institution =  "University of Birmingham, School of Computer Science",
  number =       "CSRP-98-17",
  month =        "13 " # jul,
  year =         "1998",
  keywords =     "genetic algorithms, genetic programming",
  file =         "/1998/CSRP-98-17.ps.gz",
  URL =          "ftp://ftp.cs.bham.ac.uk/pub/tech-reports/1998/CSRP-98-17.ps.gz",
  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.",
  notes =        "See also \cite{langdon:1999:sptfs}",
}

Genetic Programming entries for William B Langdon Riccardo Poli

Citations