Heuristic Hill-Climbing as a Markov Process

DOI10.1007/978-3-540-85776-1_23zbMath1169.68607MaRDI QIDQ3534666

Carlos Linares López

Publication date: 4 November 2008

Published in: Artificial Intelligence: Methodology, Systems, and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-85776-1_23

Mathematics Subject Classification ID

90C59: Approximation methods and heuristics in mathematical programming

60J10: Markov chains (discrete-time Markov processes on discrete state spaces)

68T20: Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.)

Cites Work

• Planning as heuristic search
• Time complexity of iterative-deepening-\(A^{*}\)
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item