Divide and Conquer: Genetic Programming Based on Multiple Branches Encoding

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

  author =       "Katya Rodriguez-Vazquez and Carlos Oliver-Morales",
  title =        "Divide and Conquer: Genetic Programming Based on
                 Multiple Branches Encoding",
  booktitle =    "Genetic Programming, Proceedings of EuroGP'2003",
  year =         "2003",
  editor =       "Conor Ryan and Terence Soule and Maarten Keijzer and 
                 Edward Tsang and Riccardo Poli and Ernesto Costa",
  volume =       "2610",
  series =       "LNCS",
  pages =        "218--228",
  address =      "Essex",
  publisher_address = "Berlin",
  month =        "14-16 " # apr,
  organisation = "EvoNet",
  publisher =    "Springer-Verlag",
  keywords =     "genetic algorithms, genetic programming",
  ISBN =         "3-540-00971-X",
  URL =          "http://www.springerlink.com/openurl.asp?genre=article&issn=0302-9743&volume=2610&spage=218",
  DOI =          "doi:10.1007/3-540-36599-0_20",
  abstract =     "This paper describes an alternative genetic
                 programming encoding, which is based on a rooted-node
                 with fixed-content. This rooted node combines partial
                 results of a set of multiple branches. Hence, this
                 approach is named Multiple Branches Genetic
                 Programming. It is tested on a symbolic regression
                 problem and used on a Boolean domain to solve the
                 even-n parity problem.",
  notes =        "EuroGP'2003 held in conjunction with EvoWorkshops

Genetic Programming entries for Katya Rodriguez-Vazquez Carlos Oliver-Morales