On the analysis of the (1+ 1) evolutionary algorithm
Theoretical Computer Science
Theoretical Aspects of Evolutionary Algorithms
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
Evolutionary Algorithms and the Maximum Matching Problem
STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
A study of drift analysis for estimating computation time of evolutionary algorithms
Natural Computing: an international journal
On the Optimization of Monotone Polynomials by Simple Randomized Search Heuristics
Combinatorics, Probability and Computing
Minimum spanning trees made easier via multi-objective optimization
GECCO '05 Proceedings of the 7th annual conference on Genetic and evolutionary computation
Adjacency list matchings: an ideal genotype for cycle covers
Proceedings of the 9th annual conference on Genetic and evolutionary computation
A Blend of Markov-Chain and Drift Analysis
Proceedings of the 10th international conference on Parallel Problem Solving from Nature: PPSN X
Computing single source shortest paths using single-objective fitness
Proceedings of the tenth ACM SIGEVO workshop on Foundations of genetic algorithms
Proceedings of the 12th annual conference on Genetic and evolutionary computation
Drift analysis with tail bounds
PPSN'10 Proceedings of the 11th international conference on Parallel problem solving from nature: Part I
Bioinspired Computation in Combinatorial Optimization: Algorithms and Their Computational Complexity
Bioinspired Computation in Combinatorial Optimization: Algorithms and Their Computational Complexity
Theory of Randomized Search Heuristics: Foundations and Recent Developments
Theory of Randomized Search Heuristics: Foundations and Recent Developments
Speeding up evolutionary algorithms through restricted mutation operators
PPSN'06 Proceedings of the 9th international conference on Parallel Problem Solving from Nature
Worst-case and average-case approximations by simple randomized search heuristics
STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science
Hi-index | 0.00 |
An overview of the restricted growth function genetic algorithm is given. Empirically we show that the algorithm exhibits poor performance and is consistently outperformed on a range of problems by two very basic evolutionary algorithms with blind operators.