Finding needles in haystacks is harder with neutrality

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

@Article{Collins:2006:GPEM,
  author =       "Mark Collins",
  title =        "Finding needles in haystacks is harder with
                 neutrality",
  journal =      "Genetic Programming and Evolvable Machines",
  year =         "2006",
  volume =       "7",
  number =       "2",
  pages =        "131--144",
  month =        aug,
  note =         "Special Issue: Best of GECCO 2005",
  keywords =     "genetic algorithms, genetic programming, Cartesian
                 genetic programming, random sampling, solution
                 density",
  ISSN =         "1389-2576",
  DOI =          "doi:10.1007/s10710-006-9001-y",
  abstract =     "an extended analysis of the reported successes of the
                 Cartesian Genetic Programming method on a simplified
                 form of the Boolean parity problem. We show the method
                 of sampling used by the CGP is significantly less
                 effective at locating solutions than the solution
                 density of the corresponding formula space would
                 warrant. We present results indicating that the loss of
                 performance is caused by the sampling bias of the CGP,
                 due to the neutrality friendly representation. We
                 implement a simple intron free random sampling
                 algorithm which performs considerably better on the
                 same problem and then explain how such performance is
                 possible.",
  notes =        "Reduced parity=given XOR and EQ only.",
}

Genetic Programming entries for Mark C Collins

Citations