Modularity in Genetic Programming

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

  author =       "John R. Woodward",
  title =        "Modularity in Genetic Programming",
  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 =        "254--263",
  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 =          "",
  URL =          "",
  DOI =          "doi:10.1007/3-540-36599-0_23",
  abstract =     "Genetic Programming uses a tree based representation
                 to express solutions to problems. Trees are constructed
                 from a primitive set which consists of a function set
                 and a terminal set. An extension to GP is the ability
                 to define modules, which are in turn tree based
                 representations defined in terms of the primitives. The
                 most well known of these methods is Koza's
                 Automatically Defined Functions. In this paper it is
                 proved that for a given problem, the minimum number of
                 nodes in the main tree plus the nodes in any modules is
                 independent of the primitive set (up to an additive
                 constant) and depends only on the function being
                 expressed. This reduces the number of user defined
                 parameters in the run and makes the inclusion of a
                 hypothesis in the search space independent of the
                 primitive set.",
  notes =        "EuroGP'2003 held in conjunction with EvoWorkshops

Genetic Programming entries for John R Woodward