The cost of randomness in evolutionary algorithms: crossover can save random bits
From MaRDI portal
Cites work
- Analysis of evolutionary algorithms: from computational complexity analysis to algorithm engineering
- Analysis of noisy evolutionary optimization when sampling fails
- Analysis of speedups in parallel evolutionary algorithms for combinatorial optimization (extended abstract)
- Analyzing different variants of immune inspired somatic contiguous hypermutations
- Analyzing evolutionary algorithms. The computer science perspective.
- Automatic adaptation of hypermutation rates for multimodal optimisation
- Bioinspired computation in combinatorial optimization. Algorithms and their computational complexity
- Exact and efficient generation of geometric random variates and random graphs
- From black-box complexity to designing new genetic algorithms
- scientific article; zbMATH DE number 3349081 (Why is no real title available?)
- Introduction to evolutionary computing
- Memetic algorithms outperform evolutionary algorithms in multimodal optimisation
- Mersenne twister
- On the benefits of populations for the exploitation speed of standard steady-state genetic algorithms
- Robustness of populations in stochastic environments
- The \((1+\lambda)\) evolutionary algorithm with self-adjusting mutation rate
- The Benefit of Recombination in Noisy Evolutionary Search
- Theory of evolutionary computation. Recent developments in discrete optimization
- Tight bounds on the expected runtime of a standard steady state genetic algorithm
This page was built for publication: The cost of randomness in evolutionary algorithms: crossover can save random bits
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6149101)
