%0 Book Section %1 Mitavskiy:FOGA2005 %A Mitavskiy, Boris %A Rowe, Jonathan E. %B Foundations of Genetic Algorithms 8 %C Berlin Heidelberg %D 2005 %E Wright, Alden H. %E Vose, Michael D. %E De Jong, Kenneth A. %E Schmitt, Lothar M. %I Springer-Verlag %K algorithms, genetic programming %P 156--175 %R doi:10.1007/b138412 %T A Schema-Based Version of Geiringer's Theorem for Nonlinear Genetic Programming with Homologous Crossover %U http://www.springerlink.com/openurl.asp?genre=article&issn=0302-9743&volume=3469&spage=156 %V 3469 %X 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. %@ 3-540-27237-2

@incollection{Mitavskiy:FOGA2005, 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.}, added-at = {2008-06-19T17:35:00.000+0200}, address = {Berlin Heidelberg}, author = {Mitavskiy, Boris and Rowe, Jonathan E.}, biburl = {https://www.bibsonomy.org/bibtex/2705866ee96c390917e669299e10e3cdf/brazovayeye}, booktitle = {Foundations of Genetic Algorithms 8}, doi = {doi:10.1007/b138412}, editor = {Wright, Alden H. and Vose, Michael D. and {De Jong}, Kenneth A. and Schmitt, Lothar M.}, interhash = {a77d9c995a262f534061d8175edfa376}, intrahash = {705866ee96c390917e669299e10e3cdf}, isbn = {3-540-27237-2}, keywords = {algorithms, genetic programming}, notes = {Workshop 5-9 January 2005 in Aizu-Wakamatsu City, Japan also known as \cite{conf/foga/MitavskiyR05}}, pages = {156--175}, publisher = {Springer-Verlag}, series = {Lecture Notes in Computer Science}, timestamp = {2008-06-19T17:47:23.000+0200}, title = {A Schema-Based Version of {Geiringer's} Theorem for Nonlinear Genetic Programming with Homologous Crossover}, url = {http://www.springerlink.com/openurl.asp?genre=article&issn=0302-9743&volume=3469&spage=156}, volume = 3469, year = 2005 }