atlas

Research map / Learning theory and algorithms / Combinatorial and search optimization

On the Time Complexity of Algorithm Selection Hyper-Heuristics for Multimodal Optimisation

AAAI 2019 · Learning theory and algorithms › Combinatorial and search optimization · approach: Heuristic and local search algorithms · 51 citations (OpenAlex)

Read the paperCheck your idea against 108,967 papers

AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Measured effects reported in the paper

What was changedWhereMeasuredEffect
allow occasional all-moves acceptance (p = 1/((1+eps)n)) instead of pure elitism (p = 0)Move Acceptance hyper-heuristic (MAHH-OI) · CLIFF_dexpected runtime: infinite -> O(n log n + n^3/d^2)Helped
use constant p instead of p <= 1/((1+eps)n) (ablation)MAHH-OI · OneMaxexpected runtime: O(n log n) -> 2^Omega(n)Hurt
replace Metropolis with MAHH-OInon-elitist search on hard CLIFF_d · CLIFF_dexpected runtime: O(n^3) worst case vs superpolynomial for MetropolisHelped
replace (1+1) EA with MAHH-OI at cliff length d > 3elitist EA · CLIFF_dexpected runtimeHelped
replace Metropolis with MAHH-OInon-elitist search · JUMP_mexpected runtime: O(n log n + n^(2m-1)/m) vs 2^Omega(n)Helped
replace MAHH-OI with (1+1) EA on JUMP_mMAHH-OI · JUMP_mexpected runtime: Theta(n^m) vs O(n log n + n^(2m-1)/m)Helped

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy