Compressing pattern databases

Proceedings of the National Conference on Artificial Intelligence

Volumn , Issue , 2004, Pages 638-643

  Feiner, Ariel ^a   Meshulam, Ram ^a   Holte, Robert C ^b   Korf, Richard E ^c  

^a BAR ILAN UNIVERSITY   (Israel)

^b UNIVERSITY OF ALBERTA   (Canada)

^c Engineering IV   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COST FUNCTIONS; PATTERN DATABASES (PDB); PATTERN SPACES; SUBPROBLEMS;

ALGORITHMS; COSTS; DATABASE SYSTEMS; FUNCTIONS; HEURISTIC METHODS; TABLE LOOKUP;

DATA COMPRESSION;

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

References (8)

1. Hinz, A. 1997. The Tower of Hanoi, Algebras and Combinatorics: Proceedings of ICAC'97. 277-289
2. Culberson, J. C., and Schaeffer, J. 1998. Pattern databases. Computational Intelligence 14(3):318-334.
3. Hemádvölgyi, I. T., and Holte, R. C. 2000. Experiments with automatically created memory-based heuristics. Proc. SARA-2000, Lecture Notes in Artificial Intelligence 1864:281-290.
4. Holte, R.; Newton, J.; Feiner, A.; Meshulam R.; and Furcy, D. 2004. Multiple pattern databases. Proc. ICAPS-04
5. Korf, R. E., and Felner, A. 2002. Disjoint pattern database heuristics. Artificial Intelligence 134:9-22.
6. Korf, R., and Zhang, W. 2000. Divide-and-conquer frontier search applied to optimal sequence alignment, Proc. AAAI-2000, 910-916.
7. Korf, R. E. 1997. Finding optimal solutions to Rubik's Cube using pattern databases. Proc. AAAI-97, 700-705.
8. Korf, R. E. 2004. Best-first frontier search with delayed duplicate detection Proc. AAAI04, San-Jose, Ca.