Schema (genetic algorithms): Difference between revisions

Revision as of 18:38, 28 February 2017

Revision as of 09:19, 24 May 2017

Line 13:

In [[evolutionary computing]] such as [[genetic algorithms]] and [[genetic programming]], '''propagation''' refers to the inheritance of characteristics of one generation by the next. For example, a schema is propagated if individuals in the current generation match it and so do those in the next generation. Those in the next generation may be (but don't have to be) children of parents who matched it.

== The Schematic Completion ==

In <ref name = "Fletcher">

{{cite journal |author=Jack Flethcher| year=2017 |month=May|title=A natural approach to studying schema processing |journal=arXiv preprint arXiv:1705.04536|url=https://arxiv.org/pdf/1705.04536.pdf}} schema are study using [[Order Theory]] and [[Lattice Theory]]

}

==See also==

*[[Holland's schema theorem]]