Author:
Edelkamp Stefan,Helmert Malte
Publisher
Springer Berlin Heidelberg
Reference23 articles.
1. Blum, A., Furst, M.: Fast planning through planning graph analysis. In: IJCAI 1995, pp. 1636–1642 (1995)
2. Bryant, R.E.: Symbolic manipulation of boolean functions using a graphical representation. ACM/IEEE Design Automation, 688–694 (1985)
3. Lecture Notes in Computer Science;J.C. Culberson,1996
4. Eckerle, J., Schuierer, S.: Efficient memory-limited graph search. LNCS, vol. 981, pp. 101–112 (1995)
5. Edelkamp, S., Korf, R.E.: The branching factor of regular search spaces. In: AAAI 1998, pp. 299–304 (1998)
Cited by
9 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献