default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAdi Botea
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[c72]Adi Botea, Vadim Bulitko:
Extended Seeds in Optimization Crosswords. CoG 2024: 1-8- 2023
- [c71]Adi Botea, Vadim Bulitko:
Generating and Solving Champion-Level Romanian Crosswords Puzzles. CoG 2023: 1-4 - [c70]Adi Botea, Vadim Bulitko:
Core Expansion in Optimization Crosswords. SOCS 2023: 2-10 - 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 - [c68]Adi Botea, Vadim Bulitko:
Tiered State Expansion in Optimization Crosswords. AIIDE 2022: 79-86 - 2021
- [j17]Öznur Alkan, Massimiliano Mattetti, Elizabeth M. Daly, Adi Botea, Inge Vejsbjerg, Bart P. Knijnenburg:
IRF: A Framework for Enabling Users to Interact with Recommenders through Dialogue. Proc. ACM Hum. Comput. Interact. 5(CSCW1): 163:1-163:25 (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 - [c66]Vadim Bulitko, Adi Botea:
Evolving Romanian Crossword Puzzles with Deep Learning and Heuristic Search. CoG 2021: 1-5 - [c65]Adi Botea, Vadim Bulitko:
Scaling Up Search with Partial Initial States in Optimization Crosswords. SOCS 2021: 20-27 - [c64]Adi Botea, Massimiliano Mattetti, Akihiro Kishimoto, Radu Marinescu, Elizabeth Daly:
Counting Vertex-Disjoint Shortest Paths in Graphs. SOCS 2021: 28-36 - 2020
- [j16]Adi Botea:
AI fun matters. AI Matters 6(1): 18 (2020) - [j15]Adi Botea:
AI fun matters. AI Matters 6(2): 22 (2020) - [c63]Radu Marinescu, Akihiro Kishimoto, Adi Botea:
Parallel AND/OR Search for Marginal MAP. AAAI 2020: 10226-10234 - [c62]Shizhe Zhao, Mattia Chiari, Adi Botea, Alfonso Emilio Gerevini, Daniel Harabor, Alessandro Saetti, Peter J. Stuckey:
Bounded Suboptimal Path Planning with Compressed Path Databases. ICAPS 2020: 333-342 - [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)
2010 – 2019
- 2019
- [j14]Adi Botea:
Crosswords. AI Matters 5(1): 32 (2019) - [j13]Adi Botea:
Crosswords. AI Matters 5(2): 46 (2019) - [j12]Adi Botea:
AI fun matters. AI Matters 5(3): 85 (2019) - [j11]Adi Botea:
AI fun matters. AI Matters 5(4): 22 (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 - [c59]Mattia Chiari, Shizhe Zhao, Adi Botea, Alfonso Emilio Gerevini, Daniel Harabor, Alessandro Saetti, Matteo Salvetti, Peter J. Stuckey:
Cutting the Size of Compressed Path Databases with Wildcards and Redundant Symbols. ICAPS 2019: 106-113 - [c58]Akihiro Kishimoto, Adi Botea, Radu Marinescu:
Depth-First Memory-Limited AND/OR Search and Unsolvability in Cyclic Search Spaces. IJCAI 2019: 1280-1288 - [c57]Oznur Alkan, Elizabeth M. Daly, Adi Botea, Abel N. Valente, Pablo Pedemonte:
Where can my career take me?: harnessing dialogue for interactive career goal recommendations. IUI 2019: 603-613 - [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 - [c55]Oznur Alkan, Massimiliano Mattetti, Elizabeth M. Daly, Adi Botea, Inge Vejsbjerg:
IRF: interactive recommendation through dialogue. RecSys 2019: 540-541 - [c54]Marco Verzeletti, Adi Botea, Marina Zanella:
Repairing Compressed Path Databases on Maps with Dynamic Changes. SOCS 2019: 115-123 - [c53]Oznur Alkan, Elizabeth M. Daly, Adi Botea:
An Evaluation Framework for Interactive Recommender Systems. UMAP (Adjunct Publication) 2019: 217-218 - [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) - [i9]Oznur Alkan, Elizabeth M. Daly, Adi Botea:
An Evaluation Framework for Interactive Recommender System. CoRR abs/1904.07765 (2019) - [i8]Oznur Alkan, Massimiliano Mattetti, Elizabeth M. Daly, Adi Botea, Inge Vejsbjerg:
IRF: Interactive Recommendation through Dialogue. CoRR abs/1910.03040 (2019) - 2018
- [j9]Adi Botea, Davide Bonusi, Pavel Surynek:
Solving Multi-agent Path Finding on Strongly Biconnected Digraphs. J. Artif. Intell. Res. 62: 273-314 (2018) - [c52]Akihiro Kishimoto, Beat Buesser, Adi Botea:
AI Meets Chemistry. AAAI 2018: 7978-7982 - [c51]Matteo Salvetti, Adi Botea, Alfonso Emilio Gerevini, Daniel Harabor, Alessandro Saetti:
Two-Oracle Optimal Path Planning on Grid Maps. ICAPS 2018: 227-231 - [c50]Adi Botea, Davide Bonusi, Pavel Surynek:
Solving Multi-Agent Path Finding on Strongly Biconnected Digraphs (Extended Abstract). IJCAI 2018: 5563-5567 - [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
- [c48]Matteo Salvetti, Adi Botea, Alessandro Saetti, Alfonso Emilio Gerevini:
Compressed Path Databases with Ordered Wildcard Substitutions. ICAPS 2017: 250-258 - [c47]Carlos Hernández, Adi Botea, Jorge A. Baier, Vadim Bulitko:
Online Bridged Pruning for Real-Time Search with Arbitrary Lookaheads. IJCAI 2017: 510-516 - [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
- [j8]Adi Botea:
Hedging the Risk of Delays in Multimodal Journey Planning. AI Mag. 37(4): 105-106 (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 - [e2]Jorge A. Baier, Adi Botea:
Proceedings of the Ninth Annual Symposium on Combinatorial Search, SOCS 2016, Tarrytown, NY, USA, July 6-8, 2016. AAAI Press 2016, ISBN 978-1-57735-769-8 [contents] - 2015
- [j7]Ben Strasser, Adi Botea, Daniel Harabor:
Compressing Optimal Paths with Run Length Encoding. J. Artif. Intell. Res. 54: 593-629 (2015) - [j6]Jorge A. Baier, Adi Botea, Daniel Harabor, Carlos Hernández:
Fast Algorithm for Catching a Prey Quickly in Known and Partially Known Game Maps. IEEE Trans. Comput. Intell. AI Games 7(2): 193-199 (2015) - [c41]Adi Botea, Ben Strasser, Daniel Harabor:
Complexity Results for Compressing Optimal Paths. AAAI 2015: 1100-1106 - [c40]Adi Botea, Pavel Surynek:
Multi-Agent Path Finding on Strongly Biconnected Digraphs. AAAI 2015: 2024-2030 - [c39]Adi Botea, Stefano Braghin:
Contingent versus Deterministic Plans in Multi-Modal Journey Planning. ICAPS 2015: 268-272 - [c38]Adi Botea, Stefano Braghin, Nuno Lopes, Riccardo Guidotti, Francesca Pratesi:
Managing travels with PETRA: The Rome use case. ICDE Workshops 2015: 110-111 - [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 - [c36]Michele Berlingerio, Veli Bicer, Adi Botea, Stefano Braghin, Nuno Lopes, Riccardo Guidotti, Francesca Pratesi:
Mobility Mining for Journey Planning in Rome. ECML/PKDD (3) 2015: 222-226 - [c35]Nathan R. Sturtevant, Jason M. Traish, James R. Tulip, Tansel Uras, Sven Koenig, Ben Strasser, Adi Botea, Daniel Harabor, Steve Rabin:
The Grid-Based Path Planning Competition: 2014 Entries and Results. SOCS 2015: 241-250 - [c34]Hiroshi Kajino, Akihiro Kishimoto, Adi Botea, Elizabeth M. Daly, Spyros Kotoulas:
Active Learning for Multi-relational Data Construction. WWW 2015: 560-569 - [e1]Adi Botea, Sebastiaan A. Meijer:
Artificial Intelligence for Transportation: Advice, Interactivity, and Actor Modeling, Papers from the 2015 AAAI Workshop, Austin, Texas, USA, January 26, 2015. AAAI Technical Report WS-15-05, AAAI Press 2015, ISBN 978-1-57735-716-2 [contents] - [i6]Stefano V. Albrecht, J. Christopher Beck, David L. Buckeridge, Adi Botea, Cornelia Caragea, Chi-Hung Chi, Theodoros Damoulas, Bistra Dilkina, Eric Eaton, Pooyan Fazli, Sam Ganzfried, Marius Lindauer, Marlos C. Machado, Yuri Malitsky, Gary Marcus, Sebastiaan A. Meijer, Francesca Rossi, Arash Shaban-Nejad, Sylvie Thiébaux, Manuela M. Veloso, Toby Walsh, Can Wang, Jie Zhang, Yu Zheng:
Reports from the 2015 AAAI Workshop Program. AI Mag. 36(2): 90-101 (2015) - 2014
- [c33]Christopher Makoto Wilt, Adi Botea:
Spatially Distributed Multiagent Path Planning. ICAPS 2014 - [c32]Elizabeth M. Daly, Adi Botea, Akihiro Kishimoto, Radu Marinescu:
Multi-criteria journey aware housing recommender system. RecSys 2014: 325-328 - [c31]Ben Strasser, Daniel Harabor, Adi Botea:
Fast First-Move Queries through Run-Length Encoding. SOCS 2014: 157-165 - [i5]Ko-Hsin Cindy Wang, Adi Botea:
MAPP: a Scalable Multi-Agent Path Planning Algorithm with Tractability and Completeness Guarantees. CoRR abs/1401.3905 (2014) - [i4]Tim Nonner, Adi Botea, Marco Laumanns:
Stochastic Travel Planning for Unreliable Public Transportation Systems. ERCIM News 2014(98) (2014) - 2013
- [j5]Akihiro Kishimoto, Alex Fukunaga, Adi Botea:
Evaluation of a simple, scalable, parallel best-first search strategy. Artif. Intell. 195: 222-248 (2013) - [c30]Adi Botea, Jorge A. Baier, Daniel Harabor, Carlos Hernández:
Moving Target Search with Compressed Path Databases. ICAPS 2013 - [c29]Adi Botea, Daniel Harabor:
Path Planning with Compressed All-Pairs Shortest Paths Data. ICAPS 2013 - [c28]Adi Botea, Evdokia Nikolova, Michele Berlingerio:
Multi-Modal Journey Planning in the Presence of Uncertainty. ICAPS 2013 - [c27]Bei Chen, Fabio Pinelli, Mathieu Sinn, Adi Botea, Francesco Calabrese:
Uncertainty in urban mobility: Predicting waiting times for shared bicycles and parking lots. ITSC 2013: 53-58 - [p2]Peter I. Cowling, Michael Buro, Michal Bída, Adi Botea, Bruno Bouzy, Martin V. Butz, Philip Hingston, Hector Muñoz-Avila, Dana S. Nau, Moshe Sipper:
Search in Real-Time Video Games. Artificial and Computational Intelligence in Games 2013: 1-19 - [p1]Adi Botea, Bruno Bouzy, Michael Buro, Christian Bauckhage, Dana S. Nau:
Pathfinding in Games. Artificial and Computational Intelligence in Games 2013: 21-31 - 2012
- [j4]Adi Botea, Jussi Rintanen, Debdeep Banerjee:
Optimal Reconfiguration for Supply Restoration With Informed A* Search. IEEE Trans. Smart Grid 3(2): 583-593 (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]Birgit M. Planitz, Penelope Sanderson, Clinton Freeman, Tania Xiao, Adi Botea, Cristina Beltran Orihuela:
Testing the prospective evaluation of a new healthcare system. AMIA 2012 - [c24]Alex Fukunaga, Akihiro Kishimoto, Adi Botea:
Iterative Resource Allocation for Memory Intensive Parallel Search Algorithms (Extended Abstract). SOCS 2012: 182-183 - [c23]Adi Botea:
Fast, Optimal Pathfinding with Compressed Path Databases. SOCS 2012: 204-205 - [i3]Akihiro Kishimoto, Alex Fukunaga, Adi Botea:
Evaluation of a Simple, Scalable, Parallel Best-First Search Strategy. CoRR abs/1201.3204 (2012) - 2011
- [j3]Ko-Hsin Cindy Wang, Adi Botea:
MAPP: a Scalable Multi-Agent Path Planning Algorithm with Tractability and Completeness Guarantees. J. Artif. Intell. Res. 42: 55-90 (2011) - [c22]Ko-Hsin Cindy Wang, Adi Botea, Philip Kilby:
Solution Quality Improvements for Massively Multi-Agent Pathfinding. AAAI 2011: 1824-1825 - [c21]Adi Botea:
Ultra-Fast Optimal Pathfinding without Runtime Search. AIIDE 2011 - [c20]Daniel Damir Harabor, Adi Botea, Philip Kilby:
Path Symmetries in Undirected Uniform-Cost Grids. SARA 2011 - [c19]Ko-Hsin Cindy Wang, Adi Botea, Philip Kilby:
On Improving the Quality of Solutions in Large-Scale Cooperative Multi-Agent Pathfinding. SOCS 2011: 209-210 - [i2]Daniel Harabor, Adi Botea, Philip Kilby:
Symmetry-Based Search Space Reduction For Grid Maps. CoRR abs/1106.4083 (2011) - [i1]Adi Botea, Markus Enzenberger, Martin Müller, Jonathan Schaeffer:
Macro-FF: Improving AI Planning with Automatically Learned Macro-Operators. CoRR abs/1109.2154 (2011) - 2010
- [c18]Daniel Harabor, Adi Botea:
Breaking Path Symmetries on 4-Connected Grid Maps. AIIDE 2010 - [c17]Ko-Hsin Cindy Wang, Adi Botea:
Scalable Multi-Agent Pathfinding on Grid Maps with Tractability and Completeness Guarantees. ECAI 2010: 977-978 - [c16]Akihiro Kishimoto, Alex Fukunaga, Adi Botea:
On the Scaling Behavior of HDA. SOCS 2010: 61-62
2000 – 2009
- 2009
- [c15]Jorge A. Baier, Adi Botea:
Improving Planning Performance Using Low-Conflict Relaxed Plans. ICAPS 2009 - [c14]Akihiro Kishimoto, Alex S. Fukunaga, Adi Botea:
Scalable, Parallel Best-First Search for Optimal Sequential Planning. ICAPS 2009 - [c13]Adi Botea, André A. Ciré:
Incremental Heuristic Search for Planning with Temporally Extended Goals and Uncontrollable Events. IJCAI 2009: 1647-1652 - [c12]Ko-Hsin Cindy Wang, Adi Botea:
Tractable Multi-Agent Path Planning on Grid Maps. IJCAI 2009: 1870-1875 - 2008
- [c11]John Paul Kelly, Adi Botea, Sven Koenig:
Offline Planning with Hierarchical Task Networks in Video Games. AIIDE 2008 - [c10]Ko-Hsin Cindy Wang, Adi Botea:
Fast and Memory-Efficient Multi-Agent Pathfinding. ICAPS 2008: 380-387 - [c9]Daniel Harabor, Adi Botea:
Hierarchical path planning for multi-size agents in heterogeneous environments. CIG 2008: 258-265 - [c8]Anbulagan, Adi Botea:
Crossword Puzzles as a Constraint Problem. CP 2008: 550-554 - [c7]André A. Ciré, Adi Botea:
Learning in Planning with Temporally Extended Goals and Uncontrollable Events. ECAI 2008: 578-582 - 2007
- [c6]Patrik Haslum, Adi Botea, Malte Helmert, Blai Bonet, Sven Koenig:
Domain-Independent Construction of Pattern Database Heuristics for Cost-Optimal Planning. AAAI 2007: 1007-1012 - [c5]Adi Botea, Martin Müller, Jonathan Schaeffer:
Fast Planning with Iterative Macros. IJCAI 2007: 1828-1833 - 2005
- [j2]Adi Botea, Markus Enzenberger, Martin Müller, Jonathan Schaeffer:
Macro-FF: Improving AI Planning with Automatically Learned Macro-Operators. J. Artif. Intell. Res. 24: 581-621 (2005) - [c4]Adi Botea, Martin Müller, Jonathan Schaeffer:
Learning Partial-Order Macros from Solutions. ICAPS 2005: 231-240 - 2004
- [j1]Adi Botea, Martin Müller, Jonathan Schaeffer:
Near Optimal Hierarchical Path-Finding. J. Game Dev. 1(1): 1-30 (2004) - [c3]Adi Botea, Martin Müller, Jonathan Schaeffer:
Using Component Abstraction for Automatic Generation of Macro-Actions. ICAPS 2004: 181-190 - 2002
- [c2]Adi Botea, Martin Müller, Jonathan Schaeffer:
Using Abstraction for Planning in Sokoban. Computers and Games 2002: 360-375 - [c1]Adi Botea:
Using Abstraction for Heuristic Search and Planning. SARA 2002: 326-327
Coauthor Index
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-09-21 02:37 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
