Foundations of Genetic Algorithms
From MaRDI portal
Publication:5703884
DOI10.1007/b138412zbMath1078.68682OpenAlexW4300662698MaRDI QIDQ5703884
Publication date: 11 November 2005
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b138412
Learning and adaptive systems in artificial intelligence (68T05) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Related Items (8)
Principled Design of Continuous Stochastic Search: From Theory to Practice ⋮ Quality gain analysis of the weighted recombination evolution strategy on general convex quadratic functions ⋮ On invariance and linear convergence of evolution strategies with augmented Lagrangian constraint handling ⋮ 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 ⋮ Log-linear convergence and divergence of the scale-invariant \((1+1)\)-ES in noisy environments ⋮ Performance analysis of the simultaneous perturbation stochastic approximation algorithm on the noisy sphere model ⋮ Evolution strategies with cumulative step length adaptation on the noisy parabolic ridge
This page was built for publication: Foundations of Genetic Algorithms
