scientific article; zbMATH DE number 1754585
From MaRDI portal
Publication:4535010
Recommendations
Cited in
(41)- Algorithmic analysis of a basic evolutionary algorithm for continuous optimization
- scientific article; zbMATH DE number 1998333 (Why is no real title available?)
- On benefits and drawbacks of aging strategies for randomized search heuristics
- Lower bounds from fitness levels made easy
- Logic versus Approximation
- An extended jump functions benchmark for the analysis of randomized search heuristics
- Runtime analysis for permutation-based evolutionary algorithms
- scientific article; zbMATH DE number 976350 (Why is no real title available?)
- On some variants of the merging variables based \((1+1)\)-evolutionary algorithm with application to MaxSAT problem
- How to analyse evolutionary algorithms.
- Analyzing randomized search heuristics: tools from probability theory
- Evolutionary algorithms and submodular functions: benefits of heavy-tailed mutations
- Theory of evolutionary computation. Recent developments in discrete optimization
- Island models meet rumor spreading
- Two aspects of evolutionary algorithms
- Analysis of a multiobjective evolutionary algorithm on the 0-1 knapsack problem
- Mathematical Foundations of Computer Science 2003
- On the evolution of monotone conjunctions: drilling for best approximations
- Dynamic parameter control in simple evolutionary algorithms
- scientific article; zbMATH DE number 1203335 (Why is no real title available?)
- Relational Methods in Computer Science
- Optimal static and self-adjusting parameter choices for the \((1+(\lambda ,\lambda ))\) genetic algorithm
- scientific article; zbMATH DE number 1754532 (Why is no real title available?)
- Improved runtime results for simple randomised search heuristics on linear functions with a uniform constraint
- Self-adjusting mutation rates with provably optimal success rules
- Tail bounds on hitting times of randomized search heuristics using variable drift analysis
- Using merging variables-based local search to solve special variants of MaxSAT problem
- A tight runtime analysis for the \((\mu + \lambda)\) EA
- Concentrated hitting times of randomized search heuristics with variable drift
- Stagnation detection meets fast mutation
- Stagnation detection meets fast mutation
- Do evolutionary algorithms indeed require random numbers? Extended study
- Derivation of TIS for search performance quantification on HC method
- First Steps Towards a Runtime Analysis of Neuroevolution
- scientific article; zbMATH DE number 2065676 (Why is no real title available?)
- Multiplicative up-drift
- A comparison of simulated annealing with a simple evolutionary algorithm on pseudo-Boolean functions of unitation
- Foundations of Genetic Algorithms
- Fourier analysis meets runtime analysis: precise runtimes on plateaus
- How the (1+1) ES using isotropic mutations minimizes positive definite quadratic forms
- Fitness levels with tail bounds for the analysis of randomized search heuristics
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4535010)
