Akihiro Kishimoto

Proceedings of the Thirty-Fourth AAAI Conference on Artificial Intelligence, 2020

2019

Computing Multi-Modal Journey Plans under Uncertainty.

[BibT_eX]

[DOI]

J. Artif. Intell. Res., 2019

Subadditive Load Balancing.

[BibT_eX]

[DOI]

Kiyohito Nagano

CoRR, 2019

Generating Dialogue Agents via Automated Planning.

[BibT_eX]

[DOI]

CoRR, 2019

Depth-First Proof-Number Search with Heuristic Edge Cost and Application to Chemical Synthesis Planning.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 32: Annual Conference on Neural Information Processing Systems 2019, 2019

Depth-First Memory-Limited AND/OR Search and Unsolvability in Cyclic Search Spaces.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence, 2019

Anytime Recursive Best-First Search for Bounding Marginal MAP.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence, 2019

2018

On the Complexity of Quantum Circuit Compilation.

[BibT_eX]

[DOI]

Proceedings of the Eleventh International Symposium on Combinatorial Search, 2018

AI Meets Chemistry.

[BibT_eX]

[DOI]

Beat Buesser

Proceedings of the Thirty-Second AAAI Conference on Artificial Intelligence, 2018

Parallel A* for State-Space Search.

[BibT_eX]

[DOI]

Proceedings of the Handbook of Parallel Constraint Reasoning., 2018

2017

A Survey of Parallel A.

[BibT_eX]

[DOI]

CoRR, 2017

Abstracts of Papers Presented at SoCS 2017 in the Previously Published Paper Track.

[BibT_eX]

[DOI]

Proceedings of the Tenth International Symposium on Combinatorial Search, 2017

Chemical Reactant Recommendation Using a Network of Organic Chemistry.

[BibT_eX]

[DOI]

Proceedings of the Eleventh ACM Conference on Recommender Systems, 2017

A Scalable Approach to Chasing Multiple Moving Targets with Multiple Agents.

[BibT_eX]

[DOI]

Fan Xie

Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, 2017

Efficient Optimal Search under Expensive Edge Cost Computation.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, 2017

2016

Service Bundle Recommendation for Person-Centered Care Planning in Cities.

[BibT_eX]

[DOI]

Proceedings of the Exploring Complexity in Health: An Interdisciplinary Systems Approach - Proceedings of MIE2016 at HEC2016, Munich, Germany, 28 August, 2016

Combining Deterministic and Nondeterministic Search for Optimal Journey Planning Under Uncertainty.

[BibT_eX]

[DOI]

Elizabeth Daly

Proceedings of the ECAI 2016 - 22nd European Conference on Artificial Intelligence, 29 August-2 September 2016, The Hague, The Netherlands, 2016

Scalable Exact MAP Inference in Graphical Models.

[BibT_eX]

[DOI]

Proceedings of the ECAI 2016 - 22nd European Conference on Artificial Intelligence, 29 August-2 September 2016, The Hague, The Netherlands, 2016

Evaluation of Auction-Based Multi-Robot Routing by Parallel Simulation.

[BibT_eX]

[DOI]

Kiyohito Nagano

Proceedings of the Twenty-Sixth International Conference on Automated Planning and Scheduling, 2016

2015

A Lagrangian decomposition approach for the pump scheduling problem in water networks.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2015

Active Learning for Multi-relational Data Construction.

[BibT_eX]

[DOI]

Proceedings of the 24th International Conference on World Wide Web, 2015

Parallel Recursive Best-First AND/OR Search for Exact MAP Inference in Graphical Models.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 28: Annual Conference on Neural Information Processing Systems 2015, 2015

2014

Distribution Loss Minimization With Guaranteed Error Bound.

[BibT_eX]

[DOI]

IEEE Trans. Smart Grid, 2014

Recursive Best-First AND/OR Search for Optimization in Graphical Models.

[BibT_eX]

[DOI]

Proceedings of the Thirtieth Conference on Uncertainty in Artificial Intelligence, 2014

Multi-criteria journey aware housing recommender system.

[BibT_eX]

[DOI]

Proceedings of the Eighth ACM Conference on Recommender Systems, 2014

2013

Parallel Dovetailing and its Application to Depth-First Proof-Number Search.

[BibT_eX]

[DOI]

J. Int. Comput. Games Assoc., 2013

Evaluation of a simple, scalable, parallel best-first search strategy.

[BibT_eX]

[DOI]

Artif. Intell., 2013

Shared-Memory Parallel Frontier-Based Search.

[BibT_eX]

[DOI]

