Additive pattern database heuristics

Journal of Artificial Intelligence Research

Volumn 22, Issue , 2004, Pages 279-318

  Feiner, Ariel ^a   Korf, Richard E ^b   Hanan, Sarit ^c  

^a BEN GURION UNIVERSITY OF THE NEGEV   (Israel)

^b Engineering IV   (United States)

^c BAR ILAN UNIVERSITY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

FUNCTIONS; HEURISTIC METHODS; PROBLEM SOLVING;

ADDITIVE PATTERN DATABASE HEURISTICS; DYNAMICALLY PARTITIONED PATTERN DATABASES; HANOI PROBLEM; PATTERN DATABASES;

DATABASE SYSTEMS;

EID: 26944481300     PISSN: 10769757     EISSN: 10769757     Source Type: Journal    
DOI: 10.1613/jair.1480     Document Type: Review

References (31)

1. Balasubramanian, R., Fellows, M. R., & Raman, V. (1998). An improved fixed-parameter algorithm for vertex cover. Information Processing Letters, 65(3), 163-168.
2. Bode, J.-P., & Hinz, A. (1999). Results and open problems on the Tower of Hanoi. In Proceedings of the Thirtieth Southeastern International Conference on Combinatorics, Graph Theory, and Computing, Boca Raton, FL.
3. Chen, J., Kanj, I., & Jia, W. (2001). Vertex cover: further observations and further improvements. Journal of Algorithms, 41, 280-301.
4. Culberson, J., & Schaeffer, J. (1998). Pattern databases. Computational Intelligence, 14(3), 318-334.
5. Downey, R. G., & Fellows, M. R. (1995). Parameterized computational feasibility. P. Clote, J. Remmel (Eds.), Feasible Mathematics, 2, 219-244.
6. Downey, R. G., Fellows, M. R., & Stege, U. (1999). Parameterized complexity: A framework for systematically conforting computational intractability. DIMACS Series in Discrete Mathematics and Theoretical Computer Science, 49.
7. Dunkel, O. (1941). Editorial note concerning advanced problem 3918. American Mathematical Monthly, 48, 219.
8. Felner, A. (2001). Improving search techniques and using them on different environments. Ph.D. thesis, Department of Computer Science, Bar-Ilan University, Ramat-Gan, Israel, available at http://www.ise.bgu.ac.il/faculty/ felner.
9. Felner, A., Meshulam, R., Holte, R., & Korf, R. (2004). Compressing pattern databases. In Proceedings of the Nineteenth National Conference on Artificial Intelligence (AAAI-04), pp. 638-643.
10. Frame, J. (1941). Solution to advanced problem 3918. American Mathematical Monthly, 48, 216-217.
11. Garey, M., & Johnson, D. (1979). Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman, New York.
12. Gasser, R. (1995). Harnessing computational resources for efficient exhastive search. Ph.D. thesis, Swiss Federal Institute of Technology, Zurich, Switzerland.
13. Hansson, O., Mayer, A., & Yung, M. (1992). Criticizing solutions to relaxed models yields powerful admissible heuristics. Information Sciences, 63(3), 207-227.
14. Hart, P., Nilsson, N. J., & Raphael, B. (1968). A formal basis for the heuristic determination of minimum cost paths. IEEE Transactions on Systems Science and Cybernetics, 4, 100-107.
15. Hinz, A. M. (1997). The tower of Hanoi. In Algebras and Combinatorics: Proceedings of ICAC'97, pp. 277-289, Hong Kong. Springer-Verlag.
16. Karp, R. (1972). Reducibility among combinatorial problems. In R. E. Miller and J.W. Thatcher (eds.), Complexity of Computer Computations, pp. 85-103, Plenum Press, New York.
17. Korf, R. E. (1985a). Depth-first iterative-deepening: An optimal admissible tree search. Artificial Intelligence, 27(1), 97-109.
18. Korf, R. E. (1985b). Macro-operators: A weak method for learning. Artificial Intelligence, 26(1), 35-77.
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, Providence, RI.
20. Korf, R. E. (1999). Divide-and-conquer bidirectional search: First results. In Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence (IJCAI-99), pp. 1184-1189, Stockholm, Sweden.
21. Korf, R. E. (2004). Best-first frontier search with delayed duplicate detection. In Proceedings of the Nineteenth National Conference on Artificial Intelligence (AAAI-04), pp. 650-657, San Jose, CA.
22. Korf, R. E., & Felner, A. (2002). Disjoint pattern database heuristics. Artificial Intelligence, 134(1-2), 9-22.
23. Korf, R. E., Reid, M., & Edelkamp, S. (2001). Time complexity of iterative-deepening-A*. Artificial Intelligence, 129(1-2), 199-218.
24. Korf, R. E., & Taylor, L. (1996). Finding optimal solutions to the twenty-four puzzle. In Proceedings of the Thirteenth National Conference on Artificial Intelligence (AAAI-96), pp. 1202-1207, Portland, OR.
25. Korf, R. E., & Zhang, W. (2000). Divide-and-conquer frontier search applied to optimal sequence alignment. In Proceedings of the Sixteenth National Conference on Artificial Intelligence (AAAI-2000), pp. 910-916, Austin, TX.
26. Marzetta, A. (1998). ZRAM: a library of parallel search algorithms and its use in enumeration and combinatorial optimization. Ph.D. thesis, Swiss Federal Institute of Technology, Zurich, Switzerland.
27. Niedermeier, R., & Rossmanith, P. (1999). Upper bounds for vertex cover further improved. Lecture Notes in Computer Science, 1563, 561-570.
28. Papadimitriou, C., & Steiglitz, K. (1982). Combinatorial Optimization: Algorithms and Complexity. Prentice-Hall, Englewood Cliffs, N.J.
29. Pearl, J. (1984). Heuristics. Addison Wesley, Reading Mass.
30. Stewart, B. (1941). Solution to advanced problem 3918. American Mathematical Monthly, 48, 217-219.
31. van de Liefvoort, A. (1992). An iterative algorithm for the Reve's puzzle. The Computer Journal, 35(1), 91-92.