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

- @InProceedings{bohm:1996:eui,
- author = "Walter Bohm and Andreas Geyer-Schulz",
- title = "Exact Uniform Initialization for Genetic Programming",
- booktitle = "Foundations of Genetic Algorithms IV",
- year = "1996",
- editor = "Richard K. Belew and Michael Vose",
- pages = "379--407",
- address = "University of San Diego, CA, USA",
- publisher_address = "San Francisco, California, USA",
- month = "3--5 " # aug,
- publisher = "Morgan Kaufmann",
- keywords = "genetic algorithms, genetic programming",
- ISBN = "1-55860-460-X",
- URL = "http://www.cs.ucl.ac.uk/staff/W.Langdon/ftp/papers/bohm_1996_eui.pdf",
- URL = "http://cseweb.ucsd.edu/~rik/foga4/Abstracts/07-wb-abs.html",
- size = "29 pages",
- abstract = "In this paper we solve the problem of exactly uniform generation of complete derivation trees from k-bounded context-free languages. The result is applied and is used for developing an exact uniform initialization routine for a genetic programming variant based on an explicit representation of the grammar of the context-free language (simple genetic algorithm over k-bounded context-free languages) [Geyer-Schulz1996b]. In this genetic programming variant the grammar is used to generate complete derivation trees which constitute the genomes for the algorithm. For the case that no a priori information about the solution is available, we prove that this (simple random sampling) algorithm is optimal in the sense of a minimax strategy. An exact uniform initialization routine for Koza's genetic programming variant [Koza1992] is derived as a special case.",
- notes = "FOGA4 k-bounded context-free languages May also use key Boehm96 Demonstrated on XOR problem",
- }

Genetic Programming entries for Walter Boehm Andreas Geyer-Schulz