- CSB - MetaPress - Google - Bing - Yahoo
 | 2013 | |
|---|---|---|
| j3 |      | Akihiro Kishimoto, Alex Fukunaga, Adi Botea: Evaluation of a simple, scalable, parallel best-first search strategy. Artif. Intell. 195: 222-248 (2013) |
| c27 | | Shogo Takeuchi, Jun Kawahara, Akihiro Kishimoto, Shin-ichi Minato: Shared-Memory Parallel Frontier-Based Search. WALCOM 2013: 170-181 |
| 2012 | ||
| c26 | | Alex Fukunaga, Akihiro Kishimoto, Adi Botea: Iterative Resource Allocation for Memory Intensive Parallel Search Algorithms on Clouds, Grids, and Shared Clusters. AAAI 2012 |
| c25 | | Alex Fukunaga, Akihiro Kishimoto, Adi Botea: Iterative Resource Allocation for Memory Intensive Parallel Search Algorithms (Extended Abstract). SOCS 2012 |
| c24 | | Akihiro Kishimoto, Rong Zhou, Tatsuya Imai: Diverse Depth-First Search in Satisificing Planning. SOCS 2012 |
| i1 | | Akihiro Kishimoto, Alex Fukunaga, Adi Botea: Evaluation of a Simple, Scalable, Parallel Best-First Search Strategy. CoRR abs/1201.3204 (2012) |
| 2011 | ||
| c23 | | Tatsuya Imai, Akihiro Kishimoto: A Novel Technique for Avoiding Plateaus of Greedy Best-First Search in Satisficing Planning. AAAI 2011 |
| c22 | | Junichi Hashimoto, Akihiro Kishimoto, Kazuki Yoshizoe, Kokolo Ikeda: Accelerated UCT and Its Application to Two-Player Games. ACG 2011: 1-12 |
| c21 | | Yoshikazu Kobayashi, Akihiro Kishimoto, Osamu Watanabe: Evaluations of Hash Distributed A* in Optimal Sequence Alignment. IJCAI 2011: 584-590 |
| c20 | | Tatsuya Imai, Akihiro Kishimoto: A Novel Technique for Avoiding Plateaus of Greedy Best-First Search in Satisficing Planning. SOCS 2011 |
| c19 | | Kazuki Yoshizoe, Akihiro Kishimoto, Tomoyuki Kaneko, Haruhiro Yoshimoto, Yutaka Ishikawa: Scalable Distributed Monte-Carlo Tree Search. SOCS 2011 |
| 2010 | ||
| j2 | | Yusuke Soejima, Akihiro Kishimoto, Osamu Watanabe: Evaluating Root Parallelization in Go. IEEE Trans. Comput. Intellig. and AI in Games 2(4): 278-287 (2010) |
| c18 | | Akihiro Kishimoto: Dealing with Infinite Loops, Underestimation, and Overestimation of Depth-First Proof-Number Search. AAAI 2010 |
| c17 | | Richard Anthony Valenzano, Nathan R. Sturtevant, Jonathan Schaeffer, Karen Buro, Akihiro Kishimoto: Simultaneously Searching with Multiple Settings: An Alternative to Parameter Tuning for Suboptimal Single-Agent Search Algorithms. ICAPS 2010: 177-184 |
| c16 | | Yuima Akagi, Akihiro Kishimoto, Alex Fukunaga: On Transposition Tables for Single-Agent Search and Planning: Summary of Results. SOCS 2010 |
| c15 | | |
| c14 | | Richard Anthony Valenzano, Nathan R. Sturtevant, Jonathan Schaeffer, Karen Buro, Akihiro Kishimoto: Simultaneously Searching with Multiple Settings: An Alternative to Parameter Tuning for Suboptimal Single-Agent Search Algorithms. SOCS 2010 |
| 2009 | ||
| c13 | | Akihiro Kishimoto, Alex S. Fukunaga, Adi Botea: Scalable, Parallel Best-First Search for Optimal Sequential Planning. ICAPS 2009 |
| 2008 | ||
| c12 | | Akihiro Kishimoto, Nathan R. Sturtevant: Optimized algorithms for multi-agent routing. AAMAS (3) 2008: 1585-1588 |
| c11 | | Akihiro Kishimoto, Martin Müller: About the Completeness of Depth-First Proof-Number Search. Computers and Games 2008: 146-156 |
| 2007 | ||
| c10 | | Kazuki Yoshizoe, Akihiro Kishimoto, Martin Müller: Lambda Depth-First Proof Number Search and Its Application to Go. IJCAI 2007: 2404-2409 |
| 2006 | ||
| c9 | | Haruhiro Yoshimoto, Kazuki Yoshizoe, Tomoyuki Kaneko, Akihiro Kishimoto, Kenjiro Taura: Monte Carlo Go Has a Way to Go. AAAI 2006: 1070-1075 |
| c8 | | |
| 2005 | ||
| j1 | | Akihiro Kishimoto, Martin Müller: A solution to the GHI problem for depth-first proof-number search. Inf. Sci. 175(4): 296-314 (2005) |
| c7 | | Akihiro Kishimoto, Martin Müller: Search versus Knowledge for Solving Life and Death Problems in Go. AAAI 2005: 1374-1379 |
| c6 | | Akihiro Kishimoto, Martin Müller: Dynamic Decomposition Search: A Divide and Conquer Approach and its Application to the One-Eye Problem in Go. CIG 2005 |
| c5 | | Jonathan Schaeffer, Yngvi Björnsson, Neil Burch, Akihiro Kishimoto, Martin Müller, Robert Lake, Paul Lu, Steve Sutphen: Solving Checkers. IJCAI 2005: 292-297 |
| 2004 | ||
| c4 | | Akihiro Kishimoto, Martin Müller: A General Solution to the Graph History Interaction Problem. AAAI 2004: 644-649 |
| 2003 | ||
| c3 |  | Akihiro Kishimoto, Martin Müller: DF-PN in Go: An Application to the One-Eye Problem. ACG 2003: 125-142 |
| 2002 | ||
| c2 | | Akihiro Kishimoto, Jonathan Schaeffer: Transposition Table Driven Work Scheduling in Distributed Game-Tree Search. Canadian Conference on AI 2002: 56-68 |
| c1 | | Akihiro Kishimoto, Jonathan Schaeffer: Distributed Game-Tree Search Using Transposition Table Driven Work Scheduling. ICPP 2002: 323-330 |
Colors in the list of coauthors
Last update Sat May 18 22:22:34 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page