Exact Schema Theorems and Markov Chain Models for Genetic Programming and Variable Length Genetic Algorithms

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

@TechReport{poli:2002:dagstuhl,
  title =        "Exact Schema Theorems and Markov Chain Models for
                 Genetic Programming and Variable Length Genetic
                 Algorithms",
  author =       "Riccardo Poli",
  editor =       "Hans-Georg Beyer and Ken {De Jong} and 
                 Colin Reeves and Ingo Wegener",
  booktitle =    "Theory of Evolutionary Algorithms",
  institution =  "Dagstuhl",
  year =         "2002",
  type =         "Report",
  number =       "330",
  address =      "Germany",
  month =        "13-18 " # jan,
  pages =        "14",
  keywords =     "genetic algorithms, genetic programming",
  URL =          "http://www.dagstuhl.de/files/Reports/02/02031.pdf",
  URL =          "http://www.dagstuhl.de/files/Reports/02/02031.ps.gz",
  abstract =     "In my talk I have given an overview of the recent
                 advances in the schema theory for genetic programming
                 (GP) and variable length genetic algorithms (GAs). I
                 have also indicated how GP theory is a generalization
                 of the corresponding theory for GAs operating on xed
                 length strings. In the talk I have also shown how one
                 can extend the Nix and Vose Markov chain model for GAs
                 to GP and variable length GAs. Finally I have brie y
                 indicated some applications of the schema theory,
                 including extensions of Geiringer's theorem to variable
                 length strings under homologous and subtree
                 crossover.",
  notes =        "Seminar No. 02031",
}

Genetic Programming entries for Riccardo Poli