Checkers is solved J Schaeffer, N Burch, Y Bjornsson, A Kishimoto, M Muller, R Lake, P Lu, ... science 317 (5844), 1518-1522, 2007 | 667 | 2007 |
A Lagrangian decomposition approach for the pump scheduling problem in water networks B Ghaddar, J Naoum-Sawaya, A Kishimoto, N Taheri, B Eck European Journal of Operational Research 241 (2), 490-501, 2015 | 137 | 2015 |
On the complexity of quantum circuit compilation A Botea, A Kishimoto, R Marinescu Proceedings of the International Symposium on Combinatorial Search 9 (1 …, 2018 | 118 | 2018 |
Scalable, parallel best-first search for optimal sequential planning A Kishimoto, A Fukunaga, A Botea Proceedings of the International Conference on Automated Planning and …, 2009 | 101 | 2009 |
Distribution loss minimization with guaranteed error bound T Inoue, K Takano, T Watanabe, J Kawahara, R Yoshinaka, A Kishimoto, ... IEEE Transactions on Smart Grid 5 (1), 102-111, 2014 | 92 | 2014 |
Solving checkers J Schaeffer, Y Björnsson, N Burch, A Kishimoto, R Lake, P Lu, S Sutphen Proceedings of the 19th international joint conference on Artificial …, 2005 | 89 | 2005 |
Game-tree search using proof numbers: The first twenty years A Kishimoto, MHM Winands, M Müller, JT Saito ICGA journal 35 (3), 131-156, 2012 | 67 | 2012 |
Simultaneously searching with multiple settings: An alternative to parameter tuning for suboptimal single-agent search algorithms R Valenzano, N Sturtevant, J Schaeffer, K Buro, A Kishimoto Proceedings of the International Conference on Automated Planning and …, 2010 | 65 | 2010 |
Evaluation of a simple, scalable, parallel best-first search strategy A Kishimoto, A Fukunaga, A Botea Artificial Intelligence 195, 222-248, 2013 | 60 | 2013 |
Incremental search based multi-modal journey planning A Botea, E Daly, A Kishimoto US Patent 11,158,010, 2021 | 59 | 2021 |
A general solution to the graph history interaction problem A Kishimoto, M Müller Proceedings of the 19th national conference on Artifical intelligence, 644-649, 2004 | 57 | 2004 |
Scalable distributed monte-carlo tree search K Yoshizoe, A Kishimoto, T Kaneko, H Yoshimoto, Y Ishikawa Proceedings of the International Symposium on Combinatorial Search 2 (1 …, 2011 | 55 | 2011 |
Depth-first proof-number search with heuristic edge cost and application to chemical synthesis planning A Kishimoto, B Buesser, B Chen, A Botea Advances in Neural Information Processing Systems 32, 2019 | 54 | 2019 |
Evaluating root parallelization in Go Y Soejima, A Kishimoto, O Watanabe IEEE Transactions on Computational Intelligence and AI in Games 2 (4), 278-287, 2010 | 52 | 2010 |
Df-pn in Go: An application to the one-eye problem A Kishimoto, M Müller Advances in Computer Games: Many Games, Many Challenges, 125-141, 2004 | 51 | 2004 |
Lambda Depth-First Proof Number Search and Its Application to Go. K Yoshizoe, A Kishimoto, M Müller IJCAI, 2404-2409, 2007 | 47 | 2007 |
A Novel Technique for Avoiding Plateaus of Greedy Best-First Search in Satisficing Planning T Imai, A Kishimoto Proceedings of the AAAI Conference on Artificial Intelligence 25 (1), 985-991, 2011 | 46 | 2011 |
Search versus knowledge for solving life and death problems in Go A Kishimoto, M Müller AAAI, 1374-1379, 2005 | 46 | 2005 |
Correct and efficient search algorithms in the presence of repetitions A Kishimoto | 43 | 2005 |
Monte Carlo Go has a way to go H Yoshimoto, K Yoshizoe, T Kaneko, A Kishimoto, K Taura AAAI 6, 1070-1075, 2006 | 33 | 2006 |