Genetic programming with primitive recursion

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

@InProceedings{1144160,
  author =       "Stefan Kahrs",
  title =        "Genetic programming with primitive recursion",
  booktitle =    "{GECCO 2006:} Proceedings of the 8th annual conference
                 on Genetic and evolutionary computation",
  year =         "2006",
  editor =       "Maarten Keijzer and Mike Cattolico and Dirk Arnold and 
                 Vladan Babovic and Christian Blum and Peter Bosman and 
                 Martin V. Butz and Carlos {Coello Coello} and 
                 Dipankar Dasgupta and Sevan G. Ficici and James Foster and 
                 Arturo Hernandez-Aguirre and Greg Hornby and 
                 Hod Lipson and Phil McMinn and Jason Moore and Guenther Raidl and 
                 Franz Rothlauf and Conor Ryan and Dirk Thierens",
  volume =       "1",
  ISBN =         "1-59593-186-4",
  pages =        "941--942",
  address =      "Seattle, Washington, USA",
  URL =          "http://www.cs.bham.ac.uk/~wbl/biblio/gecco2006/docs/p941.pdf",
  DOI =          "doi:10.1145/1143997.1144160",
  publisher =    "ACM Press",
  publisher_address = "New York, NY, 10286-1405, USA",
  month =        "8-12 " # jul,
  organisation = "ACM SIGEVO (formerly ISGEC)",
  keywords =     "genetic algorithms, genetic programming, grammatical
                 evolution, primitive recursion, program transformation,
                 theory: Poster",
  abstract =     "When Genetic Programming is used to evolve arithmetic
                 functions it often operates by composing them from a
                 fixed collection of elementary operators and applying
                 them to parameters or certain primitive constants. This
                 limits the expressiveness of the programs that can be
                 evolved. It is possible to extend the expressiveness of
                 such an approach significantly without leaving the
                 comfort of terminating programs by including primitive
                 recursion as a control operation.The technique used
                 here was gene expression programming [2], a variation
                 of grammatical evolution [8]. Grammatical evolution
                 avoids the problem of program bloat; its separation of
                 genotype (string of symbols) and phenotype (expression
                 tree) permits to optimise the generated programs
                 without interfering with the evolutionary process.",
  notes =        "GECCO-2006 A joint meeting of the fifteenth
                 international conference on genetic algorithms
                 (ICGA-2006) and the eleventh annual genetic programming
                 conference (GP-2006).

                 ACM Order Number 910060",
}

Genetic Programming entries for Stefan Kahrs

Citations