Akihiro Kishimoto
Akihiro Kishimoto
IBM Research, Tokyo
Email verificata su is.titech.ac.jp
Titolo
Citata da
Citata da
Anno
Checkers is solved
J Schaeffer, N Burch, Y Björnsson, A Kishimoto, M Müller, R Lake, P Lu, ...
science 317 (5844), 1518-1522, 2007
5542007
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
952015
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
922009
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
802005
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
672014
Simultaneously searching with multiple settings: An alternative to parameter tuning for suboptimal single-agent search algorithms
RA Valenzano, N Sturtevant, J Schaeffer, K Buro, A Kishimoto
Twentieth International Conference on Automated Planning and Scheduling, 2010
602010
Evaluation of a simple, scalable, parallel best-first search strategy
A Kishimoto, A Fukunaga, A Botea
Artificial Intelligence 195, 222-248, 2013
532013
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
512012
A general solution to the graph history interaction problem
A Kishimoto, M Müller
AAAI 4, 644-649, 2004
462004
On the complexity of quantum circuit compilation
A Botea, A Kishimoto, R Marinescu
Eleventh annual symposium on combinatorial search, 2018
452018
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), 2011
452011
Scalable distributed monte-carlo tree search
K Yoshizoe, A Kishimoto, T Kaneko, H Yoshimoto, Y Ishikawa
Fourth Annual Symposium on Combinatorial Search, 2011
452011
Df-pn in Go: An application to the one-eye problem
A Kishimoto, M Müller
Advances in computer games, 125-141, 2004
452004
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
412010
Correct and efficient search algorithms in the presence of repetitions.
A Kishimoto
402005
Search versus knowledge for solving life and death problems in Go
A Kishimoto, M Müller
AAAI, 1374-1379, 2005
372005
Lambda Depth-First Proof Number Search and Its Application to Go.
K Yoshizoe, A Kishimoto, M Müller
IJCAI, 2404-2409, 2007
352007
Monte Carlo Go has a way to go
H Yoshimoto, K Yoshizoe, T Kaneko, A Kishimoto, K Taura
AAAI 6, 1070-1075, 2006
312006
Distributed game-tree search using transposition table driven work scheduling
A Kishimoto, J Schaeffer
Proceedings International Conference on Parallel Processing, 323-330, 2002
262002
A solution to the GHI problem for depth-first proof-number search
A Kishimoto, M Müller
Information Sciences 175 (4), 296-314, 2005
232005
Il sistema al momento non può eseguire l'operazione. Riprova più tardi.
Articoli 1–20