![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
Akihiro Kishimoto
Person information
Refine list
![note](https://dblp.uni-trier.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [i13]Indra Priyadarsini, Vidushi Sharma, Seiji Takeda, Akihiro Kishimoto, Lisa Hamada, Hajime Shinohara:
Improving Performance Prediction of Electrolyte Formulations with Transformer-based Molecular Representation Model. CoRR abs/2406.19792 (2024) - 2023
- [c52]Seiji Takeda, Akihiro Kishimoto, Lisa Hamada, Daiju Nakano, John R. Smith:
Foundation Model for Material Science. AAAI 2023: 15376-15383 - [c51]Achille Fokoue, Ibrahim Abdelaziz, Maxwell Crouse, Shajith Ikbal, Akihiro Kishimoto, Guilherme Lima, Ndivhuwo Makondo, Radu Marinescu:
An Ensemble Approach for Automated Theorem Proving Based on Efficient Name Invariant Graph Neural Representations. IJCAI 2023: 3221-3229 - [e3]Cameron Browne
, Akihiro Kishimoto
, Jonathan Schaeffer:
Computers and Games - International Conference, CG 2022, Virtual Event, November 22-24, 2022, Revised Selected Papers. Lecture Notes in Computer Science 13865, Springer 2023, ISBN 978-3-031-34016-1 [contents] - [i12]Achille Fokoue, Ibrahim Abdelaziz, Maxwell Crouse, Shajith Ikbal, Akihiro Kishimoto, Guilherme Lima, Ndivhuwo Makondo, Radu Marinescu:
An Ensemble Approach for Automated Theorem Proving Based on Efficient Name Invariant Graph Neural Representations. CoRR abs/2305.08676 (2023) - [i11]Akihiro Kishimoto, Hiroshi Kajino, Masataka Hirose, Junta Fuchiwaki, Indra Priyadarsini, Lisa Hamada, Hajime Shinohara, Daiju Nakano, Seiji Takeda:
MHG-GNN: Combination of Molecular Hypergraph Grammar with Graph Neural Network. CoRR abs/2309.16374 (2023) - [i10]Eduardo E. M. Soares, Akihiro Kishimoto, Emilio Vital Brazil, Seiji Takeda, Hiroshi Kajino, Renato Cerqueira:
Improving Molecular Properties Prediction Through Latent Space Fusion. CoRR abs/2310.13802 (2023) - 2022
- [j10]Cameron Browne, Akihiro Kishimoto, Jonathan Schaeffer:
ACG 2021 conference report. J. Int. Comput. Games Assoc. 44(1): 39-42 (2022) - [j9]Cameron Browne, Akihiro Kishimoto, Jonathan Schaeffer:
Computers and games (CG 2022) conference report. J. Int. Comput. Games Assoc. 44(4): 167-169 (2022) - [c50]Akihiro Kishimoto, Djallel Bouneffouf, Radu Marinescu, Parikshit Ram, Ambrish Rawat, Martin Wistuba, Paulito P. Palmes, Adi Botea:
Bandit Limited Discrepancy Search and Application to Machine Learning Pipeline Optimization. AAAI 2022: 10228-10237 - [e2]Cameron Browne
, Akihiro Kishimoto
, Jonathan Schaeffer:
Advances in Computer Games - 17th International Conference, ACG 2021, Virtual Event, November 23-25, 2021, Revised Selected Papers. Lecture Notes in Computer Science 13262, Springer 2022, ISBN 978-3-031-11487-8 [contents] - [i9]Matteo Manica, Joris Cadow, Dimitrios Christofidellis, Ashish Dave, Jannis Born, Dean Clarke, Yves Gaetan Nana Teukam, Samuel C. Hoffman, Matthew Buchan
, Vijil Chenthamarakshan, Timothy Donovan, Hsiang-Han Hsu, Federico Zipoli, Oliver Schilter, Giorgio Giannone, Akihiro Kishimoto, Lisa Hamada, Inkit Padhi, Karl Wehden, Lauren McHugh, Alexy Khrabrov, Payel Das, Seiji Takeda, John R. Smith:
GT4SD: Generative Toolkit for Scientific Discovery. CoRR abs/2207.03928 (2022) - 2021
- [c49]Radu Marinescu, Akihiro Kishimoto, Parikshit Ram, Ambrish Rawat, Martin Wistuba, Paulito P. Palmes, Adi Botea:
Searching for Machine Learning Pipelines Using a Context-Free Grammar. AAAI 2021: 8902-8911 - [c48]Adi Botea, Massimiliano Mattetti, Akihiro Kishimoto, Radu Marinescu, Elizabeth Daly:
Counting Vertex-Disjoint Shortest Paths in Graphs. SOCS 2021: 28-36 - [i8]Paulito P. Palmes, Akihiro Kishimoto, Radu Marinescu, Parikshit Ram, Elizabeth Daly:
Designing Machine Learning Pipeline Toolkit for AutoML Surrogate Modeling Optimization. CoRR abs/2107.01253 (2021) - [i7]Seiji Takeda, Toshiyuki Hama, Hsiang-Han Hsu, Akihiro Kishimoto, Makoto Kogoh, Takumi Hongo, Kumiko Fujieda, Hideaki Nakashika, Dmitry Zubarev, Daniel P. Sanders, Jed W. Pitera, Junta Fuchiwaki, Daiju Nakano:
Molecule Generation Experience: An Open Platform of Material Design for Public Users. CoRR abs/2108.03044 (2021) - 2020
- [c47]Radu Marinescu, Akihiro Kishimoto, Adi Botea:
Parallel AND/OR Search for Marginal MAP. AAAI 2020: 10226-10234 - [c46]Adi Botea, Akihiro Kishimoto, Radu Marinescu, Elizabeth M. Daly, Oznur Alkan:
The Challenge of Optimal Paths in Graphs with Item Sets. ECAI 2020: 2885-2886 - [i6]Tamami Nakano, Atsuya Sakata, Akihiro Kishimoto:
Estimating Blink Probability for Highlight Detection in Figure Skating Videos. CoRR abs/2007.01089 (2020) - [i5]Massimiliano Mattetti, Akihiro Kishimoto, Adi Botea, Elizabeth Daly, Inge Vejsbjerg, Bei Chen, Öznur Alkan:
Client Network: An Interactive Model for Predicting New Clients. CoRR abs/2007.04810 (2020)
2010 – 2019
- 2019
- [j8]Adi Botea, Akihiro Kishimoto, Evdokia Nikolova, Stefano Braghin
, Michele Berlingerio, Elizabeth Daly:
Computing Multi-Modal Journey Plans under Uncertainty. J. Artif. Intell. Res. 65: 633-674 (2019) - [c45]Radu Marinescu, Akihiro Kishimoto, Adi Botea, Rina Dechter, Alexander Ihler:
Anytime Recursive Best-First Search for Bounding Marginal MAP. AAAI 2019: 7924-7932 - [c44]Akihiro Kishimoto, Adi Botea, Radu Marinescu:
Depth-First Memory-Limited AND/OR Search and Unsolvability in Cyclic Search Spaces. IJCAI 2019: 1280-1288 - [c43]Akihiro Kishimoto, Beat Buesser, Bei Chen, Adi Botea:
Depth-First Proof-Number Search with Heuristic Edge Cost and Application to Chemical Synthesis Planning. NeurIPS 2019: 7224-7234 - [i4]Adi Botea, Christian Muise, Shubham Agarwal, Oznur Alkan, Ondrej Bajgar, Elizabeth Daly, Akihiro Kishimoto, Luis A. Lastras, Radu Marinescu, Josef Ondrej, Pablo Pedemonte, Miroslav Vodolán:
Generating Dialogue Agents via Automated Planning. CoRR abs/1902.00771 (2019) - [i3]Kiyohito Nagano, Akihiro Kishimoto:
Subadditive Load Balancing. CoRR abs/1908.09135 (2019) - 2018
- [c42]Akihiro Kishimoto, Beat Buesser, Adi Botea:
AI Meets Chemistry. AAAI 2018: 7978-7982 - [c41]Adi Botea, Akihiro Kishimoto, Radu Marinescu:
On the Complexity of Quantum Circuit Compilation. SOCS 2018: 138-142 - [p1]Alex Fukunaga, Adi Botea, Yuu Jinnai, Akihiro Kishimoto:
Parallel A* for State-Space Search. Handbook of Parallel Constraint Reasoning 2018: 419-455 - 2017
- [c40]Masataro Asai, Akihiro Kishimoto, Adi Botea, Radu Marinescu, Elizabeth M. Daly, Spyros Kotoulas:
Efficient Optimal Search under Expensive Edge Cost Computation. IJCAI 2017: 4266-4272 - [c39]Fan Xie, Adi Botea, Akihiro Kishimoto:
A Scalable Approach to Chasing Multiple Moving Targets with Multiple Agents. IJCAI 2017: 4470-4476 - [c38]John Savage, Akihiro Kishimoto, Beat Buesser, Ernesto Diaz-Aviles, Carlos Alzate:
Chemical Reactant Recommendation Using a Network of Organic Chemistry. RecSys 2017: 210-214 - [c37]Alex Fukunaga, Akihiro Kishimoto:
Abstracts of Papers Presented at SoCS 2017 in the Previously Published Paper Track. SOCS 2017: 176-178 - [e1]Alex Fukunaga, Akihiro Kishimoto:
Proceedings of the Tenth International Symposium on Combinatorial Search, SOCS 2017, 16-17 June 2017, Pittsburgh, Pennsylvania, USA. AAAI Press 2017 [contents] - [i2]Alex Fukunaga, Adi Botea, Yuu Jinnai, Akihiro Kishimoto:
A Survey of Parallel A. CoRR abs/1708.05296 (2017) - 2016
- [c36]Akihiro Kishimoto, Kiyohito Nagano:
Evaluation of Auction-Based Multi-Robot Routing by Parallel Simulation. ICAPS 2016: 495-503 - [c35]Akihiro Kishimoto, Adi Botea, Elizabeth Daly:
Combining Deterministic and Nondeterministic Search for Optimal Journey Planning Under Uncertainty. ECAI 2016: 295-303 - [c34]Radu Marinescu, Akihiro Kishimoto, Adi Botea:
Scalable Exact MAP Inference in Graphical Models. ECAI 2016: 1684-1685 - [c33]Spyros Kotoulas, Elizabeth Daly, Pierpaolo Tommasi, Akihiro Kishimoto, Vanessa López
, Martin Stephenson, Adi Botea, Marco Luca Sbodio
, Radu Marinescu, Ronan Rooney:
Service Bundle Recommendation for Person-Centered Care Planning in Cities. MIE 2016: 33-37 - 2015
- [j7]Bissan Ghaddar
, Joe Naoum-Sawaya
, Akihiro Kishimoto, Nicole Taheri, Bradley Eck:
A Lagrangian decomposition approach for the pump scheduling problem in water networks. Eur. J. Oper. Res. 241(2): 490-501 (2015) - [c32]Akihiro Kishimoto, Radu Marinescu, Adi Botea:
Parallel Recursive Best-First AND/OR Search for Exact MAP Inference in Graphical Models. NIPS 2015: 928-936 - [c31]Hiroshi Kajino, Akihiro Kishimoto, Adi Botea, Elizabeth M. Daly, Spyros Kotoulas
:
Active Learning for Multi-relational Data Construction. WWW 2015: 560-569 - 2014
- [j6]Takeru Inoue, Keiji Takano, Takayuki Watanabe, Jun Kawahara, Ryo Yoshinaka
, Akihiro Kishimoto, Koji Tsuda, Shin-ichi Minato, Yasuhiro Hayashi
:
Distribution Loss Minimization With Guaranteed Error Bound. IEEE Trans. Smart Grid 5(1): 102-111 (2014) - [c30]Elizabeth M. Daly, Adi Botea, Akihiro Kishimoto, Radu Marinescu:
Multi-criteria journey aware housing recommender system. RecSys 2014: 325-328 - [c29]Akihiro Kishimoto, Radu Marinescu:
Recursive Best-First AND/OR Search for Optimization in Graphical Models. UAI 2014: 400-409 - 2013
- [j5]Akihiro Kishimoto, Alex Fukunaga, Adi Botea:
Evaluation of a simple, scalable, parallel best-first search strategy. Artif. Intell. 195: 222-248 (2013) - [j4]Kunihito Hoki, Tomoyuki Kaneko, Akihiro Kishimoto, Takeshi Ito:
Parallel Dovetailing and its Application to Depth-First Proof-Number Search. J. Int. Comput. Games Assoc. 36(1): 22-36 (2013) - [c28]Yasuo Tabei, Akihiro Kishimoto, Masaaki Kotera, Yoshihiro Yamanishi:
Succinct interval-splitting tree for scalable similarity search of compound-protein pairs with property constraints. KDD 2013: 176-184 - [c27]Shogo Takeuchi
, Jun Kawahara, Akihiro Kishimoto, Shin-ichi Minato:
Shared-Memory Parallel Frontier-Based Search. WALCOM 2013: 170-181 - 2012
- [j3]Akihiro Kishimoto, Mark H. M. Winands, Martin Müller, Jahn-Takeshi Saito:
Game-Tree Search Using Proof Numbers: The First Twenty Years. J. Int. Comput. Games Assoc. 35(3): 131-156 (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: 478-486 - [c25]Akihiro Kishimoto, Rong Zhou, Tatsuya Imai:
Diverse Depth-First Search in Satisificing Planning. SOCS 2012: 164-165 - [c24]Alex Fukunaga, Akihiro Kishimoto, Adi Botea:
Iterative Resource Allocation for Memory Intensive Parallel Search Algorithms (Extended Abstract). SOCS 2012: 182-183 - [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: 985-991 - [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]Kazuki Yoshizoe, Akihiro Kishimoto, Tomoyuki Kaneko, Haruhiro Yoshimoto, Yutaka Ishikawa:
Scalable Distributed Monte-Carlo Tree Search. SOCS 2011: 180-187 - [c19]Tatsuya Imai, Akihiro Kishimoto:
A Novel Technique for Avoiding Plateaus of Greedy Best-First Search in Satisficing Planning. SOCS 2011: 197-198 - 2010
- [j2]Yusuke Soejima, Akihiro Kishimoto, Osamu Watanabe:
Evaluating Root Parallelization in Go. IEEE Trans. Comput. Intell. AI Games 2(4): 278-287 (2010) - [c18]Akihiro Kishimoto:
Dealing with Infinite Loops, Underestimation, and Overestimation of Depth-First Proof-Number Search. AAAI 2010: 108-113 - [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: 2-9 - [c15]Akihiro Kishimoto, Alex Fukunaga, Adi Botea:
On the Scaling Behavior of HDA. SOCS 2010: 61-62 - [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: 157-158
2000 – 2009
- 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]Xiaozhen Niu, Akihiro Kishimoto, Martin Müller:
Recognizing Seki in Computer Go. ACG 2006: 88-103 - 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. AI 2002: 56-68 - [c1]Akihiro Kishimoto, Jonathan Schaeffer:
Distributed Game-Tree Search Using Transposition Table Driven Work Scheduling. ICPP 2002: 323-330
Coauthor Index
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-07-25 20:21 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint