scientific article; zbMATH DE number 1754585
From MaRDI portal
Publication:4535010
zbMath0986.68137MaRDI QIDQ4535010
Publication date: 12 June 2002
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2076/20760064
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (24)
Tail bounds on hitting times of randomized search heuristics using variable drift analysis ⋮ Algorithmic analysis of a basic evolutionary algorithm for continuous optimization ⋮ A tight runtime analysis for the \((\mu + \lambda)\) EA ⋮ Concentrated Hitting Times of Randomized Search Heuristics with Variable Drift ⋮ Analyzing randomized search heuristics via stochastic domination ⋮ Evolutionary algorithms and submodular functions: benefits of heavy-tailed mutations ⋮ First Steps Towards a Runtime Analysis of Neuroevolution ⋮ 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 ⋮ Island models meet rumor spreading ⋮ Multiplicative up-drift ⋮ Self-adjusting mutation rates with provably optimal success rules ⋮ Improved runtime results for simple randomised search heuristics on linear functions with a uniform constraint ⋮ Optimal static and self-adjusting parameter choices for the \((1+(\lambda ,\lambda ))\) genetic algorithm ⋮ Analysis of a multiobjective evolutionary algorithm on the 0-1 knapsack problem ⋮ How the (1+1) ES using isotropic mutations minimizes positive definite quadratic forms ⋮ Stagnation detection meets fast mutation ⋮ Using Merging Variables-Based Local Search to Solve Special Variants of MaxSAT Problem ⋮ Stagnation detection meets fast mutation ⋮ On the Evolution of Monotone Conjunctions: Drilling for Best Approximations ⋮ How to analyse evolutionary algorithms. ⋮ Fitness levels with tail bounds for the analysis of randomized search heuristics ⋮ On some variants of the merging variables based \((1+1)\)-evolutionary algorithm with application to MaxSAT problem
This page was built for publication:
