Fixed-parameter tractability of crossover: steady-state GAs on the closest string problem
From MaRDI portal
Publication:2661998
Recommendations
- Fixed-parameter algorithms for CLOSEST STRING and related problems
- Randomized fixed-parameter algorithms for the closest string problem
- A three-string approach to the closest string problem
- A three-string approach to the closest string problem
- Designing and Implementing Algorithms for the Closest String Problem
Cites work
- scientific article; zbMATH DE number 1507224 (Why is no real title available?)
- A closer look at the closest string and closest substring problem
- A method for obtaining randomized algorithms with small tail probabilities
- Analyzing randomized search heuristics: tools from probability theory
- Computational Complexity
- Concentration of first hitting times under additive drift
- Crossover can be constructive when computing unique input-output sequences
- Crossover can provably be useful in evolutionary computation
- Destructiveness of lexicographic parsimony pressure and alleviation by a concatenation crossover in genetic programming
- Distinguishing string selection problems.
- Efficient Algorithms for the Closest String and Distinguishing String Selection Problems
- Faster black-box algorithms through higher arity operators
- Fixed-parameter algorithms for CLOSEST STRING and related problems
- Fixed-parameter evolutionary algorithms and the vertex cover problem
- From black-box complexity to designing new genetic algorithms
- Fundamentals of Error-Correcting Codes
- Hadamard matrices and their applications
- More effective crossover operators for the all-pairs shortest path problem
- More efficient algorithms for closest string and substring problems
- On covering problems of codes
- On the benefits of populations for the exploitation speed of standard steady-state genetic algorithms
- Optimal speedup of Las Vegas algorithms
- Parameterized algorithms
- Parametrized complexity theory.
- The analysis of evolutionary algorithms -- A proof that crossover really can help
Cited in
(4)- Crossover can guarantee exponential speed-ups in evolutionary multi-objective optimisation
- Tight bounds on the expected runtime of a standard steady state genetic algorithm
- (1+1) genetic programming with functionally complete instruction sets can evolve Boolean conjunctions and disjunctions with arbitrarily small error
- Focused jump-and-repair constraint handling for fixed-parameter tractable graph problems closed under induced subgraphs
This page was built for publication: Fixed-parameter tractability of crossover: steady-state GAs on the closest string problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2661998)
