Precision, local search and unimodal functions

DOI10.1007/S00453-009-9352-XzbMath1211.68520OpenAlexW2016222250MaRDI QIDQ633830

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

Publication date: 30 March 2011

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.216.5028

zbMATH Keywords

computational complexitylocal searchprecisionmultimodal functionsunimodal functions

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Combinatorics in computer science (68R05) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (3)

Design and analysis of different alternating variable searches for search-based software testing ⋮ First Steps Towards a Runtime Analysis of Neuroevolution ⋮ Precision, local search and unimodal functions

Cites Work

• Precision, local search and unimodal functions
• Algorithmic analysis of a basic evolutionary algorithm for continuous optimization
• A Fibonacci Version of Kraft’s Inequality Applied to Discrete Unimodal Search
• Complexity Theory
• Oblivious Randomized Direct Search for Real-Parameter Optimization
• Generalized Kraft’s Inequality and Discrete k-Modal Search
• Tight bounds for blind search on the integers
• Foundations of Genetic Algorithms
• Sequential Minimax Search for a Maximum

This page was built for publication: Precision, local search and unimodal functions