Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 225,840,338 papers from all fields of science
Search
Sign In
Create Free Account
Holland's schema theorem
Known as:
Fundamental theorem of genetic algorithms
, Schema theorem
Holland's schema theorem, also called the fundamental theorem of genetic algorithms, is widely taken to be the foundation for explanations of the…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
6 relations
Defining length
Genetic algorithm
Genetic operator
Learning classifier system
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2008
2008
A Jumping Genes Paradigm: Theory, Verification and Applications
W. S. Tang
,
S. Kwong
,
K. Man
IEEE Circuits and Systems Magazine
2008
Corpus ID: 21114661
A new evolutionary computing algorithm on the basis of "jumping genes" phenomenon is presented in this article. It emulates the…
Expand
2003
2003
EC Theory: A Unified Viewpoint
C. Stephens
,
A. Zamora
Annual Conference on Genetic and Evolutionary…
2003
Corpus ID: 11432399
In this paper we show how recent theoretical developments have led to a more unified framework for understanding different…
Expand
2002
2002
Schema theorem of real-coded nonlinear genetic algorithm
Z. Cui
,
J. Zeng
Proceedings. International Conference on Machine…
2002
Corpus ID: 14303511
Through the mechanism analysis of simple genetic algorithm (SGA), every genetic operator can be considered as a linear function…
Expand
Review
2000
Review
2000
The simple genetic algorithm-foundations and theory [Book Reviews]
H. Beyer
IEEE Transactions on Evolutionary Computation
2000
Corpus ID: 33520433
Evolutionary algorithms 1 (EA’s) have been successfully applied to thousands of problems in almost all branches of engineering…
Expand
1999
1999
Parallel genetic algorithm fitness function team for eigenstructure assignment via LQR designs
J. V. F. Neto
,
C. Bottura
Proceedings of the Congress on Evolutionary…
1999
Corpus ID: 62480240
The article discusses the development of a strategy based on a fitness function team exploration for a parallel genetic algorithm…
Expand
1999
1999
Applying Genetic Algorithms to Real-World Problems
E. Falkenauer
1999
Corpus ID: 14635035
This paper outlines what the author perceives as crucial ingredients of a successful application of Genetic Algorithms (GAs) to…
Expand
1997
1997
Phenotypical Building Blocks for Genetic Programming
Thomas D. Haynes
International Conference on Genetic Algorithms
1997
Corpus ID: 3066306
The theoretical foundations of genetic algorithms (GA) rest on the shoulders of the Schema Theorem, which states that the…
Expand
Review
1997
Review
1997
A Review of Theoretical and Experimental Results on Schemata in Genetic Programming
R. Poli
,
W. Langdon
European Conference on Genetic Programming
1997
Corpus ID: 14528217
Schemata and the schema theorem, although criticised, are often used to explain why genetic algorithms (GAs) work. A considerable…
Expand
1995
1995
Convergence of Algorithm and the Schema Theorem in Genetic Algorithms
Yoshinori Uesaka
International Conference on Adaptive and Natural…
1995
Corpus ID: 122418989
In this article two aspects of GA are commented from a mathematical point of view. One is concerned with the convergence of GA…
Expand
1994
1994
Analyzing Hyperplane Synthesis in Genetic Algorithms Using Clustered Schemata
T. N. Bui
,
B. Moon
Parallel Problem Solving from Nature
1994
Corpus ID: 44179385
A new type of schema, c-schema, is introduced, which emphasizes the inner structure, particularly specific-symbol clusters rather…
Expand
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)
ACCEPT & CONTINUE