Heuristics as Markov chains
From MaRDI portal
Publication:2350029
DOI10.1007/s10472-014-9439-1zbMath1329.68239MaRDI QIDQ2350029
Publication date: 18 June 2015
Published in: Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10472-014-9439-1
68T20: Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Inconsistent heuristics in theory and practice
- Depth-first iterative-deepening: An optimal admissible tree search
- Graph puzzles, homotopy, and the alternating group
- \(\text{BIDA}^*\): An improved perimeter search algorithm
- Predicting optimal solution cost with conditional probabilities
- Duality in permutation state spaces and the dual search algorithm
- Maximizing over multiple pattern databases speeds up heuristic search
- Predicting the Performance of IDA* using Conditional Distributions
- Time complexity of iterative-deepening-\(A^{*}\)
- Disjoint pattern database heuristics