My watch list
my.bionity.com  

my.bionity.com

With an accout for my.bionity.com you can always see everything at a glance – and you can configure your own website and individual newsletter.

  • My watch list
  • My saved searches
  • My saved topics
  • My newsletter
Register free of charge
Login  
eng  
DeutschEnglishFrançaisEspañol

Defining length



 The introduction to this article provides insufficient context for those unfamiliar with the subject.
Please help improve the article with a good introductory style.

In genetic algorithms and genetic programming defining length L(H) is the maximum distance between two defining (i.e. non-#) symbols 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.

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.

References

  • Foundations of Genetic Programming.
 
This article is licensed under the GNU Free Documentation License. It uses material from the Wikipedia article "Defining_length". A list of authors is available in Wikipedia.
Your browser is not current. Microsoft Internet Explorer 6.0 does not support some functions on Chemie.DE