Delayed duplicate detection: Extended abstract

IJCAI International Joint Conference on Artificial Intelligence

Volumn , Issue , 2003, Pages 1539-1541

  Korf, Richard E ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BEST FIRST SEARCH; BREADTH-FIRST SEARCH; CACHE PERFORMANCE; COMPLETE SEARCH; DELAYED DUPLICATE DETECTION; EXTENDED ABSTRACTS; SLIDING-TILE PUZZLES; TOWERS OF HANOI;

ARTIFICIAL INTELLIGENCE;

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

References (11)

1. Dijkstra, E. 1959. A note on two problems in connexion with graphs. Numerische Mathematik 1:269-271.
2. Garcia-Molina, H.; Ullman, J. D.; and Widom, J. 2000. Database System Implementation. Upper Saddle River, N.J.: Prentice-Hall.
3. Hart, P.; Nilsson, N.; and Raphael, B. 1968. A formal basis for the heuristic determination of minimum cost paths. IEEE Trans. Systems Science and Cybernetics SSC-4(2):100-107.
4. 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.
5. Korf, R. 1985. Depth-first iterative-deepening: An optimal admissible tree search. Artificial Intelligence 27(1):97-109. (Pubitemid 15604803)
6. Korf, R. 1999. Divide-and-conquer bidirectional search: First results. In Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence (IJCAI-99), 1184-1189.
7. Korf, R. 2003. Delayed duplicate detection: initial results. In Proceedings of the IJCAI-03 Workshop on Model Checking and Artificial Intelligence.
8. 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.
9. Szegedy, M. 1999. In how many steps the k peg version of the towers of hanoi game can be solved? In Proceedings of the 16th Annual Symposium on Theoretical Aspects of Computer Science (STACS '99), LNCS 1563. Trier, Germany: Springer-Vcrlag.
10. Taylor, L., and Korf, R. 1993. Pruning duplicate nodes in depth-first search. In Proceedings of the National Conference on Artificial Intelligence (AAAI-93), 756-761.
11. van de Liefvoort, A. 1992. An iterative algorithm for the reve's puzzle. The Computer Journal 35(I):91-92.