A Schema-Based Version of Geiringer's Theorem for Nonlinear Genetic Programming with Homologous Crossover

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

  author =       "Boris Mitavskiy and Jonathan E. Rowe",
  title =        "A Schema-Based Version of {Geiringer's} Theorem for
                 Nonlinear Genetic Programming with Homologous
  year =         "2005",
  series =       "Lecture Notes in Computer Science",
  pages =        "156--175",
  booktitle =    "Foundations of Genetic Algorithms 8",
  editor =       "Alden H. Wright and Michael D. Vose and 
                 Kenneth A. {De Jong} and Lothar M. Schmitt",
  address =      "Berlin Heidelberg",
  publisher =    "Springer-Verlag",
  volume =       "3469",
  keywords =     "genetic algorithms, genetic programming",
  ISBN =         "3-540-27237-2",
  URL =          "http://www.springerlink.com/openurl.asp?genre=article&issn=0302-9743&volume=3469&spage=156",
  DOI =          "doi:10.1007/b138412",
  abstract =     "Geiringer's theorem is a statement which tells us
                 something about the limiting frequency of occurrence of
                 a certain individual when a classical genetic algorithm
                 is executed in the absence of selection and mutation.
                 Recently Poli, Stephens, Wright and Rowe extended the
                 original theorem of Geiringer to include the case of
                 variable length genetic algorithms and linear genetic
                 programming. Here a rather powerful version of
                 Geiringer's theorem, which has been established
                 recently by Mitavskiy, is used to derive a schema-based
                 version of the theorem for nonlinear genetic
                 programming with homologous crossover.",
  notes =        "Workshop 5-9 January 2005 in Aizu-Wakamatsu City,
                 Japan also known as \cite{conf/foga/MitavskiyR05}",

Genetic Programming entries for Boris Mitavskiy Jonathan E Rowe