Crossover can provably be useful in evolutionary computation
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3497315 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1263184 (Why is no real title available?)
- scientific article; zbMATH DE number 1368469 (Why is no real title available?)
- scientific article; zbMATH DE number 1405791 (Why is no real title available?)
- A Theorem on Boolean Matrices
- Automata, Languages and Programming
- Efficient Algorithms for Shortest Paths in Sparse Networks
- Equation of state calculations by fast computing machines
- Introduction to algorithms
- Optimization by simulated annealing
- Real royal road functions -- where crossover provably is essential
- Real royal road functions for constant population size
- Techniques for bounding the convergence rate of genetic algorithms
- The analysis of evolutionary algorithms -- A proof that crossover really can help
- The analysis of evolutionary algorithms on sorting and shortest paths problems
- The probabilistic method. With an appendix on the life and work of Paul Erdős.
Cited in
(27)- A tight runtime analysis for the \((\mu + \lambda)\) EA
- Optimal static and self-adjusting parameter choices for the (1+( , )) genetic algorithm
- Memetic algorithms outperform evolutionary algorithms in multimodal optimisation
- Fixed-parameter evolutionary algorithms and the vertex cover problem
- Crossover can guarantee exponential speed-ups in evolutionary multi-objective optimisation
- scientific article; zbMATH DE number 1962037 (Why is no real title available?)
- scientific article; zbMATH DE number 1405791 (Why is no real title available?)
- Crossover can be constructive when computing unique input-output sequences
- A generic construction for crossovers of graph-like structures and its realization in the Eclipse Modeling Framework
- A Generic Construction for Crossovers of Graph-Like Structures
- A crossover operator that uses Pareto optimality in its definition
- Lower bounds on the runtime of crossover-based algorithms via decoupling and family graphs
- Fourier analysis meets runtime analysis: precise runtimes on plateaus
- More effective crossover operators for the all-pairs shortest path problem
- Global versus local search: the impact of population sizes on evolutionary algorithm performance
- A rigorous runtime analysis of the \((1 + (\lambda, \lambda))\) GA on jump functions
- Tight bounds on the expected runtime of a standard steady state genetic algorithm
- On the benefits of populations for the exploitation speed of standard steady-state genetic algorithms
- (1+1) genetic programming with functionally complete instruction sets can evolve Boolean conjunctions and disjunctions with arbitrarily small error
- Real royal road functions -- where crossover provably is essential
- The analysis of evolutionary algorithms -- A proof that crossover really can help
- An extended jump functions benchmark for the analysis of randomized search heuristics
- Fixed-parameter tractability of crossover: steady-state GAs on the closest string problem
- scientific article; zbMATH DE number 2243393 (Why is no real title available?)
- Evolutionary algorithms and matroid optimization problems
- A simple ant colony optimizer for stochastic shortest path problems
- Reducing the arity in unbiased black-box complexity
This page was built for publication: Crossover can provably be useful in evolutionary computation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q418021)
