×

The heuristic search under conditions of error. (English) Zbl 0288.68050


MSC:

68T10 Pattern recognition, speech recognition
68W99 Algorithms in computer science
PDFBibTeX XMLCite
Full Text: DOI

References:

[1] Berliner, H. J., Some necessary conditions for a master chess program, (Proc. Third International Joint Conf. on Artificial Intelligence (1973)), 77
[2] Chang, C. L.; Slagle, J. R., An admissible and optimal algorithm for searching AND/OR graphs, Artificial Intelligence, 2, 117-128 (1971) · Zbl 0227.68016
[3] Croes, G., A method for solving traveling salesman problems, Operations Research, 6, 791-812 (1958) · Zbl 1414.90303
[4] Harris, L. R., A model for adaptive problem solving applied to natural language acquisition, (Technical Report TR-133 (1972), Computer Science Dept., Cornell University)
[5] Hart, P. E.; Nilsson, N. J.; Raphael, B., A formal basic for the heuristic determination of minimum cost paths, IEEE Trans. Systems Sci. and Cybernetics, 4, 100-107 (1968)
[6] Lawler, E.; Wood, D., Branch and bound methods: A survey, Operations Research, 14, 699-719 (July-August 1966)
[7] Lin, S.; Kernigham, B. W., A heuristic algorithm for the travelling salesman problem, Bell Telephone Laboratories Computer Science Technical Report No. 1 (April 1972)
[8] Little, J. D.; Murtz, K. G.; Sweeney, D. W.; Karel, C., An algorithm for the traveling salesman problem, Operations Research, 11, 972-989 (November-December 1963)
[9] Nilsson, N. J., Problem Solving Methods in Artificial Intelligence (1971), McGraw-Hill: McGraw-Hill New York
[10] Pohl, I., First results on the effect of error in heuristic search, Machine Intelligence, 5, 219-236 (1969) · Zbl 0221.68058
[11] Pohl, I., Heuristic search viewed as path finding in a graph, Artificial Intelligence, 1, 193-204 (1970) · Zbl 0206.22603
[12] Samuel, A. L., Some studies in machine learning using the game of checkers, IBM J. Res. Develop., 3, 210-229 (1959)
[13] Slagle, J. R., Game trees, M and N minimaxing and the M and N alpha-beta procedure, Lawrence Radiation Laboratory AI Report No. 3 (November 1970), Livermore, Calif.
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. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.