1.6-bit pattern databases

International Symposium on Combinatorial Search, SoCS 2009

Volumn , Issue , 2009, Pages

  Breyer, Teresa M ^a   Korf, Richard E ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPACT REPRESENTATION; COMPRESSION METHODS; COMPRESSION TECHNIQUES; LOSSY COMPRESSIONS; PATTERN DATABASE; RUBIK'S CUBES; STATE OF THE ART; TOWERS OF HANOI;

GEOMETRY;

DATABASE SYSTEMS;

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

References (25)

1. Ball, M., and Holte, R. C. 2008. The compression power of symbolic pattern databases. In ICAPS-08, 2-11.
2. Chen, T., and Skiena, S. S. 1996. Sorting with fixed-length reversals. Discrete Applied Mathematics 71:269-295.
3. Cooperman, G., and Finkelstein, L. 1992. New methods for using cayley graphs in interconnection networks. Discrete Applied Mathematics 37:95-118.
4. Culberson, J. C., and Schaeffer, J. 1998. Pattern databases. Computational Intelligence 14(3):318-334.
5. Edelkamp, S. 2002. Symbolic pattern databases in heuristic search planning. In AIPS-02, 274-283.
6. Felner, A.; Zahavi, U.; Schaeffer, J.; and Holte, R. C. 2005. Dual lookups in pattern databases. In IJCAI-05, 103-108.
7. Felner, A.; Korf, R. E.; Meshulam, R.; and Holte, R. C. 2007. Compressed pattern databases. JAIR 30:213-247.
8. Frame, J. S. 1941. Solution to advanced problem 3918. American Mathematical Monthly 48:216-217.
9. 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 4(2):100-107.
10. Hohwald, H.; Thayer, I.; and Korf, R. E. 2003. Comparing best-first search and dynamic programming for optimal multiple sequence alignment. In IJCAI-03, 1239-1245.
11. Holte, R. C.; Felner, A.; Newton, J.; Meshulam, R.; and Furcy, D. 2006. Maximizing over multiple pattern databases speeds up heuristic search. Artif. Intell. 170(16-17):1123-1136.
12. Korf, R. E., and Felner, A. 2002. Disjoint pattern database heuristics. Artif. Intell. 134(1-2):9-22.
13. Korf, R. E., and Felner, A. 2007. Recent progress in heuristic search: A case study of the four-peg Towers of Hanoi problem. In IJCAI-07, 2324-2329.
14. Korf, R. E., and Schultze, P. 2005. Large-scale parallel breadth-first search. In AAAI-05, 1380-1385.
15. Korf, R. E.; Zhang, W.; Thayer, I.; and Hohwald, H. 2005. Frontier search. J. ACM 52(5):715-748.
16. Korf, R. E. 1985. Iterative-deepening-A*: An optimal admissible tree search. In IJCAI-85, 1034-1036.
17. Korf, R. E. 1997. Finding optimal solutions to rubik's cube using pattern databases. In AAAI-97, 700-705.
18. Samadi, M.; Siabani, M.; Felner, A.; and Holte, R. 2008. Compressing pattern databases with learning. In ECAI-08, 495-499.
19. Stewart, B. 1941. Solution to advanced problem 3918. American Mathematical Monthly 48:217-219.
20. Yang, F.; Holte, R. C.; Culberson, J.; Zahavi, U.; and Felner, A. 2008. A general theory of additive state space abstractions. JAIR 32:631-662.
21. Zahavi, U.; Felner, A.; Schaeffer, J.; and Sturtevant, N. R. 2007. Inconsistent heuristics. In AAAI-07, 1211-1216.
22. Zahavi, U.; Felner, A.; Holte, R. C.; and Schaeffer, J. 2008. Duality in permutation state spaces and the dual search algorithm. Artif. Intell. 172(4-5):514-540.
23. Zhou, R., and Hansen, E. A. 2003. Sweep A*: Space efficient heuristic search in partially ordered graphs. In ICTAI-03, 427-434.
24. Zhou, R., and Hansen, E. A. 2005. External-memory pattern databases using structured duplicate detection. In AAAI-05, 1398-1405.
25. Zhou, R., and Hansen, E. A. 2006. Breadth-first heuristic search. Artif. Intell. 170(4):385-408.