Direction-Optimizing Breadth-First Search with External Memory Storage
暂无分享,去创建一个
[1] Marco Aiello,et al. AAAI Conference on Artificial Intelligence , 2011, AAAI Conference on Artificial Intelligence.
[2] Richard E. Korf,et al. Recent Progress in Heuristic Search: A Case Study of the Four-Peg Towers of Hanoi Problem , 2007, IJCAI.
[3] Richard E. Korf. Minimizing Disk I/O in Two-Bit Breadth-First Search , 2008, AAAI.
[4] Christian Borgelt,et al. Computational Intelligence , 2016, Texts in Computer Science.
[5] Frank Ruskey,et al. Ranking and unranking permutations in linear time , 2001, Inf. Process. Lett..
[6] Richard E. Korf,et al. Time complexity of iterative-deepening-A* , 2001, Artif. Intell..
[7] Mark H. M. Winands,et al. Best Reply Search for Multiplayer Games , 2011, IEEE Transactions on Computational Intelligence and AI in Games.
[8] Richard E. Korf,et al. Best-First Frontier Search with Delayed Duplicate Detection , 2004, AAAI.
[9] Jose M. Such,et al. International Joint Conference on Artificial Intelligence (IJCAI) , 2016 .
[10] David A. Patterson,et al. Direction-optimizing Breadth-First Search , 2012, 2012 International Conference for High Performance Computing, Networking, Storage and Analysis.
[11] J. van Leeuwen,et al. Computers and Games , 1999, Lecture Notes in Computer Science.
[12] Graham Kendall,et al. Editorial: IEEE Transactions on Computational Intelligence and AI in Games , 2015, IEEE Trans. Comput. Intell. AI Games.