Остановите войну!
for scientists:
default search action
Adi Botea
Publications
- 2022
- [c69]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 - 2021
- [c67]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 - [c64]Adi Botea, Massimiliano Mattetti, Akihiro Kishimoto, Radu Marinescu, Elizabeth Daly:
Counting Vertex-Disjoint Shortest Paths in Graphs. SOCS 2021: 28-36 - 2020
- [c63]Radu Marinescu, Akihiro Kishimoto, Adi Botea:
Parallel AND/OR Search for Marginal MAP. AAAI 2020: 10226-10234 - [c61]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 - [i11]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) - 2019
- [j10]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) - [c60]Radu Marinescu, Akihiro Kishimoto, Adi Botea, Rina Dechter, Alexander Ihler:
Anytime Recursive Best-First Search for Bounding Marginal MAP. AAAI 2019: 7924-7932 - [c58]Akihiro Kishimoto, Adi Botea, Radu Marinescu:
Depth-First Memory-Limited AND/OR Search and Unsolvability in Cyclic Search Spaces. IJCAI 2019: 1280-1288 - [c56]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 - [i10]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) - 2018
- [c52]Akihiro Kishimoto, Beat Buesser, Adi Botea:
AI Meets Chemistry. AAAI 2018: 7978-7982 - [c49]Adi Botea, Akihiro Kishimoto, Radu Marinescu:
On the Complexity of Quantum Circuit Compilation. SOCS 2018: 138-142 - [p3]Alex Fukunaga, Adi Botea, Yuu Jinnai, Akihiro Kishimoto:
Parallel A* for State-Space Search. Handbook of Parallel Constraint Reasoning 2018: 419-455 - 2017
- [c46]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 - [c45]Fan Xie, Adi Botea, Akihiro Kishimoto:
A Scalable Approach to Chasing Multiple Moving Targets with Multiple Agents. IJCAI 2017: 4470-4476 - [i7]Alex Fukunaga, Adi Botea, Yuu Jinnai, Akihiro Kishimoto:
A Survey of Parallel A. CoRR abs/1708.05296 (2017) - 2016
- [c44]Akihiro Kishimoto, Adi Botea, Elizabeth Daly:
Combining Deterministic and Nondeterministic Search for Optimal Journey Planning Under Uncertainty. ECAI 2016: 295-303 - [c43]Radu Marinescu, Akihiro Kishimoto, Adi Botea:
Scalable Exact MAP Inference in Graphical Models. ECAI 2016: 1684-1685 - [c42]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
- [c37]Akihiro Kishimoto, Radu Marinescu, Adi Botea:
Parallel Recursive Best-First AND/OR Search for Exact MAP Inference in Graphical Models. NIPS 2015: 928-936 - [c34]Hiroshi Kajino, Akihiro Kishimoto, Adi Botea, Elizabeth M. Daly, Spyros Kotoulas:
Active Learning for Multi-relational Data Construction. WWW 2015: 560-569 - 2014
- [c32]Elizabeth M. Daly, Adi Botea, Akihiro Kishimoto, Radu Marinescu:
Multi-criteria journey aware housing recommender system. RecSys 2014: 325-328 - 2013
- [j5]Akihiro Kishimoto, Alex Fukunaga, Adi Botea:
Evaluation of a simple, scalable, parallel best-first search strategy. Artif. Intell. 195: 222-248 (2013) - 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 - [c24]Alex Fukunaga, Akihiro Kishimoto, Adi Botea:
Iterative Resource Allocation for Memory Intensive Parallel Search Algorithms (Extended Abstract). SOCS 2012: 182-183 - [i3]Akihiro Kishimoto, Alex Fukunaga, Adi Botea:
Evaluation of a Simple, Scalable, Parallel Best-First Search Strategy. CoRR abs/1201.3204 (2012) - 2010
- [c16]Akihiro Kishimoto, Alex Fukunaga, Adi Botea:
On the Scaling Behavior of HDA. SOCS 2010: 61-62 - 2009
- [c14]Akihiro Kishimoto, Alex S. Fukunaga, Adi Botea:
Scalable, Parallel Best-First Search for Optimal Sequential Planning. ICAPS 2009
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-04-25 01:51 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint