Research challenges in combinatorial search

Proceedings of the National Conference on Artificial Intelligence

Volumn 3, Issue , 2012, Pages 2129-2133

  Korf, Richard E ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMBINATORIAL SEARCH; COMPUTING HARDWARE; EXTERNAL MEMORY; HEURISTIC SEARCH ALGORITHMS; HIDDEN INFORMATION; MULTI-CORE PROCESSOR; PROBLEM DOMAIN; RESEARCH CHALLENGES; SEARCH TECHNIQUE; SINGLE-AGENT; TIME COMPLEXITY;

HEURISTIC ALGORITHMS;

ARTIFICIAL INTELLIGENCE;

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

References (20)

1. Brungger, A.; Marzetta, A.; Fukuda, K.; and Nievergelt, J. 1999. The parallel search bench ZRAM and its applications. Annals of Operations Research 90:45-63.
2. Campbell, M.; Hoane, A.; and Hsu, F. 2002. Deep blue. Artificial Intelligence 134(1-2):57-83.
3. Culberson, J., and Schaeffer, J. 1998. Pattern databases. Computational Intelligence 14(3):318-334.
4. Dweighter, H. 1975. Elementary problem e2569. American Mathematical Monthly 82(10):1010.
5. Hart, P. E.; Nilsson, N. J.; and Raphael, B. 1968. A formal basis for the heuristic determination of minimum cost paths. IEEE Transactions on Systems Science and Cybernetics SSC-4(2):100-107.
6. Helmert, M. 2010. Landmark heuristics for the pancake problem. In Proceedings of the Symposium on Combinatorial Search (SOCS-10).
7. Korf, R. E., and Felner, A. 2002. Disjoint pattern database heuristics. Artificial Intelligence 134(1-2):9-22.
8. Korf, R. E., and Schultze, P. 2005. Large-scale, parallel breadth-first search. In Proceedings of the 20th National Conference on Artificial Intelligence (AAAI-2005), 1380-1385.
9. Korf, R. E.; Reid, M.; and Edelkamp, S. 2001. Time complexity of Iterative-Deepening-A*. Artificial Intelligence 129(1-2):199-218.
10. Korf, R. E. 1985. Depth-first iterative-deepening: An optimal admissible tree search. Artificial Intelligence 27(1):97-109.
11. Korf, R. E. 1997. Finding optimal solutions to Rubik's cube using pattern databases. In Proceedings of the 14th National Conference on Artificial Intelligence (AAAI-97), 700-705.
12. Korf, R. E. 2008. Linear-time disk-based implicit graph search. Journal of the Association for Computing Machinery 55(6):26-1 to 26-40.
13. Korf, R. E. 2011. A hybrid recursive multi-way number partitioning algorithm. In Proceeding of the 22nd International Joint Conference on Artificial Intelligence ((IJCAI-11), 591-596.
14. Pearl, J. 1984. Heuristics. Reading, MA: Addison-Wesley.
15. Pohl, I. 1973. The avoidance of (relative) catastrophe, heuristic competence, genuine dynamic weighting and computational issues in heuristic problem solving. In Proceedings of the Third International Joint Conference of Artificial Intelligence (IJCAI-73), 12-17.
16. Rokicki, T.; Kociemba, H.; Davidson, M.; and Dethridge, J. 2010. Brute-forcing rubik's cube: God's number is 20. http://tomas.rokicki.com/ rubik20.pdf.
17. Schaeffer, J.; Culberson, J.; Treloar, N.; Knight, B.; Lu, P.; and Szafron, D. 2007. Checkers is solved. Science 317(5844):1518-1522.
18. Schofield, P. 1967. Complete solution of the eight puzzle. In Meltzer, B., and Michie, D., eds., Machine Intelligence 3. New York: American Elsevier. 125-133.
19. Zahavi, U.; Felner, A.; Burch, N.; and Holte, R. C. 2010. Predicting the performance of ida* using conditional dependencies. Journal of Artificial Intelligence Research (JAIR) 37:41-83.
20. Zhou, R., and Hansen, E. A. 2004. Structured duplicate detection in external-memory graph search. In Proceedings of the 19th National Conference on Artificial Intelligence (AAAI-2004), 683-688.