Linear-Graph GP---A new GP Structure

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

@InProceedings{kantschik:2002:EuroGP,
  title =        "Linear-Graph {GP}---A new {GP} Structure",
  author =       "Wolfgang Kantschik and Wolfgang Banzhaf",
  editor =       "James A. Foster and Evelyne Lutton and 
                 Julian Miller and Conor Ryan and Andrea G. B. Tettamanzi",
  booktitle =    "Genetic Programming, Proceedings of the 5th European
                 Conference, EuroGP 2002",
  volume =       "2278",
  series =       "LNCS",
  pages =        "83--92",
  publisher =    "Springer-Verlag",
  address =      "Kinsale, Ireland",
  publisher_address = "Berlin",
  month =        "3-5 " # apr,
  year =         "2002",
  keywords =     "genetic algorithms, genetic programming",
  ISBN =         "3-540-43378-3",
  DOI =          "doi:10.1007/3-540-45984-7_8",
  abstract =     "In recent years different genetic programming (GP)
                 structures have emerged. Today, the basic forms of
                 representation for genetic programs are tree, linear
                 and graph structures. In this contribution we introduce
                 a new kind of GP structure which we call linear-graph,
                 it is a further development of the linear-Tree
                 structure. We describe the linear-graph structure, as
                 well as crossover and mutation for this new GP
                 structure in detail. We compare linear-graph programs
                 with linear and tree programs by analyzing their
                 structure and results on different test problems.",
  notes =        "EuroGP'2002, part of \cite{lutton:2002:GP}",
}

Genetic Programming entries for Wolfgang Kantschik Wolfgang Banzhaf

Citations