Schema (genetic algorithms): Difference between revisions

Revision as of 20:50, 24 March 2013

Revision as of 14:13, 20 April 2014

Line 1:

{{merge from|Propagation of schema|date=December 2011}}

A '''schema''' is a template in [[computer science]] used in the field of [[genetic algorithm]]s that identifies a [[subset]] of strings with similarities at certain string positions. Schemata are a special case of [[cylinder set]]s; and so form a [[topological space]].<ref name="Holland1">{{cite book|last=Holland|title=Adaptation in Natural and Artificial Systems|year=1992 |edition=reprint|publisher=The MIT Press|author=Holland|accessdate=13 July 2010}}</ref>

== Description ==

Line 9:

===Disruption===

If the child of an individual that matches schema H does not ''itself'' match H, the schema is said to have been ''disrupted''.<ref name="UCL1">< /ref>

==See also==

Line 17:

==References==

{{Reflist}}

[[Category:Genetic algorithms]]

[[Category:Genetic programming]]

{{bioinformatics-stub}}

{{compu-AI-stub}}

{{comp-sci-stub}}

[[Category:Genetic algorithms]]

[[Category:Genetic programming]]