Performance of linear-space search algorithms

DOI10.1016/0004-3702(94)00047-6OpenAlexW2147872071MaRDI QIDQ5925571

Richard E. Korf, Weixiong Zhang

Publication date: 21 September 2022

Published in: Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0004-3702(94)00047-6

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Combinatorial optimization (90C27) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A note on two problems in connexion with graphs
• Linear-space best-first search
• Depth-first iterative-deepening: An optimal admissible tree search
• Probabilistic analysis of the complexity of A*
• Reducing reexpansions in iterative-deepening search by controlling cutoff bounds
• Postulates for subadditive processes
• The first birth problem for an age-dependent branching process
• Heuristic search in restricted memory
• An upper bound on the time complexity of iterative-deepening-\(A^*\)
• Searching for an optimal path in a tree with random costs
• Real-time heuristic search
• Epsilon-transformation: exploiting phase transitions to solve combinatorial optimization problems
• Random Trees and the Analysis of Branch and Bound Procedures
• Stochastic Modeling of Branch-and-Bound Algorithms with Best-First Search
• Generalized best-first search strategies and the optimality of A*
• The average complexity of depth-first search with backtracking and cutoff
• Branch-and-Bound Methods: A Survey
• On a linear diophantine problem of Frobenius

This page was built for publication: Performance of linear-space search algorithms