Schema (genetic algorithms): Difference between revisions

Revision as of 15:24, 6 June 2008

Revision as of 11:27, 25 April 2009

Line 1:

In [[mathematics]], in the field of [[genetic algorithm]]s, a '''schema''', '''schemata''' or [[Holland'''s_schema_theorem|Holland schemata''']] is a template 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]].

== Description ==