- author = "P. A. Whigham",
- title = "A Schema Theorem for Context-Free Grammars",
- booktitle = "1995 IEEE Conference on Evolutionary Computation",
- year = "1995",
- volume = "1",
- pages = "178--181",
- address = "Perth, Australia",
- publisher_address = "Piscataway, NJ, USA",
- month = "29 " # nov # " - 1 " # dec,
- publisher = "IEEE Press",
- keywords = "genetic algorithms, genetic programming",
-
URL = "
http://divcom.otago.ac.nz/sirc/Peterw/Publications/schema.zip",
-
URL = "http://citeseer.ist.psu.edu/whigham95schema.html",
-
DOI = "
10.1109/ICEC.1995.489140",
- 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.",
-
notes = "ICEC-95 Held December 1995, at University of Western
Australia, Perth, Australia. Editors not given by IEEE,
Organisers David Fogel and Chris deSilva.
conference details at http://ciips.ee.uwa.edu.au/~dorota/icnn95.html",
