Parallel structured duplicate detection

Proceedings of the National Conference on Artificial Intelligence

Volumn 2, Issue , 2007, Pages 1217-1223

  Zhou, Rong ^a   Hansen, Eric A ^b  

^a PALO ALTO RESEARCH CENTER   (United States)

^b MISSISSIPPI STATE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DISK I/O OPERATIONS; STRIPS PLANNING; STRUCTURED DUPLICATE DETECTION;

ALGORITHMS; STORAGE ALLOCATION (COMPUTER); SYNCHRONIZATION;

GRAPH THEORY;

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

References (16)

1. Belady, L. 1966. A study of replacement algorithms for virtual storage. IBM Systems Journal 5:78-101.
2. Dutt, S., and Mahapatra, N. 1994. Scalable load balancing strategies for parallel A* algorithms. Journal of Parallel and Distributed Computing 22(3):488-505.
3. Grama, A., and Kumar, V. 1999. State of the art in parallel search techniques for discrete optimization problems. IEEE Transactions on Knowledge and Data Engineering 11(1):28-35.
4. Haslum, P., and Geffner, H. 2000. Admissible heuristics for optimal planning. In Proc. of the 5th International Conference on AI Planning and Scheduling, 140-149.
5. Jabbar, S., and Edelkamp, S. 2006. Parallel external directed model checking with linear I/O. In Proceedings of the 7th International Conference on Verification, Model Checking, and Abstract Interpretation (VMCAI 2006), 237-251.
6. Korf, R., and Felner, A. 2007. Recent progress in heuristic search: A case study of the four-peg towers of Hanoi problem. In Proceedings of the 20th International Joint Conference on Artificial Intelligence (IJCAI-07), 2334-2329.
7. Korf, R., and Schultze, P. 2005. Large-scale parallel breadth-first search. In Proc. of the 20th National Conference on Artificial Intelligence (AAAI-05), 1380-1385.
8. Kumar, .V; Ramesh, K.; and Rao, V. 1988. Parallel best-first search of state-space graphs: A summary of results. In Proceedings of the 7th National Conference on Artificial Intelligence (AAAI-88), 122-127.
9. Nichols, B.; Buttlar, D.; and Farrell, J. P. 1996. PThreads Programming. O'Reilly.
10. Niewiadomski, R.; Amaral, J.; and Holte, R. 2006. Sequential and parallel algorithms for frontier A* with delayed duplicate detection. In Proceedings of the 21st National Conference on Artificial Intelligence (AAAI-06), 1039-1044.
11. Zhang, Y., and Hansen, E. 2006. Parallel breadth-first heuristic search on a shared-memory architecture. In Heuristic Search, Memory-Based Heuristics and Their Applications: Papers from the AAAI Workshop, 33-38. AAAI Press. Technical Report WS-06-08.
12. Zhou, R., and Hansen, E. 2004. Structured duplicate detection in external-memory graph search. In Proceedings of the 19th National Conference on Artificial Intelligence (AAAI-04), 683-688.
13. Zhou, R., and Hansen, E. 2005. External-memory pattern databases using structured duplicate detection. In Proceedings of the 20th National Conference on Artificial Intelligence (AAAI-05), 1398-1405.
14. Zhou, R., and Hansen, E. 2006a. Breadth-first heuristic search. Artificial Intelligence 170(4-5):385-408.
15. Zhou, R., and Hansen, E. 2006b. Domain-independent structured duplicate detection. In Proceedings of the 21st National Conference on Artificial Intelligence (AAAI-06), 1082-1087.
16. Zhou, R., and Hansen, E. 2007. Edge partitioning in external-memory graph search. In Proceedings of the 20th International Joint Conference on Artificial Intelligence (IJCAI-07), 2410-2416.