On the Black-Box Complexity of Example Functions

DOI10.1145/2725494.2725507zbMath1361.68200OpenAlexW1981317573MaRDI QIDQ2981879

Thomas Jansen

Publication date: 10 May 2017

Published in: Proceedings of the 2015 ACM Conference on Foundations of Genetic Algorithms XIII (Search for Journal in Brave)

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

zbMATH Keywords

runtime analysisjump functionblack-box complexity\((1+1)\) EA

Mathematics Subject Classification ID

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

Related Items (5)

Black-box complexity: advantages of memory usage ⋮ A rigorous runtime analysis of the \((1 + (\lambda, \lambda))\) GA on jump functions ⋮ An extended jump functions benchmark for the analysis of randomized search heuristics ⋮ How majority-vote crossover and estimation-of-distribution algorithms cope with fitness valleys ⋮ Unnamed Item

Cites Work

• Approximating fixation probabilities in the generalized Moran process
• On the fixation probability of superstars
• Unnamed Item
• Unnamed Item

This page was built for publication: On the Black-Box Complexity of Example Functions