Changing the Genospace: Solving GA Problems with Cartesian Genetic Programming

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

  author =       "James Alfred Walker and Julian Francis Miller",
  title =        "Changing the Genospace: Solving GA Problems with
                 Cartesian Genetic Programming",
  editor =       "Marc Ebner and Michael O'Neill and Anik\'o Ek\'art and 
                 Leonardo Vanneschi and Anna Isabel Esparcia-Alc\'azar",
  booktitle =    "Proceedings of the 10th European Conference on Genetic
  publisher =    "Springer",
  series =       "Lecture Notes in Computer Science",
  volume =       "4445",
  year =         "2007",
  address =      "Valencia, Spain",
  month =        "11-13 " # apr,
  pages =        "261--270",
  keywords =     "genetic algorithms, genetic programming, cartesian
                 genetic programming",
  ISBN =         "3-540-71602-5",
  isbn13 =       "978-3-540-71602-0",
  DOI =          "doi:10.1007/978-3-540-71605-1_24",
  abstract =     "Embedded Cartesian Genetic Programming (ECGP) is an
                 extension of Cartesian Genetic Programming (CGP)
                 capable of acquiring, evolving and re-using partial
                 solutions. In this paper, we apply for the first time
                 CGP and ECGP to the ones-max and order-3 deceptive
                 problems, which are normally associated with Genetic
                 Algorithms. Our approach uses CGP and ECGP to evolve a
                 sequence of commands for a tape-head, which produces an
                 arbitrary length binary string on a piece of tape.
                 Computational effort figures are calculated for CGP and
                 ECGP and our results compare favourably with those of
                 Genetic Algorithms.",
  notes =        "Part of \cite{ebner:2007:GP} EuroGP'2007 held in
                 conjunction with EvoCOP2007, EvoBIO2007 and

Genetic Programming entries for James Alfred Walker Julian F Miller