scientific article; zbMATH DE number 3351222
From MaRDI portal
Publication:5626306
Cited in
(27)- Probabilistic analysis of the complexity of A*
- Knowledge versus search: a quantitative analysis using A*
- On the complexity of admissible search algorithms
- On the optimality of A
- Problem representations and formal properties of heuristic search
- Perimeter search in restricted memory
- New approaches for understanding the asymptotic complexity of \(A^*\) tree searching.
- An upper bound on the time complexity of iterative-deepening-\(A^*\)
- MM: a bidirectional search algorithm that is guaranteed to meet in the middle
- The heuristic search under conditions of error
- \(\text{BIDA}^*\): An improved perimeter search algorithm
- A pipe routing hybrid approach based on A-star search and linear programming
- Anytime search in dynamic graphs
- Breadth-first heuristic search
- Heuristic search viewed as path finding in a graph
- A procedure to determine intersections between polyhedral objects
- Theoretical comparisons of search strategies in branch-and-bound algorithms
- KADABRA is an ADaptive Algorithm for Betweenness via Random Approximation
- MRPPS?An interactive refutation proof procedure system for question-answering
- scientific article; zbMATH DE number 3352780 (Why is no real title available?)
- scientific article; zbMATH DE number 3405669 (Why is no real title available?)
- Solving the Watchman Route Problem with Heuristic Search
- LAO*: A heuristic search algorithm that finds solutions with loops
- Learning for efficient search
- Relative error streaming quantiles
- A result on the computational complexity of heuristic estimates for the A^* algorithm
- Controlling the learning process of real-time heuristic search
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5626306)
