Revision as of 04:21, 21 September 2020 edit Citation bot (talk \| contribs) Bots 5,866,512 edits Alter: url. \| You can use this bot yourself. Report bugs here. \| Suggested by Abductive \| Category:Genetic algorithms \| via #UCB_Category ← Previous edit		Revision as of 20:07, 30 January 2022 edit undo Citation bot (talk \| contribs) Bots 5,866,512 edits Alter: template type. \| Use this bot. Report bugs. \| Suggested by AManWithNoPlan \| #UCB_webform 882/1682 Next edit →
Line 16: == The Expansion and Compression Operators == Recently schema have been studied using [[order theory]].<ref name = "Fletcher"> {{cite ~~arxiv~~arXiv \|author=Jack McKay Fletcher and Thomas Wennkers \|year=2017 \|title=A natural approach to studying schema processing \|eprint=1705.04536\|class=cs.NE }}</ref> Two basic operators are defined for schema: expansion and compression. The expansion maps a schema onto a set of words which it represents, while the compression maps a set of words on to a schema.

Schema (genetic algorithms): Difference between revisions