scientific article; zbMATH DE number 2038775

zbMath1039.68586MaRDI QIDQ4449242

Jens Jägersküpper

Publication date: 8 February 2004

Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2719/27191068.htm

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

Evolutionary AlgorithmsBlack-Box OptimizationContinuous Search SpaceExpected RuntimeMutation Adaptation

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (8)

Algorithmic analysis of a basic evolutionary algorithm for continuous optimization ⋮ Global Linear Convergence of Evolution Strategies on More than Smooth Strongly Convex Functions ⋮ Global linear convergence of evolution strategies with recombination on scaling-invariant functions ⋮ Lower bounds for comparison based evolution strategies using VC-dimension and sign patterns ⋮ Oblivious Randomized Direct Search for Real-Parameter Optimization ⋮ 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 ⋮ Population size versus runtime of a simple evolutionary algorithm

This page was built for publication: