Heuristic search in restricted memory
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3657150 (Why is no real title available?)
- Admissibility of \(AO^ *\) when heuristics overestimate
- Algorithms for searching explicit AND/OR graphs and their applications to problem reduction search
- Depth-first iterative-deepening: An optimal admissible tree search
- Depth-m search in branch-and-bound algorithms
- General branch and bound, and its relation to A^* and AO^*
- Three approaches to heuristic search in networks
Cited in
(36)- scientific article; zbMATH DE number 1882050 (Why is no real title available?)
- Agent searching in a tree and the optimality of iterative deepening
- Breadth-first heuristic search
- Performance of linear-space search algorithms
- Reducing reexpansions in iterative-deepening search by controlling cutoff bounds
- Maximizing over multiple pattern databases speeds up heuristic search
- Evaluating the impact of AND/OR search on 0-1 integer linear programming
- Weighted \(A^*\) search - unifying view and application
- Heuristic search through islands
- Frontier search
- Heuristically ordered search in state graphs
- scientific article; zbMATH DE number 1882054 (Why is no real title available?)
- Research note: the point of diminishing returns in heuristic search
- Hierarchical Adaptive State Space Caching Based on Level Sampling
- Contract Search: heuristic search under node expansion constraints
- LAO*: A heuristic search algorithm that finds solutions with loops
- Heuristic search strategies for multiobjective state space search
- scientific article; zbMATH DE number 1759719 (Why is no real title available?)
- On the abstraction method for the container relocation problem
- Bidirectional heuristic search with limited resources
- Proof-number search
- Performance of linear-space search algorithms
- Heuristic search under contract
- Linear-space best-first search
- Optimization of heuristic search using recursive algorithm selection and reinforcement learning
- Effective use of memory in iterative deepening search
- Best-first minimax search
- Utility of pathmax in partial order heuristic search
- \(\text{BIDA}^*\): An improved perimeter search algorithm
- The compressed differential heuristic
- Completeness and admissibility for general heuristic search algorithms -- a theoretical study: Basic concepts and proofs
- Algorithms for searching explicit AND/OR graphs and their applications to problem reduction search
- scientific article; zbMATH DE number 4162303 (Why is no real title available?)
- Finding optimal solutions to the graph partitioning problem with heuristic search
- Heuristic search. Theory and applications
- Memory intensive AND/OR search for combinatorial optimization in graphical models
This page was built for publication: Heuristic search in restricted memory
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1263290)
