Switching between two evolutionary algorithms on OneMax yields O(n log log n) runtime, asymptotically faster than the Θ(n sqrt(log n log log log n / log log n)) bound of the best single algorithm.
Oliveto, and Feiyang Zheng
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.NE 1years
2026 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
When Switching Algorithms Helps: A Theoretical Study of Online Algorithm Selection
Switching between two evolutionary algorithms on OneMax yields O(n log log n) runtime, asymptotically faster than the Θ(n sqrt(log n log log log n / log log n)) bound of the best single algorithm.