Optimal parameters for search using a barrier tree Markov model

DOI10.1016/J.TCS.2007.06.005zbMath1137.68522OpenAlexW2053472054MaRDI QIDQ2455598

J. Hallam, Adam Prügel-Bennett, W. Benfold

Publication date: 25 October 2007

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://eprints.soton.ac.uk/271544/1/optsearch.pdf

zbMATH Keywords

barrier treeoptimal annealing scheduleOptimal searchvariable mutation

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Approximation methods and heuristics in mathematical programming (90C59) Reliability, availability, maintenance, inspection in operations research (90B25) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.) (60J20)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Optimization by Simulated Annealing
• When a genetic algorithm outperforms hill-climbing
• Best-so-far vs. where-you-are: Implications for optimal finite-time annealing
• On the analysis of the \((1+1)\) evolutionary algorithm
• Analysis of finite length annealing schedules
• Cooling Schedules for Optimal Annealing
• The optimal simulated annealing schedule for a simple model

This page was built for publication: Optimal parameters for search using a barrier tree Markov model