Tight Bounds for Blind Search on the Integers and the Reals

DOI10.1017/S0963548309990599zbMath1261.68069MaRDI QIDQ4911109

Ingo Wegener, Philipp Woelfel, Martin Dietzfelbinger, Jonathan E. Rowe

Publication date: 13 March 2013

Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)

zbMATH Keywords

random processexpectationtight boundsblind search on integersblind search on reals

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Searching and sorting (68P10) Graph theory (including graph drawing) in computer science (68R10) Random walks on graphs (05C81) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)

Related Items (5)

Runtime analysis of RLS and \((1 + 1)\) EA for the dynamic weighted vertex cover problem ⋮ Design and analysis of different alternating variable searches for search-based software testing ⋮ The \((1+\lambda)\) evolutionary algorithm with self-adjusting mutation rate ⋮ Solving problems with unknown solution length at almost no extra cost ⋮ Static and self-adjusting mutation strengths for multi-valued decision variables

Cites Work

• Algorithmic analysis of a basic evolutionary algorithm for continuous optimization
• Upper and lower bounds for randomized search heuristics in black-box optimization

This page was built for publication: Tight Bounds for Blind Search on the Integers and the Reals