Difference between revisions of "Akihiro Kishimoto"
GerdIsenberg (talk | contribs) |
GerdIsenberg (talk | contribs) |
||
| Line 8: | Line 8: | ||
=Selected Publications= | =Selected Publications= | ||
| − | <ref>[ | + | <ref>[[ICGA Journal#RefDB|ICGA Reference Database]]</ref> <ref>[https://dblp.org/pers/hd/k/Kishimoto:Akihiro dblp: Akihiro Kishimoto]</ref> |
==1999== | ==1999== | ||
* [[Akihiro Kishimoto]], [[Yoshiyuki Kotani]] ('''1999'''). ''Parallel AND/OR tree search based on proof and disproof numbers''. [[Conferences#GPW|5th Game Programming Workshop]] | * [[Akihiro Kishimoto]], [[Yoshiyuki Kotani]] ('''1999'''). ''Parallel AND/OR tree search based on proof and disproof numbers''. [[Conferences#GPW|5th Game Programming Workshop]] | ||
Latest revision as of 17:20, 16 November 2020
Home * People * Akihiro Kishimoto
Akihiro Kishimoto [1]
Akihiro Kishimoto,
a Japanese computer scientiest, research staff member at IBM Ireland, and before assistant professor at Future University Hakodate. His research interests covers artificial intelligence, graph theory, distributed computing and parallel search. Along with Yasushi Tanase, and at times Ayumu Nagai and Norifumi Gotoh, Akihiro Kishimoto is author of the Shogi program ISshogi, and is further author of the Go playing program Akebono (9x9).
Akihiro Kishimoto was a member of the GAMES group [2] in the Department of Computing Science at the University of Alberta, and worked with Jonathan Schaeffer et al. on solving Checkers [3]. Additionally, he worked with Martin Müller on graph history interaction, proof-number search and computer Go.
Contents
Selected Publications
1999
- Akihiro Kishimoto, Yoshiyuki Kotani (1999). Parallel AND/OR tree search based on proof and disproof numbers. 5th Game Programming Workshop
2000 ...
- Akihiro Kishimoto, Jonathan Schaeffer (2002). Distributed Game-Tree Search Using Transposition Table Driven Work Scheduling. ICPP 2002
- Akihiro Kishimoto, Jonathan Schaeffer (2002). Transposition Table Driven Work Scheduling in Distributed Game-Tree Search. AI 2002, Best Paper Prize, Lecture Notes in Artificial Intelligence, Vol. 2338, Springer
- Akihiro Kishimoto, Martin Müller (2003). Df-pn in Go: An Application to the One-Eye Problem. Advances in Computer Games 10
- Akihiro Kishimoto, Martin Müller (2004). A General Solution to the Graph History Interaction Problem. AAAI National Conference, pdf
2005 ...
- Xiaozhen Niu, Akihiro Kishimoto, Martin Müller (2005). Recognizing Seki in Computer Go. Advances in Computer Games 11
- Akihiro Kishimoto (2005). Correct and Efficient Search Algorithms in the Presence of Repetitions. Ph.D. thesis, University of Alberta, Received the 2005 ChessBase Best-Publication Award, pdf
- Akihiro Kishimoto, Martin Müller (2005). A Solution to the GHI Problem for Depth-First Proof-Number Search. Information Sciences, Vol. 175, pdf » Graph History Interaction
- Jonathan Schaeffer, Yngvi Björnsson, Neil Burch, Akihiro Kishimoto, Martin Müller, Rob Lake, Paul Lu, Steve Sutphen (2005). Solving Checkers. IJCAI 2005
- Haruhiro Yoshimoto, Kazuki Yoshizoe, Tomoyuki Kaneko, Akihiro Kishimoto, Kenjiro Taura (2006). Monte Carlo Go Has a Way to Go. AAAI 2006, pdf
- Kazuki Yoshizoe, Akihiro Kishimoto, Martin Müller. (2007). Lambda Depth-First Proof-Number Search and Its Application to Go. IJCAI 2007, pdf
- Jonathan Schaeffer, Neil Burch, Yngvi Björnsson, Akihiro Kishimoto, Martin Müller, Rob Lake, Paul Lu, Steve Sutphen (2007). Checkers is Solved. Science, Vol. 317, no. 5844
- Akihiro Kishimoto, Martin Müller (2008). About the Completeness of Depth-First Proof-Number Search. CG 2008
- Akihiro Kishimoto, Alex Fukunaga, Adi Botea (2009). Scalable, Parallel Best-First Search for Optimal Sequential Planning. ICAPS-2009 (Best Paper Award)
2010 ...
- Richard Anthony Valenzano, Nathan Sturtevant, Jonathan Schaeffer, Karen Buro, Akihiro Kishimoto (2010). Simultaneously Searching with Multiple Settings: An Alternative to Parameter Tuning for Suboptimal Single-Agent Search Algorithms. ICAPS 2010, pdf
- Kazuki Yoshizoe, Akihiro Kishimoto, Tomoyuki Kaneko, Haruhiro Yoshimoto, Yutaka Ishikawa (2011). Scalable Distributed Monte Carlo Tree Search. SoCS2011, pdf
- Junichi Hashimoto, Akihiro Kishimoto, Kazuki Yoshizoe, Kokolo Ikeda (2011). Accelerated UCT and Its Application to Two-Player Games. Advances in Computer Games 13
- Akihiro Kishimoto, Mark Winands, Martin Müller, Jahn-Takeshi Saito (2012). Game-Tree Search using Proof Numbers: The First Twenty Years. ICGA Journal, Vol. 35, No. 3
- Akihiro Kishimoto, Alex Fukunaga, Adi Botea (2012). Evaluation of a Simple, Scalable, Parallel Best-First Search Strategy. arXiv:1201.3204
- Kunihito Hoki, Tomoyuki Kaneko, Akihiro Kishimoto, Takeshi Ito (2013). Parallel Dovetailing and its Application to Depth-First Proof-Number Search. ICGA Journal, Vol. 36, No. 1 [6]
- Shogo Takeuchi, Jun Kawahara, Akihiro Kishimoto, Shin-ichi Minato (2013). Shared-Memory Parallel Frontier-Based Search. WALCOM 2013
- Akihiro Kishimoto, Alex Fukunaga, Adi Botea (2013). Evaluation of a simple, scalable, parallel best-first search strategy. Artificial Intelligence, Vol. 195
2015 ...
- Akihiro Kishimoto, Radu Marinescu, Adi Botea (2015). Parallel Recursive Best-First AND/OR Search for Exact MAP Inference in Graphical Models. NIPS 2015
- Alex Fukunaga, Adi Botea, Yuu Jinnai, Akihiro Kishimoto (2017). A Survey of Parallel A*. arXiv:1708.05296
- Alex Fukunaga, Adi Botea, Yuu Jinnai, Akihiro Kishimoto (2018). Parallel A* for State-Space Search. Handbook of Parallel Constraint Reasoning
External Links
- Akihiro Kishimoto - IBM
- Akihiro Kishimoto's ICGA Tournaments
- AIs Have Mastered Chess. Will Go Be Next? by Jonathan Schaeffer, Martin Müller & Akihiro Kishimoto, IEEE Spectrum, June 25, 2014
