The heuristic search under conditions of error

DOI10.1016/0004-3702(74)90014-9zbMath0288.68050OpenAlexW2018086369MaRDI QIDQ1846741

Larry R. Harris

Publication date: 1974

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

Full work available at URL: https://doi.org/10.1016/0004-3702(74)90014-9

Mathematics Subject Classification ID

Pattern recognition, speech recognition (68T10) Algorithms in computer science (68W99)

Related Items

A new variant of the \(A^*\)-algorithm which closes a node at most once., Admissibility of \(AO^ *\) when heuristics overestimate, Best-first minimax search, Unnamed Item, Probabilistic analysis of the complexity of A*, Predicting optimal solution costs with bidirectional stratified sampling in regular search spaces, Knowledge versus search: a quantitative analysis using A*, On the complexity of admissible search algorithms, On the optimality of A, Heuristic search through islands, A chronology of computer chess and its literature, A heuristic search algorithm with modifiable estimate, On optimizing the evaluation of a set of expressions, Controlling the learning process of real-time heuristic search

Cites Work

• Heuristic search viewed as path finding in a graph
• An admissible and optimal algorithm for searching AND/OR graphs
• A Method for Solving Traveling-Salesman Problems
• Branch-and-Bound Methods: A Survey
• An Algorithm for the Traveling Salesman Problem
• Unnamed Item