Defining length

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.

References


Wikimedia Foundation. 2010.

Игры ⚽ Поможем написать курсовую

Look at other dictionaries:

  • Defining equation (physics) — For common nomenclature of base quantities used in this article, see Physical quantity. For 4 vector modifications used in relativity, see Four vector. Very often defining equations are in the form of a constitutive equation, since parameters of… …   Wikipedia

  • Foot (length) — unit of length name= foot m= 0.3048 accuracy=4 A foot (plural: feet or foot; [ [http://www.bbc.co.uk/worldservice/learningenglish/grammar/learnit/learnitv312.shtml BBC World Service] ] symbol or abbreviation: ft or, sometimes, prime; – the prime… …   Wikipedia

  • Minimum message length — (MML) is a formal information theory restatement of Occam s Razor: even when models are not equal in goodness of fit accuracy to the observed data, the one generating the shortest overall message is more likely to be correct (where the message… …   Wikipedia

  • Hand (length) — A hand (or handbreadth) is a unit of length measurement, originally based on the breadth of a male human hand and now standardized at 4 inches (about 10 cm). When used to measure height, it is abbreviated h (for hands ) or hh ( hands high ). [… …   Wikipedia

  • Pendulum — This article is about pendulums. For other uses, see Pendulum (disambiguation). Simple gravity pendulum model assumes no friction or air resistance …   Wikipedia

  • Holland's schema theorem — is widely taken to be the foundation for explanations of the power of genetic algorithms.A schema is a template that identifies a subset of strings with similarities at certain string positions. Schemata are a special case of cylinder sets; and… …   Wikipedia

  • Schema (genetic algorithms) — A schema is a template in computer science used in the field of genetic algorithms that identifies a subset of strings with similarities at certain string positions. Schemata are a special case of cylinder sets; and so form a topological… …   Wikipedia

  • Genetic algorithm — A genetic algorithm (GA) is a search heuristic that mimics the process of natural evolution. This heuristic is routinely used to generate useful solutions to optimization and search problems. Genetic algorithms belong to the larger class of… …   Wikipedia

  • Non-measurable set — This page gives a general overview of the concept of non measurable sets. For a precise definition of measure, see Measure (mathematics). For various constructions of non measurable sets, see Vitali set, Hausdorff paradox, and Banach–Tarski… …   Wikipedia

  • Small cancellation theory — In the mathematical subject of group theory, small cancellation theory studies groups given by group presentations satisfying small cancellation conditions, that is where defining relations have small overlaps with each other. It turns out that… …   Wikipedia

Share the article and excerpts

Direct link
Do a right-click on the link above
and select “Copy Link”