Journal of Computer and System Sciences - 26th IEEE Conference on Foundations of Computer Science, October 21-23, 1985
From linear separability to unimodality: a hierarchy of pseudo-Boolean functions
SIAM Journal on Discrete Mathematics
Recognition problems for special classes of polynomials in 0-1 variables
Mathematical Programming: Series A and B
Adaptive algorithms and stochastic approximations
Adaptive algorithms and stochastic approximations
Toward an extrapolation of the simulated annealing convergence theory onto the simple genetic algorithm144438
Information Processing Letters
Randomized algorithms
Parallel recombinative simulated annealing: a genetic algorithm
Parallel Computing
Theory of evolutionary algorithms: a bird's eye view
Theoretical Computer Science - Special issue on evolutionary computation
Genetic algorithms: bridging the convergence gap
Theoretical Computer Science - Special issue on evolutionary computation
On the convergence rates of genetic algorithms
Theoretical Computer Science - Special issue on evolutionary computation
Statistical dynamics of the Royal Road genetic algorithm
Theoretical Computer Science - Special issue on evolutionary computation
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Binomially Distributed Populations for Modelling GAs
Proceedings of the 5th International Conference on Genetic Algorithms
Global Convergence of Genetic Algorithms: A Markov Chain Analysis
PPSN I Proceedings of the 1st Workshop on Parallel Problem Solving from Nature
PPSN III Proceedings of the International Conference on Evolutionary Computation. The Third Conference on Parallel Problem Solving from Nature: Parallel Problem Solving from Nature
Analytical and Numerical Investigations of Evolutionary Algorithms in Continuous Spaces
PPSN IV Proceedings of the 4th International Conference on Parallel Problem Solving from Nature
Genetic Algorithms: Minimal Conditions for Convergence
AE '97 Selected Papers from the Third European Conference on Artificial Evolution
AE '97 Selected Papers from the Third European Conference on Artificial Evolution
Genetic Fitness Optimization Using Rapidly Mixing Markov Chains
ALT '96 Proceedings of the 7th International Workshop on Algorithmic Learning Theory
Evolutionary Search for Minimal Elements in Partially Ordered Finite Sets
EP '98 Proceedings of the 7th International Conference on Evolutionary Programming VII
An overview of evolutionary algorithms for parameter optimization
Evolutionary Computation
Predictive models for the breeder genetic algorithm i. continuous parameter optimization
Evolutionary Computation
Toward a theory of evolution strategies: Some asymptotical results from the (1,+ λ)-theory
Evolutionary Computation
A markov chain framework for the simple genetic algorithm
Evolutionary Computation
The science of breeding and its application to the breeder genetic algorithm (bga)
Evolutionary Computation
Simple genetic algorithms with linear fitness
Evolutionary Computation
Toward a theory of evolution strategies: The (μ, λ)-theory
Evolutionary Computation
Genetic algorithms as global random search methods: An alternative perspective
Evolutionary Computation
Toward a theory of evolution strategies: On the benefits of sex---the (μ/μ, λ) theory
Evolutionary Computation
Finiteness of the fixed point set for the simple genetic algorithm
Evolutionary Computation
Toward a theory of evolution strategies: Self-adaptation
Evolutionary Computation
Analyzing the (1, λ) evolution strategy via stochastic approximation methods
Evolutionary Computation
How mutation and selection solve long-path problems in polynomial expected time
Evolutionary Computation
Local convergence rates of simple evolutionary algorithms withCauchy mutations
IEEE Transactions on Evolutionary Computation
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
Convergence analysis of canonical genetic algorithms
IEEE Transactions on Neural Networks
Runtime analysis of evolutionary algorithms: basic introduction
Proceedings of the 15th annual conference companion on Genetic and evolutionary computation
Runtime analysis of the (1+1) EA on computing unique input output sequences
Information Sciences: an International Journal
| Hi-index | 0.00 |
The theory of evolutionary computation has been enhanced rapidly during the last decade. This survey is the attempt to summarize the results regarding the limit and finite time behavior of evolutionary algorithms with finite search spaces and discrete time scale. Results on evolutionary algorithms beyond finite space and discrete time are also presented but with reduced elaboration.