Heuristic search in restricted memory
From MaRDI portal
Publication:1263290
DOI10.1016/0004-3702(89)90010-6zbMath0687.68040OpenAlexW2089137033MaRDI QIDQ1263290
Publication date: 1989
Published in: Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0004-3702(89)90010-6
Analysis of algorithms and problem complexity (68Q25) Searching and sorting (68P10) Artificial intelligence (68T99)
Related Items
Agent searching in a tree and the optimality of iterative deepening ⋮ Weighted \(A^*\) search - unifying view and application ⋮ Utility of pathmax in partial order heuristic search ⋮ On the abstraction method for the container relocation problem ⋮ Best-first minimax search ⋮ HEURISTIC SEARCH UNDER CONTRACT ⋮ Optimization of heuristic search using recursive algorithm selection and reinforcement learning ⋮ Reducing reexpansions in iterative-deepening search by controlling cutoff bounds ⋮ Effective use of memory in iterative deepening search ⋮ Linear-space best-first search ⋮ Evaluating the impact of AND/OR search on 0-1 integer linear programming ⋮ Finding optimal solutions to the graph partitioning problem with heuristic search ⋮ Heuristic search strategies for multiobjective state space search ⋮ Performance of linear-space search algorithms ⋮ Hierarchical Adaptive State Space Caching Based on Level Sampling ⋮ Performance of linear-space search algorithms ⋮ Memory intensive AND/OR search for combinatorial optimization in graphical models ⋮ \(\text{BIDA}^*\): An improved perimeter search algorithm ⋮ Proof-number search ⋮ Algorithms for searching explicit AND/OR graphs and their applications to problem reduction search
Cites Work
- General branch and bound, and its relation to \(A^*\) and \(AO^*\)
- Depth-first iterative-deepening: An optimal admissible tree search
- Admissibility of \(AO^ *\) when heuristics overestimate
- Algorithms for searching explicit AND/OR graphs and their applications to problem reduction search
- Three approaches to heuristic search in networks
- Depth-m search in branch-and-bound algorithms
- Unnamed Item
This page was built for publication: Heuristic search in restricted memory
