(Enter summary)
Abstract: The basic Schema Theorem for genetic algorithms is modified for a grammatically-based
learning system. A context-free grammar is used to define a language in which each sentence
is mapped to a fitness value. The derivation trees associated with these sentences are used to
define the structure of schemata. The effect of crossover and mutation on schemata is described.
A schema theorem is developed which describes how sentences of a language are propagated
during evolution.
1. Introduction
The... (Update)
Cited by: More
Genetic Programming 1997: Proceedings of the Second.. - Kalyanmoy Deb And
(Correct)
Exact GP Schema Theory for Headless Chicken Crossover and.. - Riccardo Poli School (2001)
(Correct)
General Schema Theory for - Genetic Programming With (2003)
(Correct)
Active bibliography (related documents): More All
0.7: Grammatically-based Genetic Programming - Whigham (1995)
(Correct)
0.2: Inductive Bias and Genetic Programming - Whigham (1995)
(Correct)
0.2: Software Project Effort Estimation Using Genetic Programming - Shan, McKay, Lokan, Essam
(Correct)
Similar documents based on text: More All
0.2: Search Bias, Language Bias and Genetic Programming - Whigham (1996)
(Correct)
0.1: Grammars with Generalized Contextfree Rules and Their Tree Automata - Volger (1999)
(Correct)
0.1: A Survey and Comparison of Tree Generation Algorithms - Luke, Panait (2001)
(Correct)
Related documents from co-citation: More All
35: Adaptation in Natural and Artificial Systems (context) - Holland - 1975
33: Genetic Programming: On the Programming of Computers by Means of Natural Selecti.. (context) - Koza - 1992
29: Analysis of complexity drift in genetic programming
- Rosca - 1997
BibTeX entry: (Update)
P. A. Whigham. A schema theorem for context-free grammars. In 1995 IEEE Conference on Evolutionary Computation, volume 1, pages 178--181, Perth, Australia, 29 November - 1 December 1995. IEEE Press. http://citeseer.ist.psu.edu/whigham95schema.html More
@inproceedings{ whigham95schema,
author = "P. A. Whigham",
title = "A Schema Theorem for Context-Free Grammars",
booktitle = "1995 {IEEE} Conference on Evolutionary Computation",
volume = "1",
month = "29 - 1",
publisher = "IEEE Press",
address = "Perth, Australia",
pages = "178--181",
year = "1995",
url = "citeseer.ist.psu.edu/whigham95schema.html" }
Citations (may not include all citations):
1931
Adaptation in Natural and Artificial Systems (context) - Holland - 1992 ACM
1053
Genetic Programming:on the programming of computers by means.. (context) - Koza - 1992
93
A genetic algorithm tutorial
- Whitley - 1993
36
AddisonWesley Publishing Company (context) - Goldberg, in et al. - 1989
31
The troubling aspects of a building block hypothesis for gen..
- O'Reilly, Oppacher - 1994 DBLP
4
Science Research Assoc (context) - Barrett, Bates et al. - 1986
2
Operations that modify a grammar to direct the search space .. (context) - Whigham - 1995
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.cs.adfa.oz.au/research/CIG/cig_papers.html): More
Grammatically-based Genetic Programming - Whigham (1995)
(Correct)
Search Bias, Language Bias and Genetic Programming - Whigham (1996)
(Correct)
Inductive Bias and Genetic Programming - Whigham (1995)
(Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC