scientific article; zbMATH DE number 1754585
From MaRDI portal
Publication:4535010
zbMATH Open0986.68137MaRDI QIDQ4535010FDOQ4535010
Authors: Ingo Wegener 
Publication date: 12 June 2002
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2076/20760064
Title of this publication is not available (Why is that?)
Recommendations
Cited In (38)
- Title not available (Why is that?)
- A tight runtime analysis for the \((\mu + \lambda)\) EA
- Island models meet rumor spreading
- Optimal static and self-adjusting parameter choices for the \((1+(\lambda ,\lambda ))\) genetic algorithm
- On the Evolution of Monotone Conjunctions: Drilling for Best Approximations
- A comparison of simulated annealing with a simple evolutionary algorithm on pseudo-Boolean functions of unitation
- Logic versus Approximation
- On some variants of the merging variables based \((1+1)\)-evolutionary algorithm with application to MaxSAT problem
- Mathematical Foundations of Computer Science 2003
- Dynamic parameter control in simple evolutionary algorithms
- Fourier analysis meets runtime analysis: precise runtimes on plateaus
- Improved runtime results for simple randomised search heuristics on linear functions with a uniform constraint
- Self-adjusting mutation rates with provably optimal success rules
- Title not available (Why is that?)
- Multiplicative up-drift
- Lower bounds from fitness levels made easy
- An extended jump functions benchmark for the analysis of randomized search heuristics
- Runtime analysis for permutation-based evolutionary algorithms
- Tail bounds on hitting times of randomized search heuristics using variable drift analysis
- Analysis of a multiobjective evolutionary algorithm on the 0-1 knapsack problem
- On benefits and drawbacks of aging strategies for randomized search heuristics
- How to analyse evolutionary algorithms.
- Algorithmic analysis of a basic evolutionary algorithm for continuous optimization
- Evolutionary algorithms and submodular functions: benefits of heavy-tailed mutations
- Using Merging Variables-Based Local Search to Solve Special Variants of MaxSAT Problem
- Foundations of Genetic Algorithms
- Analyzing randomized search heuristics via stochastic domination
- How the (1+1) ES using isotropic mutations minimizes positive definite quadratic forms
- Title not available (Why is that?)
- Title not available (Why is that?)
- Fitness levels with tail bounds for the analysis of randomized search heuristics
- Relational Methods in Computer Science
- Stagnation detection meets fast mutation
- Stagnation detection meets fast mutation
- First Steps Towards a Runtime Analysis of Neuroevolution
- Two aspects of evolutionary algorithms
- Concentrated Hitting Times of Randomized Search Heuristics with Variable Drift
- Title not available (Why is that?)
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)
