Genetic programming II: automatic discovery of reusable programs
Genetic programming II: automatic discovery of reusable programs
Randomized algorithms
Finite Markov chain results in evolutionary computation: a tour d'horizon
Fundamenta Informaticae
The theory of evolution strategies
The theory of evolution strategies
The Simple Genetic Algorithm: Foundations and Theory
The Simple Genetic Algorithm: Foundations and Theory
Genetic Algorithms in Search, Optimization and Machine Learning
Genetic Algorithms in Search, Optimization and Machine Learning
Modeling and Analysis of Genetic Algorithm with Tournament Selection
AE '99 Selected Papers from the 4th European Conference on Artificial Evolution
Genetic Algorithms: Principles and Perspectives: A Guide to GA Theory
Genetic Algorithms: Principles and Perspectives: A Guide to GA Theory
Experimental comparison of two evolutionary algorithms for the independent set problem
EvoWorkshops'03 Proceedings of the 2003 international conference on Applications of evolutionary computing
Comparing evolutionary algorithms to the (1+1) -EA
Theoretical Computer Science
Local search of orthogonal packings using the lower bounds
Automation and Remote Control
| Hi-index | 0.00 |
A simple evolutionary algorithm is theoretically compared with other methods of this class for a situation in which the operator of transition to new solutions satisfies the so-called monotonicity condition. This algorithm under the monotonicity condition is optimal in the class of evolutionary algorithms.