Proceedings of the WALCOM: Algorithms and Computation, 7th International Workshop, 2013

Succinct interval-splitting tree for scalable similarity search of compound-protein pairs with property constraints.

[BibT_eX]

[DOI]

Proceedings of the 19th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2013

2012

Game-Tree Search Using Proof Numbers: The First Twenty Years.

[BibT_eX]

[DOI]

J. Int. Comput. Games Assoc., 2012

Diverse Depth-First Search in Satisificing Planning.

[BibT_eX]

[DOI]

Rong Zhou

Tatsuya Imai

Proceedings of the Fifth Annual Symposium on Combinatorial Search, 2012

Iterative Resource Allocation for Memory Intensive Parallel Search Algorithms (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Fifth Annual Symposium on Combinatorial Search, 2012

Iterative Resource Allocation for Memory Intensive Parallel Search Algorithms on Clouds, Grids, and Shared Clusters.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Sixth AAAI Conference on Artificial Intelligence, 2012

2011

Scalable Distributed Monte-Carlo Tree Search.

[BibT_eX]

[DOI]

Proceedings of the Fourth Annual Symposium on Combinatorial Search, 2011

Evaluations of Hash Distributed A* in Optimal Sequence Alignment.

[BibT_eX]

[DOI]

Yoshikazu Kobayashi

Osamu Watanabe

Proceedings of the IJCAI 2011, 2011

Accelerated UCT and Its Application to Two-Player Games.

[BibT_eX]

[DOI]

Proceedings of the Advances in Computer Games - 13th International Conference, 2011

A Novel Technique for Avoiding Plateaus of Greedy Best-First Search in Satisficing Planning.

[BibT_eX]

[DOI]

Tatsuya Imai

Proceedings of the Twenty-Fifth AAAI Conference on Artificial Intelligence, 2011

2010

Evaluating Root Parallelization in Go.

[BibT_eX]

[DOI]

Yusuke Soejima

Osamu Watanabe

IEEE Trans. Comput. Intell. AI Games, 2010

On the Scaling Behavior of HDA.

[BibT_eX]

[DOI]

Proceedings of the Third Annual Symposium on Combinatorial Search, 2010

On Transposition Tables for Single-Agent Search and Planning: Summary of Results.

[BibT_eX]

[DOI]

Yuima Akagi

Richard Anthony Valenzano

Proceedings of the Third Annual Symposium on Combinatorial Search, 2010

Simultaneously Searching with Multiple Settings: An Alternative to Parameter Tuning for Suboptimal Single-Agent Search Algorithms.

[BibT_eX]

[DOI]

Proceedings of the 20th International Conference on Automated Planning and Scheduling, 2010

Dealing with Infinite Loops, Underestimation, and Overestimation of Depth-First Proof-Number Search.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Fourth AAAI Conference on Artificial Intelligence, 2010

2009

Scalable, Parallel Best-First Search for Optimal Sequential Planning.

[BibT_eX]

[DOI]

Alex S. Fukunaga

Proceedings of the 19th International Conference on Automated Planning and Scheduling, 2009

2008

About the Completeness of Depth-First Proof-Number Search.

[BibT_eX]

[DOI]

Proceedings of the Computers and Games, 6th International Conference, CG 2008, Beijing, 2008

Optimized algorithms for multi-agent routing.

[BibT_eX]

[DOI]

Nathan R. Sturtevant

Proceedings of the 7th International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS 2008), 2008

2007

Lambda Depth-First Proof Number Search and Its Application to Go.

[BibT_eX]

[DOI]

Kazuki Yoshizoe

Proceedings of the IJCAI 2007, 2007

2006

Recognizing Seki in Computer Go.

[BibT_eX]

[DOI]

Xiaozhen Niu

Proceedings of the Advances in Computer Games, 11th International Conference, 2006

Monte Carlo Go Has a Way to Go.

[BibT_eX]

[DOI]

Proceedings of the Proceedings, 2006

2005

A solution to the GHI problem for depth-first proof-number search.

[BibT_eX]

[DOI]

Inf. Sci., 2005

Solving Checkers.

[BibT_eX]

[DOI]

Proceedings of the IJCAI-05, Proceedings of the Nineteenth International Joint Conference on Artificial Intelligence, Edinburgh, Scotland, UK, July 30, 2005

Dynamic Decomposition Search: A Divide and Conquer Approach and its Application to the One-Eye Problem in Go.

[BibT_eX]

[DOI]

Proceedings of the 2005 IEEE Symposium on Computational Intelligence and Games (CIG05), 2005

Search versus Knowledge for Solving Life and Death Problems in Go.

[BibT_eX]

[DOI]