Cite

[1] R. Dechter, J. Pearl, Generalized best-first search strategies and optimality of A ∗, Journal ACM, 32, 3, (1985) 505-536. ⇒192, 199, 20410.1145/3828.3830Search in Google Scholar

[2] I. Fekete, T. Gregorics, L. Zs. Varga, Corrections to graph-search algorithms. Proc. of the Fourth Conference of Program Designers, ELTE, Budapest, June 1-3, 1988. ⇒191Search in Google Scholar

[3] T. Gregorics, Which of graphsearch versions is the best? Annales Univ. Sci. Budapest., Sect. Comput. 15 (1995) 93-108. ⇒191, 202Search in Google Scholar

[4] A. Martelli, On the complexity of admissible search algorithms. Artificial Intelligence, 8, 1 (1977) 1-13. ⇒198, 201, 20410.1016/0004-3702(77)90002-9Search in Google Scholar

[5] N. J. Nilsson, Principles of Artificial Intelligence. Springer-Verlag, 1982. ⇒190, 191, 195, 196, 197, 198, 204Search in Google Scholar

[6] S. J. Russell, P. Norvig, Artificial Intelligence. A Modern Approach. Prentice Hall Inc., 1995. ⇒193, 204Search in Google Scholar

eISSN:
2066-7760
Language:
English
Publication timeframe:
2 times per year
Journal Subjects:
Computer Sciences, other