Introduction to algorithms
Evolutionary computation: toward a new philosophy of machine intelligence
Evolutionary computation: toward a new philosophy of machine intelligence
Randomized algorithms
Approximation algorithms for NP-hard problems
Approximation algorithms for NP-hard problems
A computational view of population genetics
Random Structures & Algorithms
An overview of parameter control methods by self-adaption in evolutionary algorithms
Fundamenta Informaticae
Genetic Algorithms in Search, Optimization and Machine Learning
Genetic Algorithms in Search, Optimization and Machine Learning
On the analysis of the (1+ 1) evolutionary algorithm
Theoretical Computer Science
On the Optimization of Unimodal Functions with the (1 + 1) Evolutionary Algorithm
PPSN V Proceedings of the 5th International Conference on Parallel Problem Solving from Nature
On the Choice of the Mutation Probability for the (1+1) EA
PPSN VI Proceedings of the 6th International Conference on Parallel Problem Solving from Nature
On the Analysis of Evolutionary Algorithms - A Proof That Crossover Really Can Help
ESA '99 Proceedings of the 7th Annual European Symposium on Algorithms
Rigorous hitting times for binary mutations
Evolutionary Computation
Fitness Landscapes Based on Sorting and Shortest Paths Problems
PPSN VII Proceedings of the 7th International Conference on Parallel Problem Solving from Nature
PPSN VII Proceedings of the 7th International Conference on Parallel Problem Solving from Nature
Evolutionary Algorithms and the Maximum Matching Problem
STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
A new method for modeling the behavior of finite population evolutionary algorithms
Evolutionary Computation
Simple max-min ant systems and the optimization of linear pseudo-boolean functions
Proceedings of the 11th workshop proceedings on Foundations of genetic algorithms
Tight analysis of the (1+1)-ea for the single source shortest path problem
Evolutionary Computation
Revisiting the restricted growth function genetic algorithm for grouping problems
Evolutionary Computation
Rigorous runtime analysis of the (1+1) ES: 1/5-rule and ellipsoidal fitness landscapes
FOGA'05 Proceedings of the 8th international conference on Foundations of Genetic Algorithms
MFCS'07 Proceedings of the 32nd international conference on Mathematical Foundations of Computer Science
Fitness levels with tail bounds for the analysis of randomized search heuristics
Information Processing Letters
| Hi-index | 0.00 |
Randomized search heuristics like simulated annealing and evolutionary algorithms are applied successfully in many different situations. However, the theory on these algorithms is still in its infancy. Here it is discussed how and why such a theory should be developed. Afterwards, some fundamental results on evolutionary algorithms are presented in order to show how theoretical results on randomized search heuristics can be proved and how they contribute to the understanding of evolutionary algorithms.