Skip to search formSkip to main contentSkip to account menu

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… 
Wikipedia (opens in a new tab)

Related topics

Related topics

4 relations
Crossover (genetic algorithm)Genetic programmingHolland's schema theoremSchema (genetic algorithms)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
A Building-Block Favoring Method for the Topology Optimization of Internal Antenna Design
This paper proposes a new design technique for internal antenna development. The proposed method is based on the framework of… 
Review
2013
Review
2013
Genetic Algorithms in Noisy Environments
Genetic Algorithms (GA) have been widely used in the areas of searching, function optimization, and machine learning. In many of… 
2011
2011
GA optimized FRBS for travel systems
This paper reports further on work presented at MODSIM09 (Ricketts 2009), which itself extended modeling of behavioural rules for… 
2008
2008
BIOLOGICAL PARAMETERS FOR ICEFISH (CHIONOBATHYSCUS DEWITTI) IN THE ROSS SEA, ANTARCTICA
Icefish (Channichthyidae) specimens were randomly collected by observers during the 2005/06 fishing season. These observers were… 
2006
2006
A High Performance Soft Decision Viterbi Decoder for Wlan and Broadband Applications
This paper presents a configurable 3-bit soft decision Viterbi decoder implementation that meets the requirements for WLAN and… 
2005
2005
A New Adaptive Crossover Operator for the Preservation of Useful Schemata
In genetic algorithms, commonly used crossover operators such as one-point, two-point and uniform crossover operator are likely… 
1994
1994
Analyzing Hyperplane Synthesis in Genetic Algorithms Using Clustered Schemata
A new type of schema, c-schema, is introduced, which emphasizes the inner structure, particularly specific-symbol clusters rather… 
Review
1993
Review
1993
Opening of the workshop
It is my great pleasure, ladies and gentlemen, to welcome you to Uppsala University for discussions on the very interesting… 
1992
1992
Schema Analysis of the Traveling Salesman Problem Using Genetic Algorithms
This paper provides a substantial proof th at genet ic algorithms (GAs) work for t he traveling salesman problem (TSP) . The… 
1984
1984
Problems of defining length
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)