Compressing pattern databases with learning

Frontiers in Artificial Intelligence and Applications

Volumn 178, Issue , 2008, Pages 495-499

  Samadi, Mehdi ^a   Siabani, Maryam ^b   Felner, Ariel ^c   Holte, Robert ^a  

^a UNIVERSITY OF ALBERTA   (Canada)

^b ISFAHAN UNIVERSITY OF TECHNOLOGY   (Iran)

^c BEN GURION UNIVERSITY OF THE NEGEV   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

DECISION TREES; HEURISTIC ALGORITHMS;

HEURISTIC FUNCTIONS; LEARNING TECHNIQUES; NEURAL-NETWORKS; OPTIMAL SOLUTIONS; PATTERN DATABASE; SEARCH EFFORTS; SLIDING-TILE PUZZLES; SUB-PROBLEMS;

TABLE LOOKUP;

EID: 79957870304     PISSN: 09226389     EISSN: 18798314     Source Type: Book Series    
DOI: 10.3233/978-1-58603-891-5-495     Document Type: Conference Paper

References (10)

1. S. Edelkamp, ‘Symbolic pattern databases in heuristic search planning’, AIPS, 274–293, (2002).
2. M. Ernandes and M. Gori, ‘Likely-admissible and sub-symbolic heuristics.’, in ECAI, pp. 613–617, (2004).
3. A. Felner, R. Korf, R. Meshulam, and R. Holte, ‘Compressed pattern databases’, JAIR, 30, 213–247, (2007).
4. A. Felner, R. E. Korf, and S. Hanan, ‘Additive pattern database heuristics’, JAIR, 22, 279–318, (2004).
5. A. Felner, U. Zahavi, R. Holte, and J. Schaeffer, ‘Dual lookups in pattern databases’, in Proc. IJCAI, pp. 103–108, (2005).
6. R. C. Holte, A. Felner, J. Newton, R. Meshulam, and D. Furcy, ‘Maximizing over multiple pattern databases speeds up heuristic search’, Artificial Intelligence, 170, 1123–1136, (2006).
7. J. S. Judd, Neural network design and the complexity of learning, MIT Press, Cambridge, MA, USA, 1990.
8. T. Mitchell, ‘Machine learning and data mining’, Communications of the ACM, 42(11), 30–36, (1999).
9. George Politowski, On the construction of heuristic functions, Ph.D. dissertation, University of California at Santa Cruz, 1986.
10. S. Sarkar, P. Chakrabarti, and S. Ghose, ‘A framework for learning in search-based systems’, IEEE Transactions on Knowledge and Data Engineering, 10(4), 563–575, (1998).