Compressed pattern databases

Journal of Artificial Intelligence Research

Volumn 30, Issue , 2007, Pages 213-247

  Felner, Ariel ^a   Korf, Richard E ^b   Meshulam, Ram ^c   Holte, Robert ^d  

^a BEN GURION UNIVERSITY OF THE NEGEV   (Israel)

^b University of California   (United States)

^c BAR ILAN UNIVERSITY   (Israel)

^d UNIVERSITY OF ALBERTA   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

COMBINATORIAL MATHEMATICS; DATA COMPRESSION; DATA STORAGE EQUIPMENT; HEURISTIC METHODS; PROBLEM SOLVING;

COMBINATORIAL PROBLEMS; HEURISTIC FUNCTIONS;

DATABASE SYSTEMS;

EID: 38349109599     PISSN: None     EISSN: 10769757     Source Type: Journal    
DOI: 10.1613/jair.2241     Document Type: Article

References (36)

1. Bloom, B. H. (1970). Space/time trade-offs in hash coding with allowable errors. Communications of the ACM, 13(3), 422-426.
2. Chen, T., & Skiena, S. (1996). Sorting with fixed-length reversals. Discrete Applied Mathematics, 71(1-3), 269-295.
3. Culberson, J. C., & Schaeffer, J. (1998). Pattern databases. Computational Intelligence, 14(3), 318-334.
4. Dunkel, O. (1941). Editorial note concerning advanced problem 3918. American Mathematical Monthly, 48, 219.
5. Dunkel, O. (1992). Symbolic boolean manipulation with ordered binary decision diagrams. ACM Computing Surveys, 24(3), 142-170.
6. Edelkamp, S. (2001). Planning with pattern databases. In Proceedings of the 6th European Conference on Planning (ECP-01), pp. 13-34.
7. Edelkamp, S. (2002). Symbolic pattern databases in heuristic search planning. In Proc. International Conference on AI Planning and Scheduling (AIPS), pp. 274-293.
8. Edelkamp, S., & Kissmann, P. (2007). Externalizing the multiple sequence alignment problem with affine gap costs. In German Conference on Artificial Intelligence (KI), LNCS 4467, pp. 444-447.
9. Felner, A., & Adler, A. (2005). Solving the 24-puzzle with instance dependent pattern databases. In Proceedings of SARA-05, pp. 248-260, Edinburgh, Scotland.
10. Felner, A., Korf, R. E., & Hanan, S. (2004a). Additive pattern database heuristics. Journal of Artificial Intelligence Research (JAIR), 22, 279-318.
11. Felner, A., Meshulam, R., Holte, R., & Korf, R. (2004b). Compressing pattern databases. In Proceedings of the Nineteenth National Conference on Artificial Intelligence (AAAI-04), pp. 638-643.
12. Felner, A., Zahavi, U., Holte, R., & Schaeffer, J. (2005). Dual lookups in pattern databases. In Proceedings of the Nineteenth International Joint Conference on Artificial Intelligence (IJCAI-05), pp. 103-108.
13. Frame, J. S. (1941). Solution to advanced problem 3918. American Mathematical Monthly, 48, 216-217.
14. Hansson, O., Mayer, A., & Yung, M. (1992). Criticizing solutions to relaxed models yields powerful admissible heuristics. Information Sciences, 63(3), 207-227.
15. Hart, P. E., Nilsson, N. J., & Raphael, B. (1968). A formal basis for the heuristic determination of minimum cost paths. IEEE Transactions on Systems Science and Cybernetics, SCC-4(2), 100-107.
16. Hinz, A. M. (1997). The tower of Hanoi. In Algebras and Combinatorics: Proceedings of ICAC'97, pp. 277-289, Hong Kong. Springer-Verlag.
17. Holte, R. C., Felner, A., Newton, J., Meshulam, R., & Furcy, D. (2006). Maximizing over multiple pattern databases speeds up heuristic search. Artificial Intelligence, 170, 1123-1136.
18. Korf, R. E. (1985). Depth-first iterative-deepening: An optimal admissible tree search. Artificial Intelligence, 27(1), 97-109.
19. Korf, R. E. (1997). Finding optimal solutions to Rubik's Cube using pattern databases. In Proceedings of the Fourteenth National Conference on Artificial Intelligence (AAAI-97), pp. 700-705.
20. Korf, R. E. (2003). Delayed duplicate detection: Extended abstract. In Proceedings of the 18th International Joint Conference on Artificial Intelligence (IJCAI-03), pp. 1539-1541, Acapulco, Mexico.
21. Korf, R. E. (2004). Best-first frontier search with delayed duplicate detection. In Proceedings of the 19th National Conference on Artificial Intelligence (AAAI-2004), pp. 650-657, San Jose, CA.
22. Korf, R. E., & Felner, A. (2002). Disjoint pattern database heuristics. Artificial Intelligence, 134, 9-22.
23. Korf, R. E., & Felner, A. (2007). Recent progress in heuristic search: A case study of the four-peg towers of hanoi problem. In Proceedings of the 20th International Joint Conference on Artificial Intelligence (IJCAI-07), pp. 2324-2329.
24. Korf, R. E., & Shultze, P. (2005). Large-scale, parallel breadth-first search. In Proceedings of the 20th National Conference on Artificial Intelligence (AAAI-2005), pp. 1380-1385, Pittsburgh, PA.
25. Korf, R. E., Zhang, W., Thayer, I., & Hohwald, H. (2005). Frontier search. Journal of the Association for Computing Machinery (JACM), 52(5), 715-748.
26. McNoughtton, M., Lu, P., Schaeffer, J., & Szafron, D. (2002). Memory efficient A* heuristics for multiple sequence alignment. In Proceedings of the Eighteenth National Conference on Artificial Intelligence (AAAI-02), pp. 737-743.
27. Mero, L. (1984). A heuristic search algorithm with modifiable estimate. Artificial Intelligence, 23, 13-27.
28. Munagala, K., & Ranade, A. (1999). I/o complexity of graph algorithms. In Proceedings of the 10th Annual Symposium on Discrete Algorithms, pp. 687-694. ACM-SIAM.
29. Myrvold, W., & Ruskey, F. (2001). Ranking and unranking permutations in linear time. Information Processing Letters, 79, 281-284.
30. Schroedl, S. (2005). An improved search algorithm for optimal multiple-sequence alignment. Journal of Artificial Intelligence Research (JAIR), 23, 587-623.
31. Stern, U., & Dill., D. L. (1995). Improved probabilistic verification by hash compaction. In Advanced Research Working Conference on Correct Hardware Design and Verification Methods, pp. 206-240.
32. Stewart, B. (1941). Solution to advanced problem 3918. American Mathematical Monthly, 48, 217-219.
33. Zahavi, U., Felner, A., Holte, R., & Schaeffer, J. (2006). Dual search in permutation state spaces. In Proceedings of the Twenty First National Conference on Artificial Intelligence (AAAI-06), pp. 1076-1081.
34. Zahavi, U., Felner, A., Schaeffer, J., & Sturtevant, N. (2007). Inconsistent heurstics. In Proceedings of the Twenty Second National Conference on Artificial Intelligence (AAAI-07). To appear.
35. Zhou, R., & Hansen, E. (2004). Space-efficient memory-based heuristics. In Proceedings of the Nineteenth National Conference on Artificial Intelligence (AAAI-04), pp. 677-682.
36. Zhou, R., & Hansen, E. (2006). Breadth-first heuristic search. Artificial Intelligence, 170(45), 385-408.