Sequential and parallel algorithms for frontier A* with delayed duplicate detection

Proceedings of the National Conference on Artificial Intelligence

Volumn 2, Issue , 2006, Pages 1039-1044

  Niewiadoniski, Robert ^a   Amaral, José Nelson ^a   Holte, Robert C ^a  

^a UNIVERSITY OF ALBERTA   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER NETWORKS; COMPUTER WORKSTATIONS; CONFORMAL MAPPING; PROBLEM SOLVING;

COMMODITY NETWORKS; DELAYED DUPLICATE DETECTION (DDD); LEAK-BACK PROBLEMS; WORKLOAD DISTRIBUTION STRATEGY;

PARALLEL ALGORITHMS;

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

References (13)

1. Dutt, S., and Mahapatra, N. R. 1994. Scalable load balancing strategies for parallel a* algorithms. Journal of Parallel and Distributed Computing 22(3):488-505.
2. Hart, P.; Nilsson, N.; and Raphael, B. 1968. A formal basis for the heuristic determination of minimum cost paths. IEEE Transactions of Systems Science and Cybernetics SSC-4(2):100-107.
3. Korf, R. E., and Schultze, P. 2005. Large-scale parallel breadth-first search. In Proceedings of the National Conference on Artificial Intelligence (AAAI-05), 1380-1385.
4. Korf, R. E., 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.
5. Korf, R. E.; Zhang, W.; Thayer, I.; and Hohwald, H. 2005. Frontier search. Journal of the ACM 52(5):715-748.
6. Korf, R. E. 1999. A Divide and Conquer Bidirectional Search: First Results. In International Joint Conference on Artificial Intelligence (IJCAI), 1184-1189.
7. Korf, R. E. 2003. Delayed duplicate detection: Extended abstract. In Proceedings of the Eighteenth International Joint Conference on Artificial Intelligence, 1539-1541.
8. Korf, R. E. 2004. Best-first frontier search with delayed duplicate detection. In Proceedings of the National Conference on Artificial Intelligence (AAAI-04), 650-657.
9. Kumar, V.; Grama, A.; Gupta, A.; and Karypis, G. 1994. Introduction to parallel computing: design and analysis of algorithms. Benjamin-Cummings Publishing Co., Inc.
10. Kumar, V.; Ramesh, K.; and Rao, V. N. 1988. Parallel bestfirst search of state-space graphs: A summary of results. In National Conference on Artificial Intelligence, 122-127.
11. McNaughton, M.; Lu, P.; Schaeffer, J.; and Szafron, D. 2002. Memory-efficient A* heuristics for multiple sequence alignment. In National Conference on Artificial Intelligence (AAAI-02), 737-743.
12. Shi, H., and Schaeffer, J. 1992. Parallel Sorting by Regular Sampling. Journal of Parallel and Distibuted Computing 14(4):361-372.
13. Thompson, J. D.; Plewniak, F.; and Poch, O. 1999. BAl-iBASE: a benchmark alignment database for the evaluation of multiple alignment programs. Bioinformatics 15(1):87-88.