Previous |  Up |  Next

Article

References:
[1] Doran J. E., Michie D.: Experiments with the Graph Traverser program. Proc. R. Soc. 294 (1966), 1437, 235-259.
[2] Doran J. E.: An approach to automatic problem solving. Machine Intelligence 1 (eds. N. L. Collins, D. Michie). Oliver and Boyd, Edinburgh 1967.
[3] Doran J. E.: New developments of the Graph Traverser. Machine Intelligence 2 (eds. E. Dale, D. Michie). Oliver and Boyd, Edinburgh 1968. Zbl 0213.18201
[4] Hart P., Nilsson N., Raphael B.: A formal basis for the heuristic determination of minimum cost paths. I.E.E.E. Trans. on Sys. Sci. and Cybernetics 4 (1968), 2, 100-107.
[5] Michie D., Ross R.: Experiments with the Adaptive Graph Traverser. Machine Intelligence 5 (eds. B. Meltzer, D. Michie). Edinburgh University Press, Edinburgh 1970. MR 0258327
[6] Molnár Ľ.: On parameters of an evaluation function for heuristic search as a path problem. Kybernetika 7 (1971), 5, 386-393. MR 0302200 | Zbl 0222.68039
[7] Pohl I.: First results on the effect of error in heuristic search. Machine Intelligence 5 (eds. B. Meltzer, D. Michie). Edinburgh University Press, Edinburgh 1970. MR 0292343
Partner of
EuDML logo