Dual search in permutation state spaces

Proceedings of the National Conference on Artificial Intelligence

Volumn 2, Issue , 2006, Pages 1076-1081

  Zahavi, Uzi ^a   Feiner, Ariel ^b   Holte, Robert ^c   Schaeffer, Jonathan ^c  

^a BAR ILAN UNIVERSITY   (Israel)

^b BEN GURION UNIVERSITY OF THE NEGEV   (Israel)

^c UNIVERSITY OF ALBERTA   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTATIONAL GEOMETRY; DECISION THEORY; LEARNING ALGORITHMS;

PERMUTATION STATE SPACES; SEARCH ALGORITHMS;

STATE SPACE METHODS;

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

References (9)

1. Culberson, J. C., and Schaeffer, J. 1998. Pattern databases. Computational Intelligence 14(3):318-334.
2. Dweighter, H. 1975. Problem e2569. American Mathematical Monthly 82:1010.
3. Edelkamp, S. 2001. Planning with pattern databases. Proc, ECP-01 13-34.
4. Felner, A.; Meshulam, R.; Holte, R.; and Korf, R. 2004. Compressing pattern databases. In Proc. AAAI-04, 638-643.
5. Felner, A.; Zahavi, U.; Holte, R.; and Schaeffer, J. 2005. Dual lookups in pattern databases. In IJCAI-05, 103-108.
6. Kaindl, H., and Kainz, G. 1997. Bidirectional heuristic search reconsidered. JAIR 7:283-317.
7. Korf, R. E., and Felner, A. 2002. Disjoint pattern database heuristics. Artificial Intelligence 134:9-22.
8. Korf, R. E. 1997. Finding optimal solutions to Rubik's Cube using pattern databases. In Proc. AAAI-97, 700-705.
9. Zhou, R., and Hansen, E. 2004. Space-efficient memory-based heuristics. In Proc. AAAI-04, 677-682.