Minimizing disk I/O in two-bit breadth-first search

Proceedings of the National Conference on Artificial Intelligence

Volumn 1, Issue , 2008, Pages 317-324

  Korf, Richard E ^a  

^a University of California   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ITS DATUMS; MAGNETIC DISKS; PANCAKE PROBLEMS; PROBLEM SPACES; SEARCH ALGORITHMS; SUB SPACES;

BIONICS; DISKS (STRUCTURAL COMPONENTS); LEARNING ALGORITHMS;

ARTIFICIAL INTELLIGENCE;

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

References (13)

1. Cohen, D., and Blum, M. 1992. Improved bounds for sorting pancakes under a conjecture. Manuscript, Computer Science Division, University of California, Berkeley.
2. Culberson, J., and Schaeffer, J. 1998. Pattern databases. Computational Intelligence 14(3):318-334.
3. Dweighter, H. 1975. Elementary problem e2569. American Mathematical Monthly 82(10):1010.
4. Felner, A.; Korf, R.; Meshulam, R.; and Holte, R. 2007. Compressing pattern databases. JAIR 30:213-247.
5. Garey, M.; Johnson, D.; and Lin, S. 1977. Comments on elementary problem e2569. American Mathematical Monthly 84(4):296.
6. Gates, W., and Papadimitriou, C. 1979. Bounds for sorting by prefix reversal. Discrete Mathematics 27:47-57.
7. Heydari, M., and Sudborough, I. 1997. On the diameter of the pancake network. Journal of Algorithms 25:67-94.
8. Korf, R., and Felner, A. 2007. Recent progress in heuristic search: A case study of the four-peg towers of hanoi problem. In IJCAI-07, 2334-2329.
9. Korf, R., and Shultze, P. 2005. Large-scale, parallel breadth-first search. In AAAI-05, 1380-1385.
10. Korf, R.; Zhang, W.; Thayer, I.; and Hohwald, H. 2005. Frontier search. J.A.C.M. 52(5):715-748.
11. Korf, R. 2003. Delayed duplicate detection: Extended abstract. In IJCAI-03, 1539-1541.
12. Kunkle, D., and Cooperman, G. 2007. Twenty-six moves suffice for rubik's cube. In Proceedings of the International Symposium on Symbolic and Algebraic Computation (ISAC-07), 235-242.
13. Robinson, E.; Kunkle, D.; and Cooperman, G. 2007. A comparative analysis of parallel disk-based methods for enumerating implicit graphs. In Proceedings of the 2007 International Workshop on Parallel Symbolic Computation (PASCO-07), 78-87.