scientific article; zbMATH DE number 3351222
From MaRDI portal
zbMath0221.68058MaRDI QIDQ5626306
Publication date: 1969
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
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^*\), Anytime search in dynamic graphs, MM: a bidirectional search algorithm that is guaranteed to meet in the middle, Probabilistic analysis of the complexity of A*, A procedure to determine intersections between polyhedral objects, Knowledge versus search: a quantitative analysis using A*, KADABRA is an ADaptive Algorithm for Betweenness via Random Approximation, Breadth-first heuristic search, Unnamed Item, LAO*: A heuristic search algorithm that finds solutions with loops, On the complexity of admissible search algorithms, On the optimality of A, Problem representations and formal properties of heuristic search, Learning for efficient search, Unnamed Item, Theoretical comparisons of search strategies in branch-and-bound algorithms, Heuristic search viewed as path finding in a graph, A result on the computational complexity of heuristic estimates for the \(A^*\) algorithm, The heuristic search under conditions of error, \(\text{BIDA}^*\): An improved perimeter search algorithm, MRPPS?An interactive refutation proof procedure system for question-answering, Solving the Watchman Route Problem with Heuristic Search, Controlling the learning process of real-time heuristic search, A pipe routing hybrid approach based on A-star search and linear programming
