Journal ArticleDOI
The heuristic search under conditions of error
Reads0
Chats0
TLDR
This paper introduces a new restriction upon the heuristic, called the “bandwidth” condition, that enables the ordered search to better cope with time and space difficulties, and provides some additional insight to the general problem of searching game trees.About:
This article is published in Artificial Intelligence.The article was published on 1974-09-01. It has received 82 citations till now. The article focuses on the topics: Incremental heuristic search & Beam search.read more
Citations
More filters
Journal ArticleDOI
The Hearsay-II Speech-Understanding System: Integrating Knowledge to Resolve Uncertainty
TL;DR: The characteristics of the speech problem in particular, the special kinds of problem-solving uncertainty in that domain, the structure of the Hearsay-II system developed to cope with that uncertainty, and the relationship between Hearsey-II's structure and those of other speech-understanding systems are discussed.
Journal ArticleDOI
Generalized best-first search strategies and the optimality of A*
Rina Dechter,Judea Pearl +1 more
TL;DR: It is shown that several known properties of A* retain their form and it is also shown that no optimal algorithm exists, but if the performance tests are confirmed to cases in which the estimates are also consistent, then A* is indeed optimal.
Performance measurement and analysis of certain search algorithms.
TL;DR: In this paper, the A(+ or -) best-first search algorithm is applied to the problem of path finding in strongly connected graphs, and experimental and analytic techniques are combined to measure and predict the performance of the algorithm.
Journal ArticleDOI
Anytime heuristic search
Eric A. Hansen,Rong Zhou +1 more
TL;DR: This work describes how to convert the heuristic search algorithm A* into an anytime algorithm that finds a sequence of improved solutions and eventually converges to an optimal solution.
Journal ArticleDOI
The B* tree search algorithm: a best-first proof procedure
TL;DR: The algorithm, which is named B*, finds a proof that an arc at the root of a search tree is better than any other by attempting to find both the best arc atThe root and the simplest proof, in best-first fashion.
References
More filters
Journal ArticleDOI
A Formal Basis for the Heuristic Determination of Minimum Cost Paths
TL;DR: How heuristic information from the problem domain can be incorporated into a formal mathematical theory of graph searching is described and an optimality property of a class of search strategies is demonstrated.
Journal ArticleDOI
Some studies in machine learning using the game of checkers
TL;DR: In this article, two machine learning procedures have been investigated in some detail using the game of checkers, and enough work has been done to verify the fact that a computer can be programmed so that it will lear...
Journal ArticleDOI
Branch-and-Bound Methods: A Survey
Eugene L. Lawler,D. E. Wood +1 more
TL;DR: The essential features of the branch-and-bound approach to constrained optimization are described, and several specific applications are reviewed, including integer linear programming Land-Doig and Balas methods, nonlinear programming minimization of nonconvex objective functions, and the quadratic assignment problem Gilmore and Lawler methods.
Book
Problem-Solving Methods in Artificial Intelligence
TL;DR: This paper will concern you to try reading problem solving methods in artificial intelligence as one of the reading material to finish quickly.
Journal ArticleDOI
A Method for Solving Traveling-Salesman Problems
TL;DR: A method of solution for the traveling-salesman problem that is applicable to both symmetric and asymmetric problems with random elements, and does not use subjective decisions, so that it can be completely mechanized.