A Non-Linear Schema Theorem for Genetic Algorithms

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

@InProceedings{Greene:2000:GECCO,

• author = "William A. Greene",
• title = "A Non-Linear Schema Theorem for Genetic Algorithms",
• pages = "189--194",
• year = "2000",
• publisher = "Morgan Kaufmann",
• booktitle = "Proceedings of the Genetic and Evolutionary Computation Conference (GECCO-2000)",
• editor = "Darrell Whitley and David Goldberg and Erick Cantu-Paz and Lee Spector and Ian Parmee and Hans-Georg Beyer",
• address = "Las Vegas, Nevada, USA",
• publisher_address = "San Francisco, CA 94104, USA",
• month = "10-12 " # jul,
• keywords = "genetic algorithms, genetic programming",
• ISBN = "1-55860-708-0",
• URL = "http://www.cs.uno.edu/People/Faculty/bill/NonLinSchemaTheorem-GECCO-2000.pdf",
• URL = "http://gpbib.cs.ucl.ac.uk/gecco2000/GA068.pdf",
• URL = "https://dl.acm.org/doi/10.5555/2933718.2933744",
• size = "6 pages",
• abstract = "We generalize Holland's Schema Theorem to the setting that genes are arranged, not necessarily in a linear sequence, but as the nodes in a connected graph. We have experimental results showing that the flourishing of building blocks can be expected for two distinct graphs we have investigated, one being a tree and the other being the lattice points in a cube in Euclidean 3-space.",
• notes = "A joint meeting of the ninth International Conference on Genetic Algorithms (ICGA-2000) and the fifth Annual Genetic Programming Conference (GP-2000) Part of \cite{whitley:2000:GECCO}",

}

Genetic Programming entries for William A Greene

Citations