Locally geometric semantic crossover

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

  author =       "Krzysztof Krawiec and Tomasz Pawlak",
  title =        "Locally geometric semantic crossover",
  booktitle =    "GECCO Companion '12: Proceedings of the fourteenth
                 international conference on Genetic and evolutionary
                 computation conference companion",
  year =         "2012",
  editor =       "Terry Soule and Anne Auger and Jason Moore and 
                 David Pelta and Christine Solnon and Mike Preuss and 
                 Alan Dorin and Yew-Soon Ong and Christian Blum and 
                 Dario Landa Silva and Frank Neumann and Tina Yu and 
                 Aniko Ekart and Will Browne and Tim Kovacs and 
                 Man-Leung Wong and Clara Pizzuti and Jon Rowe and Tobias Friedrich and 
                 Giovanni Squillero and Nicolas Bredeche and 
                 Stephen L. Smith and Alison Motsinger-Reif and Jose Lozano and 
                 Martin Pelikan and Silja Meyer-Nienberg and 
                 Christian Igel and Greg Hornby and Rene Doursat and 
                 Steve Gustafson and Gustavo Olague and Shin Yoo and 
                 John Clark and Gabriela Ochoa and Gisele Pappa and 
                 Fernando Lobo and Daniel Tauritz and Jurgen Branke and 
                 Kalyanmoy Deb",
  isbn13 =       "978-1-4503-1178-6",
  keywords =     "genetic algorithms, Genetic programming: Poster",
  pages =        "1487--1488",
  month =        "7-11 " # jul,
  organisation = "SIGEVO",
  address =      "Philadelphia, Pennsylvania, USA",
  DOI =          "doi:10.1145/2330784.2331005",
  publisher =    "ACM",
  publisher_address = "New York, NY, USA",
  abstract =     "We propose Locally Geometric Crossover (LGX) for
                 genetic programming. For a pair of homologous loci in
                 the parent solutions, LGX finds a semantically
                 intermediate procedure from a previously prepared
                 library, and uses it as replacement code. The
                 experiments involving six symbolic regression problems
                 show significant increase in search performance when
                 compared to standard subtree-swapping cross-over and
                 other control methods. This suggests that semantically
                 geometric manipulations on subprograms propagate to
                 entire programs and improve their fitness.",
  notes =        "Also known as \cite{2331005} Distributed at

                 ACM Order Number 910122.",

Genetic Programming entries for Krzysztof Krawiec Tomasz Pawlak