The impact of lexicographic parsimony pressure for ORDER/MAJORITY on the run time
From MaRDI portal
Publication:2306019
DOI10.1016/j.tcs.2020.01.011zbMath1432.68622OpenAlexW2999855815WikidataQ126348304 ScholiaQ126348304MaRDI QIDQ2306019
Johannes Lengler, Benjamin Doerr, J. A. Gregor Lagodzinski, Timo Kötzing
Publication date: 20 March 2020
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2020.01.011
Analysis of algorithms (68W40) Evolutionary algorithms, genetic algorithms (computational aspects) (68W50) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (2)
(1+1) genetic programming with functionally complete instruction sets can evolve Boolean conjunctions and disjunctions with arbitrarily small error ⋮ Lower bounds from fitness levels made easy
Cites Work
- Unnamed Item
- Unnamed Item
- Concentration of first hitting times under additive drift
- A study of drift analysis for estimating computation time of evolutionary algorithms
- Adaptive drift analysis
- Destructiveness of lexicographic parsimony pressure and alleviation by a concatenation crossover in genetic programming
- Drift Analysis and Evolutionary Algorithms Revisited
- Tight Bounds on the Optimization Time of a Randomized Search Heuristic on Linear Functions
- On the Time and Space Complexity of Genetic Programming for Evolving Boolean Conjunctions
- Computational complexity analysis of simple genetic programming on two problems modeling isolated program semantics
- Runtime analysis of mutation-based geometric semantic genetic programming on boolean functions
- Single- and multi-objective genetic programming
- Probability and Computing
- Concentration of Measure for the Analysis of Randomized Algorithms
This page was built for publication: The impact of lexicographic parsimony pressure for ORDER/MAJORITY on the run time