Publisher
Springer Berlin Heidelberg
Reference11 articles.
1. Culberson, J., and J. Schaeffer. Pattern Databases, Computational Intelligence, Vol. 14, No. 3, 1998, pp. 318–334.
2. Edelkamp, S. and R.E. Korf, The branching factor of regular search spaces, Proceedings of the National Conference on Artificial Intelligence (AAAI-98), Madison, WI, July, 1998, pp. 299–304.
3. Hansson, O., A. Mayer, and M. Yung, Criticizing solutions to relaxed models yields powerful admissible heuristics, Information Sciences, Vol. 63, No. 3, 1992, pp. 207–227.
4. Hart, P.E., N.J. Nilsson, and B. Raphael, A formal basis for the heuristic determination of minimum cost paths, IEEE Transactions on Systems Science and Cybernetics, Vol. SSC-4, No. 2, July 1968, pp. 100–107.
5. Johnson, W.W. and W.E. Storey, Notes on the 15 puzzle, American Journal of Mathematics, Vol. 2, 1879, pp. 397–404.
Cited by
10 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献