Large-scale parallel breadth-first search

Proceedings of the National Conference on Artificial Intelligence

Volumn 3, Issue , 2005, Pages 1380-1385

  Korf, Richard E ^a   Schultze, Peter ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

LINEAR-TIME ALGORITHMS; PARALLEL BREADTH-FIRST SEARCH; PERMUTATIONS; PUZZLES;

ALGORITHMS; ARTIFICIAL INTELLIGENCE; DATA STORAGE EQUIPMENT; SEARCH ENGINES;

PARALLEL PROCESSING SYSTEMS;

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

References (17)

1. Brungger, A.; Marzetta, A.; Fukuda, K.; and Nievergelt, J. 1999. The parallel search bench ZRAM and its applications, Annals of Operations Research 90:45-63.
2. Culberson, J., and Schaeffer, J. 1998. Pattern databases. Computational Intelligence 14(3):318-334.
3. Edelkamp, S.; Jabbar, S.; and Schroedl, S. 2004. External A*. In Proceedings of the German Conference on Artificial Intelligence, 226-240.
4. Hart, P.; Nilsson, N.; and Raphael, B. 1968. A formal basis for the heuristic determination of minimum cost paths. IEEE Transactions on Systems Science and Cybernetics SSC-4(2):100-107.
5. Katriel, I., and Meyer, U. 2003. Elementary graph algorithms in external memory. In Algorithms for Memory Hierarchies, LNCS 2625. Springer-Verlag. 62-84.
6. Korf, R., and Zhang, W. 2000. Divide-and-conquer frontier search applied to optimal sequence alignment. In Proceedings of the National Conference on Artificial Intelligence (AAAI-2000), 910-916.
7. Korf, R.; Zhang, W.; Thayer, I.; and Hohwald, H. 2005. Frontier search. Journal of the Association for Computing Machinery (JACM), to appear.
8. Korf, R. 1999. Divide-and-conquer bidirectional search: First results. In Proceedings of the International Joint Conference on Artificial Intelligence (IJCAI-99), 1184-1189.
9. Korf, R. 2003. Delayed duplicate detection: Extended abstract. In Proceedings of the International Joint Conference on Artificial Intelligence (IJCAI-03), 1539-1541.
10. Korf, R. 2004. Best-first frontier search with delayed duplicate detection. In Proceedings of the National Conference on Artificial Intelligence (AAAI-2004), 650-657.
11. Myrvold, W., and Ruskey, F. 2001. Ranking and unranking permutations in linear time. Information Processing Letters 79:281-284.
12. Nichols, B.; Butler, D.; and Farrell, J. 1996. Pthreads Programming. O'Reilly.
13. Patterson, D.; Gibson, G.; and Katz, R. 1988. A case for redundant arrays of inexpensive disks (RAID). In Proceedings of the ACM SIGMOD International Conference on Management of Data, 109-116.
14. Roscoe, A. 1994. Model-checking CSP. In Roscoe, A., éd., A Classical Mind, Essays in Honour of CAR Hoare. Prentice-Hall.
15. Stern, U., and Dill, D. 1998. Using magnetic disk instead of main memory in the Mur(phi) verifi er. In Proceedings of the 10th International Conference on Computer-Aided Verification, 172-183.
16. Zhou, R., and Hansen, E. 2004a. Breadth-first heuristic search. In Proceedings of the 14th International Conference on Automated Planning and Scheduling (ICAPS-2004), 92-100.
17. Zhou, R., and Hansen, E. 2004b. Structured duplicate detection in external-memory graph search. In Proceedings of the National Conference on Artificial Intelligence (AAAI-2004), 683-688.