Schema Disruption in Chromosomes That Are Structured as Binary Trees

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

@InProceedings{greene:sdi:gecco2004,

• author = "William A. Greene",
• title = "Schema Disruption in Chromosomes That Are Structured as Binary Trees",
• booktitle = "Genetic and Evolutionary Computation -- GECCO-2004, Part I",
• year = "2004",
• editor = "Kalyanmoy Deb and Riccardo Poli and Wolfgang Banzhaf and Hans-Georg Beyer and Edmund Burke and Paul Darwen and Dipankar Dasgupta and Dario Floreano and James Foster and Mark Harman and Owen Holland and Pier Luca Lanzi and Lee Spector and Andrea Tettamanzi and Dirk Thierens and Andy Tyrrell",
• series = "Lecture Notes in Computer Science",
• pages = "1197--1207",
• address = "Seattle, WA, USA",
• publisher_address = "Heidelberg",
• month = "26-30 " # jun,
• organisation = "ISGEC",
• publisher = "Springer-Verlag",
• volume = "3102",
• ISBN = "3-540-22344-4",
• ISSN = "0302-9743",
• URL = "http://www.cs.uno.edu/People/Faculty/bill/Schema-disruption-binary-trees-GECCO-2004.pdf",
• DOI = "doi:10.1007/978-3-540-24854-5_116",
• DOI = "doi:10.1007/b98643",
• size = "11",
• keywords = "genetic algorithms, genetic programming",
• abstract = "We are interested in schema disruption behaviour when chromosomes are structured as binary trees. We give the definition of the disruption probability dp(H) of a schema H, and also the relative diameter rel?(H) of H. We show that in the general case that dp(H) can far exceed rel?(H), but when the chromosome is a complete binary tree then the inequality dp(H) = rel?(H) holds almost always. Thus the more compactly the tree chromosome is structured, the better is the behavior to be expected from geneticism.",
• notes = "GECCO-2004 A joint meeting of the thirteenth international conference on genetic algorithms (ICGA-2004) and the ninth annual genetic programming conference (GP-2004)",

}

Genetic Programming entries for William A Greene

Citations