Cartesian Genetic Programming: Why No Bloat?

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

  author =       "Andrew Turner and Julian Miller",
  title =        "Cartesian Genetic Programming: Why No Bloat?",
  booktitle =    "17th European Conference on Genetic Programming",
  year =         "2014",
  editor =       "Miguel Nicolau and Krzysztof Krawiec and 
                 Malcolm I. Heywood and Mauro Castelli and Pablo Garcia-Sanchez and 
                 Juan J. Merelo and Victor M. {Rivas Santos} and 
                 Kevin Sim",
  series =       "LNCS",
  volume =       "8599",
  publisher =    "Springer",
  pages =        "222--233",
  address =      "Granada, Spain",
  month =        "23-25 " # apr,
  organisation = "EvoStar",
  keywords =     "genetic algorithms, genetic programming, Cartesian
                 Genetic Programming :poster",
  isbn13 =       "978-3-662-44302-6",
  DOI =          "doi:10.1007/978-3-662-44303-3_19",
  abstract =     "For many years now it has been known that Cartesian
                 Genetic Programming (CGP) does not exhibit program
                 bloat. Two possible explanations have been proposed in
                 the literature: neutral genetic drift and length bias.
                 This paper empirically disproves both of these and
                 thus, reopens the question as to why CGP does not
                 suffer from bloat. It has also been shown for CGP that
                 using a very large number of nodes considerably
                 increases the effectiveness of the search. This paper
                 also proposes a new explanation as to why this may be
                 the case.",
  notes =        "Part of \cite{Nicolau:2014:GP} EuroGP'2014 held in
                 conjunction with EvoCOP2014, EvoBIO2014, EvoMusArt2014
                 and EvoApplications2014",

Genetic Programming entries for Andrew James Turner Julian F Miller