Defining length
In genetic algorithms and genetic programming defining length L(H) is the maximum distance between two defining symbols (that is symbols that have a fixed value as opposed to symbols that can take any value, commonly denoted as # or *) in schema H. In tree GP schemata, L(H) is the number of links in the minimum tree fragment including all the non-= symbols within a schema H.[1]
Example
Schemata "00##0", "1###1", "01###", and "##0##" have defining lengths of 4, 4, 1, and 0, respectively. Lengths are computed by determining the last fixed position and subtracting from it the first fixed position.
In genetic algorithms as the defining length of a solution increases so does the susceptibility of the solution to disruption due to mutation or cross-over.
gollark: Or bugfixes internally.
gollark: What about security updates?
gollark: Someone would still have to go to every workspace and go "update-util" *every time* a dependency updates.
gollark: That's still quite problematic.
gollark: Ale32bit made cget, and that has important packages like potatOS, but it's not very widely adopted and I'm not sure if it handles dependencies well.
References
- "Foundations of Genetic Programming". UCL UK. Retrieved 13 July 2010.
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.