Black-box search by elimination of fitness functions

DOI10.1145/1527125.1527135zbMath1369.68291OpenAlexW1976376425MaRDI QIDQ5276065

R. Paul Wiegand, Gautham Anil

Publication date: 14 July 2017

Published in: Proceedings of the tenth ACM SIGEVO workshop on Foundations of genetic algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1527125.1527135

zbMATH Keywords

evolutionary algorithmsblack-box optimizationelimination of functions

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Approximation methods and heuristics in mathematical programming (90C59) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (13)

\textsc{OneMax} in black-box models with several restrictions ⋮ Choosing the right algorithm with hints from complexity theory ⋮ Black-box search by unbiased variation ⋮ The voting algorithm is robust to various noise models ⋮ A framework for co-optimization algorithm performance and its application to worst-case optimization ⋮ From black-box complexity to designing new genetic algorithms ⋮ Towards a Complexity Theory of Randomized Search Heuristics: Ranking-Based Black-Box Complexity ⋮ The runtime of the compact genetic algorithm on jump functions ⋮ Optimal static and self-adjusting parameter choices for the \((1+(\lambda ,\lambda ))\) genetic algorithm ⋮ Reducing the arity in unbiased black-box complexity ⋮ Ranking-based black-box complexity ⋮ Playing mastermind with constant-size memory ⋮ Unbiasedness of estimation-of-distribution algorithms

This page was built for publication: Black-box search by elimination of fitness functions