Best-first frontier search with delayed duplicate detection

Proceedings of the National Conference on Artificial Intelligence

Volumn , Issue , 2004, Pages 650-657

  Korf, Richard E ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATIC VERIFICATION; DELAYED DUPLICATE DETECTION (DDD); FRONTIER SEARCH; NODES;

ALGORITHMS; BANDWIDTH; MAGNETIC DISK STORAGE; PROBLEM SOLVING; RANDOM PROCESSES;

ARTIFICIAL INTELLIGENCE;

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

References (20)

1. Bode, J.-P., and Hinz, A. 1999. Results and open problems on the tower of hanoi. In Proceedings of the Thirtieth Southeastern International Conference on Combinatoris, Graph Theory, and Computing.
2. Culberson, J., and Schaeffer, J. 1998. Pattern databases. Computational Intelligence 14(3):318-334.
3. Dijkstra, E. 1959. A note on two problems in connexion with graphs. Numerische Mathematik 1:269-271.
4. Dunkel, O. 1941. Editorial noe concerning advanced problem 3918. American Mathematical Monthly 48:219.
5. Feiner, A.; Meshulam, R.; Holte, R.; and Korf, R. 2004. Compressing pattern databases. In Proceedings of the National Conference on Artificial Intelligence (AAAI-04), 1184-1189.
6. Frame, J. 1941. Solution to advanced problem 3918. American Mathematical Monthly 48:216-217.
7. Garcia-Molina, H.; Ullman, J. D.; and Widom, J. 2000. Database System Implementation. Upper Saddle River, N.J.: Prentice-Hall.
8. 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.
9. Hinz, A. M. 1999. The tower of hanoi. In Algebras and Combinatorics: Proceedings of ICAC'97, 277-289. Hong Kong: Springer-Verlag.
10. Katriel, I., and Meyer, U. 2003. Elementary graph algorithms in external memory. In Algorithms for Memory Hierarchies, LNCS 2625. Springer-Verlag. 62-84.
11. 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.
12. Korf, R. 1985. Depth-first iterative-deepening: An optimal admissible tree search. Artificial Intelligence 27(1):97-109.
13. Korf, R. 1999. Divide-and-conquer bidirectional search: First results. In Proceedings of the International Joint Conference on Artificial Intelligence (IJCAI-99), 1184-1189.
14. Korf, R. 2003a. Breadth-first frontier search with delayed duplicate detection. In Proceedings of the IJCAI03 Workshop on Model Checking and Artificial Intelligence, 87-92.
15. Korf, R. 2003b. Delayed duplicate detection: Extended abstract. In Proceedings of the International Joint Conference on Artificial Intelligence (IJCAI-03), 1539-1541.
16. Roscoe, A. 1994. Model-checking csp. In Roscoe, A., ed., A Classical Mind, Essays in Honour of CAR Hoare. Prentice-Hall.
17. Schofield, P. 1967. Complete solution of the eight puzzle. In Meltzer, B., and Michie, D., eds., Machine Intelligence 3. New York: American Elsevier. 125-133.
18. Stern, U., and Dill, D. 1998. Using magnetic disk instead of main memory in the mur(phi) verifier. In Proceedings of the 10th International Conference on Computer-Aided Verification, 172-183.
19. Stewart, B. 1941. Solution to advanced problem 3918. American Mathematical Monthly 48:217-219.
20. Zhou, R., and Hansen, E. 2003. Sparse-memory graph search. In Proceedings of the International Joint Conference on Artificial Intelligence (IJCAI-03), 1259-1266.