Schema (genetic algorithms): Difference between revisions

Revision as of 15:44, 6 August 2023

Revision as of 22:43, 26 September 2023

Line 1:

{{Evolutionary algorithms}}

A '''schema''' ({{plural form}}: '''schemata''') 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, forming a [[Base (topology)|basis]] for a [[product topology]] on strings.<ref name="Holland1">{{cite book |title=Adaptation in Natural and Artificial Systems|year=1992|edition=reprint|publisher=The MIT Press|author=Holland, John Henry |isbn=9780472084609 |url=https://books.google.com/books?id=JE5RAAAAMAAJ |url-status=live |accessdate=22 April 2014}}</ref> In other words, schemata can be used to generate a [[Topological space|topology]] on a space of strings.

== Description ==