Localizing A∗

Proceedings of the 17th National Conference on Artificial Intelligence and 12th Conference on Innovative Applications of Artificial Intelligence, AAAI 2000

Volumn , Issue , 2000, Pages 885-890

  Edelkamp, Stefan ^a   Schrödl, Stefan ^b  

^a Institut für Informatik   (Germany)

^b DaimlerChrysler Research and Technology North America Inc   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; HARD DISK STORAGE;

BREADTH-FIRST; DISC CAPACITY; HARD DISC; HEURISTIC SEARCH; LARGE PROBLEMS; LAYERED STORAGE; MAIN-MEMORY; PROBLEM INSTANCES; PROBLEM SPACE; STORAGE SYSTEMS;

HEURISTIC ALGORITHMS;

EID: 9444241341     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (23)

1. Bayer, R., and McCreight, E. 1970. Organization and maintenanace of large ordered indexes. Acta Informatica 13(7):427-436.
2. Belady, L. 1966. A study of replacement algorithms for virtual storage computers. IBM Syst. J 5:18-101.
3. Bryant, R. E. 1985. Symbolic manipulation of boolean functions using a graphical representation. In Design Automation, 688-694.
4. Cormen, T. H.; Leiserson, C. E.; and Rivest, R. L. 1990. Introduction to Algorithms. The MIT Press.
5. Dijkstra, E. W. 1959. A note on two problems in connexion with graphs. Numerische Mathematik 1:269-271.
6. Eckerle, J., and Schuierer, S. 1995. Efficient memory-limited graph search. In KI, 101-112.
7. Fagin, R.; Nievergelt, J.; Pippenger, N.; and Strong, H. R. 1970. Extendible hashing - a fast access method for dynamic files. ACM Trans. Database Syst. 4(3):315-344.
8. Hart, P. E.; Nilsson, N. J.; and Raphael, B. 1968. A formal basis for heuristic determination of minimum path cost. IEEE Trans. on SSC 4:100.
9. Hu, A. J., and Dill, D. L. 1993. Reducing BDD size by exploiting functional dependencies. In Design Automation, 266-271.
10. Knuth, D. E. 1973. The Art of Computer Programming, Vol 3: Sorting and Searching. Addison-Wesley.
11. Korf, R. E. 1985. Depth-first iterative-deepening: An optimal admissible tree search. Artificial Intelligence 27(1):97-109.
12. Korf, R. E. 1993. Linear-space best-first search. Artificial Intelligence 62(1):41-78.
13. Larson, P.-A. 1978. Dynamic hashing. BIT 18(2):184-201.
14. Litwin, W. 1978. Virtual hashing: a dynamically changing hashing. In Very Large Databases, 517-523.
15. Mahapatra, N. R., and Dutt, S. 1997. Scalable global and local hashing strategies for duplicate pruning in parallel A* graph search. IEEE Transactions on Parallel and Distributed Systems 8(7):738-756.
16. Mehlhorn, K., and Näher, S. 1999. The LEDA Platform of Combinatorial and Geometric Computing. Cambridge University Press.
17. Minura, T., and Ishida, T. 1998. Stochastic node caching for efficient memory-bounded search. In AAAI, 450-459.
18. Pearl, J. 1985. Heuristics. Addison-Wesley.
19. Russell, S. 1992. Efficient memory-bounded search methods. In ECAI-92, 1-5.
20. Sen, A. K., and Bagchi, A. 1989. Fast recursive formulations for best-first search that allow controlled use of memory. In IJCAI, 297-302.
21. Sleator, D., and Tarjan, R. 1985. Amortized efficiency of list update and paging rules. Communications of the ACM 28:202-208.
22. Tanenbaum, A. S. 1992. Modern Operating Systems. New Jersey: Prentice Hall.
23. Yang, B.; Chen, Y.-A.; Bryang, R. E.; and Hallaron, D. R. 1998. Space- and time-efficient BDD construction via working set control. In Asia and South Pacific Design Automation, 423-432.