×

Heuristic search viewed as path finding in a graph. (English) Zbl 0206.22603


MSC:

90C35 Programming involving graphs or networks
PDF BibTeX XML Cite
Full Text: DOI

References:

[1] Frazer, W.D.; McKeller, A.C., Samplesort: A sampling approach to minimal storage tree sorting, () · Zbl 0287.68022
[2] Winograd, S., On the number of multiplications required to compute certain functions, (), 1840-1842, (5) · Zbl 0189.47902
[3] Nilsson, N., Problem-solving methods in artificial intelligence, (Spring, 1971), McGraw-Hill New York, in preparation
[4] Newell, A.; Ernst, G., (), 17-24
[5] Michie, D., Heuristic search, () · Zbl 0288.68049
[6] Sandewall, E., Concepts and methods for heuristic search, (), 199-218
[7] Newell, A.; Simon, H., GPS, a program that simulates human thought, (), 279-293
[8] Newell, A.; Shaw, J.C.; Simon, H., Empirical explorations with the logic theory machine, (), 218-239
[9] Doran, J.; Michie, D., Experiments with the graph traverser program, (), 235-259, (1437)
[10] Michie, D.; Ross, R., Experiments with the adaptive graph traverser, Machine intelligence, 5, 301-318, (1969) · Zbl 0221.68059
[11] Nillson, N., A mobile automation: an application of artificial intelligence techniques, (), 509-520
[12] Hart, P.; Nilsson, N.; Raphael, B., A formal basis for the heuristic determination of minimum cost paths, IEEE trans. system sci. cybernetics, 4, 100-107, (July 1968), 2
[13] Lawler, E.; Wood, D., Branch-and-bound methods: A survey, Operations research, 14, 699-719, (July-August 1966), 4
[14] Pohl, I., A theory of bi-directional search in path problems, () · Zbl 0206.22603
[15] Dreyfus, D., An appraisal of some shortest path algorithms, Operations research, 17, 395-412, (May-June 1969), 3
[16] Moore, E., The shortest path through a maze, (), 285-292, Part II
[17] Kowalski, R., Search strategies for theorem-proving, Machine intelligence, 5, 181-202, (1969) · Zbl 0218.68018
[18] Samuel, A., Some studies in machine learning using the game of checkers, Computers and thought, 71-105, (1963)
[19] Pohl, I., First results on the effect of error in heuristic search, Machine intelligence, 5, 219-236, (1969) · Zbl 0221.68058
[20] Sandewall, E., A planning problem solver based on look-ahead in stochastic game trees, J. ACM, 16, 364-383, (July 1969), 3
[21] Slagle, J.; Bursky, P., Experiments with a multipurpose theorem-proving heuristic program, J. ACM, 15, 85-99, (Jan. 1968), 1
[22] Quinlan, J.; Hunt, E., A formal deductive problem solving system, J. ACM, 15, 625-646, (Oct. 1968), 4
[23] Ernst, G., Sufficient conditions for the success of GPS, J. ACM, 16, 517-533, (Oct. 1969), 4
[24] Wilkinson, J., Rounding erros in algebraic processes, (1963), Prentice-Hall Englewood Cliffs, N.J · Zbl 1041.65502
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.