Structured duplicate detection in external-memory graph search

Proceedings of the National Conference on Artificial Intelligence

Volumn , Issue , 2004, Pages 683-688

  Zhou, Rong ^a   Hansen, Eric A ^a  

^a MISSISSIPPI STATE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DELAYED DUPLICATE DETECTION; EXTERNAL MEMORY; STRUCTURED DUPLICATE DETECTION; TWO-LEVEL MODELS;

ALGORITHMS; INPUT OUTPUT PROGRAMS; MAGNETIC DISK STORAGE; MATHEMATICAL MODELS; STATE SPACE METHODS;

GRAPH THEORY;

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

References (15)

1. Aggarwal, A., and Vitter, J. 1988. The input/output complexity of sorting and related problems. Comm. of the ACM 31(9):1116-27.
2. Belady, L. 1966. A study of replacement algorithms for virtual storage. IBM Systems Journal 5:78-101.
3. Edelkamp, S., and Schrödl, S. 2000. Localizing A*. In Proc. of the 17th National Conference on Artificial Intelligence, 885-890.
4. Holte, R.; Mkadmi, T.; Zimmer, R.; and MacDonald, A. 1996. Speeding up problem solving by abstraction: A graph-oriented approach. Artificial Intelligence 85(1-2):321-361.
5. Klein, D., and Manning, C. 2003. Factored A* search for models over sequences and trees. In Proceedings of the 17th International Joint Conference on Artificial Intelligence, 1246-1251.
6. Korf, R., and Zhang, W. 2000. Divide-and-conquer frontier search applied to optimal sequence alignment. In Proceedings of the 17th National Conference on Artificial Intelligence, 910-916.
7. Korf, R. 1985. Depth-first iterative deepening: An optimal admissible tree search. Artificial Intelligence 27:97-109.
8. Korf, R. 2003a. Breadth-first frontier search with delayed duplicate detection. In Proceedings of the Workshop on Model Checking and Artificial Intelligence at IJCAI-03, 87-92.
9. Korf, R. 2003b. Delayed duplicate detection: Extended abstract. In Proceedings of the 17th International Joint Conference on Artificial Intelligence, 1539-1541.
10. Mehlhorn, K., and Meyer, U. 2002. External-memory breadth-first search with sublinear I/O. In Proceedings of the 10th Annual European Symposium on Algorithms, 723-735.
11. Munagala, K., and Ranade, A. 1999. I/O-complexity of graph algorithms. In Proceedings of the 10th Symposium on discrete algorithms, 687-694. ACM-SIAM.
12. Sleator, D., and Tarjan, R. 1985. Amortized efficiency of list update and paging rules. Communications of the ACM 28:202-8.
13. Thompson, J.; Plewniak, F.; and Poch, O. 1999. BAliBASE: A benchmark alignment database for the evaluation of multiple alignment programs. Bioinformatics 15(1):87-88.
14. Zhou, R., and Hansen, E. 2003. Sweep A*: Space-efficient heuristic search in partially ordered graphs. In Proc. of 15th IEEE International Conf. on Tools with Artificial Intelligence, 427-434.
15. Zhou, R., and Hansen, E. 2004. Breadth-first heuristic search. In Proceedings of the 14th International Conference on Automated Planning and Scheduling.