default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDLevi Lelis
Levi H. S. Lelis
Person information
- affiliation: University of Alberta, Canada
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j10]Habibur Rahman, Thirupathi Reddy Emireddy, Kenneth Tjhia, Elham Parhizkar, Levi Lelis:
Synthesizing Libraries of Programs with Auxiliary Functions. Trans. Mach. Learn. Res. 2024 (2024)- [c58]Saqib Ameen, Levi H. S. Lelis:
Program Synthesis with Best-First Bottom-Up Search (Abstract Reprint). AAAI 2024: 22691 - [c57]Mahdi Alikhasi, Levi Lelis:
Unveiling Options with Neural Network Decomposition. ICLR 2024 - [c56]Tales Henrique Carvalho, Kenneth Tjhia, Levi Lelis:
Reclaiming the Source of Programmatic Policies: Programmatic versus Latent Spaces. ICLR 2024 - [c55]Sumedh Pendurkar, Levi H. S. Lelis, Nathan R. Sturtevant, Guni Sharon:
Curriculum Generation for Learning Guiding Functions in State-Space Search Algorithms. SOCS 2024: 91-99 - [i18]Rubens O. Moraes, Levi H. S. Lelis:
Searching for Programmatic Policies in Semantic Spaces. CoRR abs/2405.05431 (2024) - 2023
- [j9]Saqib Ameen, Levi H. S. Lelis:
Program Synthesis with Best-First Bottom-Up Search. J. Artif. Intell. Res. 77: 1275-1310 (2023) - [c54]David S. Aleixo, Levi H. S. Lelis:
Show Me the Way! Bilevel Search for Synthesizing Programmatic Strategies. AAAI 2023: 4991-4998 - [c53]Fatemeh Abdollahi, Saqib Ameen, Matthew E. Taylor, Levi H. S. Lelis:
Can You Improve My Code? Optimizing Programs with Local Search. IJCAI 2023: 2940-2948 - [c52]Rubens O. Moraes, David S. Aleixo, Lucas N. Ferreira, Levi H. S. Lelis:
Choosing Well Your Opponents: How to Guide the Synthesis of Programmatic Strategies. IJCAI 2023: 4847-4854 - [c51]Laurent Orseau, Marcus Hutter, Levi H. S. Lelis:
Levin Tree Search with Context Models. IJCAI 2023: 5622-5630 - [i17]Laurent Orseau, Marcus Hutter, Levi H. S. Lelis:
Levin Tree Search with Context Models. CoRR abs/2305.16945 (2023) - [i16]Rubens O. Moraes, David S. Aleixo, Lucas N. Ferreira, Levi H. S. Lelis:
Choosing Well Your Opponents: How to Guide the Synthesis of Programmatic Strategies. CoRR abs/2307.04893 (2023) - [i15]Fatemeh Abdollahi, Saqib Ameen, Matthew E. Taylor, Levi H. S. Lelis:
Can You Improve My Code? Optimizing Programs with Local Search. CoRR abs/2307.05603 (2023) - [i14]Spyros Orfanos, Levi H. S. Lelis:
Synthesizing Programmatic Policies with Actor-Critic Algorithms and ReLU Networks. CoRR abs/2308.02729 (2023) - [i13]Saqib Ameen, Levi H. S. Lelis:
Program Synthesis with Best-First Bottom-Up Search. CoRR abs/2310.04327 (2023) - [i12]Zahra Bashir, Michael Bowling, Levi H. S. Lelis:
Assessing the Interpretability of Programmatic Policies with Large Language Models. CoRR abs/2311.06979 (2023) - 2022
- [j8]Rubens O. Moraes, Mario A. Nascimento, Levi H. S. Lelis:
Asymmetric Action Abstractions for Planning in Real-Time Strategy Games. J. Artif. Intell. Res. 75: 1103-1137 (2022) - [c50]Leandro C. Medeiros, David S. Aleixo, Levi H. S. Lelis:
What Can We Learn Even from the Weakest? Learning Sketches for Programmatic Strategies. AAAI 2022: 7761-7769 - [c49]Lucas N. Ferreira, Lili Mou, Jim Whitehead, Levi H. S. Lelis:
Controlling Perceived Emotion in Symbolic Music Generation with Monte Carlo Tree Search. AIIDE 2022: 163-170 - [c48]Levi H. S. Lelis, João Gabriel Gama Vila Nova
, Eugene Chen, Nathan R. Sturtevant, Carrie Demmans Epp, Michael Bowling:
Learning Curricula for Humans: An Empirical Study with Puzzles from The Witness. IJCAI 2022: 3877-3883 - [c47]Vadim Bulitko, Shuwei Wang, Justin Stevens, Levi H. S. Lelis:
Portability and Explainability of Synthesized Formula-based Heuristics. SOCS 2022: 29-37 - [i11]Leandro C. Medeiros, David S. Aleixo, Levi H. S. Lelis:
What can we Learn Even From the Weakest? Learning Sketches for Programmatic Strategies. CoRR abs/2203.11912 (2022) - [i10]Lucas N. Ferreira, Lili Mou, Jim Whitehead, Levi H. S. Lelis:
Controlling Perceived Emotion in Symbolic Music Generation with Monte Carlo Tree Search. CoRR abs/2208.05162 (2022) - 2021
- [j7]Cleyton R. Silva, Michael Bowling, Levi H. S. Lelis:
Teaching People by Justifying Tree Search Decisions: An Empirical Study in Curling. J. Artif. Intell. Res. 72: 1083-1102 (2021) - [c46]Julian R. H. Mariño, Rubens O. Moraes, Tassiana C. Oliveira, Cláudio Toledo, Levi H. S. Lelis:
Programmatic Strategies for Real-Time Strategy Games. AAAI 2021: 381-389 - [c45]Jonathan Martinez, Kobi Gal, Ece Kamar, Levi H. S. Lelis:
Improving the Performance-Compatibility Tradeoff with Personalized Objective Functions. AAAI 2021: 5967-5974 - [c44]Laurent Orseau, Levi H. S. Lelis:
Policy-Guided Heuristic Search with Guarantees. AAAI 2021: 12382-12390 - [c43]Lucas V. S. Pereira, Luiz Chaimowicz, Levi H. S. Lelis:
Birds in Boots: Learning to Play Angry Birds with Policy-Guided Search. AIIDE 2021: 74-81 - [c42]Vadim Bulitko, Sergio Poo Hernandez, Levi H. S. Lelis:
Fast Synthesis of Algebraic Heuristic Functions for Video-game Pathfinding. CoG 2021: 1-5 - [i9]Laurent Orseau, Levi H. S. Lelis:
Policy-Guided Heuristic Search with Guarantees. CoRR abs/2103.11505 (2021) - 2020
- [c41]Lucas N. Ferreira, Levi H. S. Lelis, Jim Whitehead:
Computer-Generated Music for Tabletop Role-Playing Games. AIIDE 2020: 59-65 - [c40]Vitor Barbosa C. Souza, Moisés Henrique Pereira, Levi H. S. Lelis, Xavi Masip-Bruin:
Enhancing resource availability in vehicular fog computing through smart inter-domain handover. GLOBECOM 2020: 1-6 - [c39]Levi H. S. Lelis:
Planning Algorithms for Zero-Sum Games with Exponential Action Spaces: A Unifying Perspective. IJCAI 2020: 4892-4898 - [c38]Zaheen Farraz Ahmad, Levi Lelis, Michael Bowling:
Marginal Utility for Planning in Continuous or Large Discrete Action Spaces. NeurIPS 2020 - [e3]Levi Lelis, David Thue:
Proceedings of the Sixteenth AAAI Conference on Artificial Intelligence and Interactive Digital Entertainment, AIIDE 2020, virtual, October 19-23, 2020. AAAI Press 2020, ISBN 978-1-57735-849-7 [contents] - [i8]Jonathan Martinez, Kobi Gal, Ece Kamar, Levi H. S. Lelis:
Personalization in Human-AI Teams: Improving the Compatibility-Accuracy Tradeoff. CoRR abs/2004.02289 (2020) - [i7]Zaheen Farraz Ahmad, Levi H. S. Lelis, Michael Bowling:
Marginal Utility for Planning in Continuous or Large Discrete Action Spaces. CoRR abs/2006.06054 (2020) - [i6]Lucas N. Ferreira, Levi H. S. Lelis, Jim Whitehead:
Computer-Generated Music for Tabletop Role-Playing Games. CoRR abs/2008.07009 (2020)
2010 – 2019
- 2019
- [j6]Cleyton R. Silva, Rubens O. Moraes, Levi H. S. Lelis, Kobi Gal:
Strategy Generation for Multiunit Real-Time Games via Voting. IEEE Trans. Games 11(4): 426-435 (2019) - [c37]Julian R. H. Mariño, Rubens O. Moraes, Cláudio Toledo, Levi H. S. Lelis:
Evolving Action Abstractions for Real-Time Planning in Extensive-Form Games. AAAI 2019: 2330-2337 - [c36]Rafael R. Padovani, Lucas N. Ferreira, Levi H. S. Lelis:
Be Inaccurate but Don't Be Indecisive: How Error Distribution Can Affect User Experience. AAAI 2019: 2604-2611 - [c35]Malte Helmert, Tor Lattimore, Levi H. S. Lelis, Laurent Orseau, Nathan R. Sturtevant:
Iterative Budgeted Exponential Search. IJCAI 2019: 1249-1257 - [c34]Dâmaris S. Bento, André Grahl Pereira, Levi H. S. Lelis:
Procedural Generation of Initial States of Sokoban. IJCAI 2019: 4651-4657 - [e2]Gillian Smith, Levi Lelis:
Proceedings of the Fifteenth AAAI Conference on Artificial Intelligence and Interactive Digital Entertainment, AIIDE 2019, October 8-12, 2019, Atlanta, Georgia, USA. AAAI Press 2019, ISBN 978-1-57735-819-0 [contents] - [i5]Laurent Orseau, Levi H. S. Lelis, Tor Lattimore:
Zooming Cautiously: Linear-Memory Heuristic Search With Node Expansion Guarantees. CoRR abs/1906.03242 (2019) - [i4]Dâmaris S. Bento, André Grahl Pereira, Levi H. S. Lelis:
Procedural Generation of Initial States of Sokoban. CoRR abs/1907.02548 (2019) - [i3]Malte Helmert, Tor Lattimore, Levi H. S. Lelis, Laurent Orseau, Nathan R. Sturtevant:
Iterative Budgeted Exponential Search. CoRR abs/1907.13062 (2019) - 2018
- [j5]Santiago Ontañón, Nicolas A. Barriga, Cleyton R. Silva, Rubens O. Moraes, Levi H. S. Lelis:
The First microRTS Artificial Intelligence Competition. AI Mag. 39(1): 75-83 (2018) - [j4]Levi H. S. Lelis, Willian M. P. Reis, Ya'akov Gal:
Procedural Generation of Game Maps With Human-in-the-Loop Algorithms. IEEE Trans. Games 10(3): 271-280 (2018) - [c33]Rubens O. Moraes, Levi H. S. Lelis:
Asymmetric Action Abstractions for Multi-Unit Control in Adversarial Real-Time Games. AAAI 2018: 876-883 - [c32]Rubens O. Moraes, Julian R. H. Mariño, Levi H. S. Lelis:
Nested-Greedy Search for Adversarial Real-Time Games. AIIDE 2018: 67-73 - [c31]Rubens O. Moraes, Julian R. H. Mariño, Levi H. S. Lelis, Mario A. Nascimento:
Action Abstractions for Combinatorial Multi-Armed Bandit Tree Search. AIIDE 2018: 74-80 - [c30]Laurent Orseau, Levi Lelis, Tor Lattimore, Theophane Weber:
Single-Agent Policy Tree Search With Guarantees. NeurIPS 2018: 3205-3215 - [i2]Laurent Orseau, Levi H. S. Lelis, Tor Lattimore, Théophane Weber:
Single-Agent Policy Tree Search With Guarantees. CoRR abs/1811.10928 (2018) - 2017
- [c29]Rafael R. Padovani, Lucas N. Ferreira, Levi H. S. Lelis:
Bardo: Emotion-Based Music Recommendation for Tabletop Role-Playing Games. AIIDE 2017: 214-220 - [c28]Adam Summerville, Julian R. H. Mariño, Sam Snodgrass, Santiago Ontañón, Levi H. S. Lelis:
Understanding mario: an evaluation of design metrics for platformers. FDG 2017: 8:1-8:10 - [c27]Levi H. S. Lelis:
Stratified Strategy Selection for Unit Control in Real-Time Strategy Games. IJCAI 2017: 3735-3741 - [c26]Santiago Franco, Álvaro Torralba, Levi H. S. Lelis, Mike Barley:
On Creating Complementary Pattern Databases. IJCAI 2017: 4302-4309 - [i1]Rubens O. Moraes, Levi H. S. Lelis:
Asymmetric Action Abstractions for Multi-Unit Control in Adversarial Real-Time Games. CoRR abs/1711.08101 (2017) - 2016
- [j3]Levi H. S. Lelis, Roni Stern, Shahab Jabbari Arfaee, Sandra Zilles, Ariel Felner, Robert C. Holte:
Predicting optimal solution costs with bidirectional stratified sampling in regular search spaces. Artif. Intell. 230: 51-73 (2016) - [c25]Roni Stern, Levi H. S. Lelis:
What's Hot in Heuristic Search. AAAI 2016: 4340-4342 - [c24]Julian R. H. Mariño, Levi H. S. Lelis:
A Computational Model Based on Symmetry for Generating Visually Pleasing Maps of Platform Games. AIIDE 2016: 65-71 - [c23]Leonardo T. Pereira, Claudio Fabiano Motta Toledo, Lucas N. Ferreira, Levi H. S. Lelis:
Learning to Speed Up Evolutionary Content Generation in Physics-Based Puzzle Games. ICTAI 2016: 901-907 - [c22]Levi H. S. Lelis, Santiago Franco, Marvin Abisrror, Mike Barley, Sandra Zilles, Robert C. Holte:
Heuristic Subset Selection in Classical Planning. IJCAI 2016: 3185-3191 - [c21]Levi H. S. Lelis, Richard Anthony Valenzano, Gabriel L. Nazar, Roni Stern:
Searching with a Corrupted Heuristic. SOCS 2016: 63-71 - 2015
- [c20]Julian R. H. Mariño, Willian M. P. Reis, Levi H. S. Lelis:
An Empirical Evaluation of Evaluation Metrics of Procedurally Generated Mario Levels. AIIDE 2015: 44-50 - [c19]Jeeva Paudel, Levi H. S. Lelis, José Nelson Amaral:
Stratified sampling for even workload partitioning applied to single source shortest path algorithm. CASCON 2015: 80-89 - [c18]Willian M. P. Reis, Levi H. S. Lelis, Ya'akov (Kobi) Gal:
Human computation for procedural content generation in platform games. CIG 2015: 99-106 - [c17]Jeeva Paudel, Levi H. S. Lelis, José Nelson Amaral:
Stratified Sampling for Even Workload Partitioning Applied to IDA* and Delaunay Algorithms. IPDPS 2015: 460-469 - [c16]Rina Dechter, Levi H. S. Lelis, Lars Otten:
Caching in Context-Minimal OR Spaces. SOCS 2015: 171-175 - [c15]Julian R. H. Mariño, Levi H. S. Lelis:
Feature Selection as State-Space Search: An Empirical Study in Clustering Problems. SOCS 2015: 191-195 - [e1]Levi Lelis, Roni Stern:
Proceedings of the Eighth Annual Symposium on Combinatorial Search, SOCS 2015, 11-13 June 2015, Ein Gedi, the Dead Sea, Israel. AAAI Press 2015, ISBN 978-1-57735-732-2 [contents] - 2014
- [j2]Levi H. S. Lelis, Roni Stern, Ariel Felner, Sandra Zilles, Robert C. Holte:
Predicting optimal solution cost with conditional probabilities - Predicting optimal solution cost. Ann. Math. Artif. Intell. 72(3-4): 267-295 (2014) - [c14]Levi H. S. Lelis, Lars Otten, Rina Dechter:
Memory-Efficient Tree Size Prediction for Depth-First Search in Graphical Models. CP 2014: 481-496 - [c13]Levi H. S. Lelis, Roni Stern, Nathan R. Sturtevant:
Estimating Search Tree Size with Duplicate Detection. SOCS 2014: 114-122 - 2013
- [j1]Levi H. S. Lelis, Sandra Zilles, Robert C. Holte:
Predicting the size of IDA*'s search tree. Artif. Intell. 196: 53-76 (2013) - [c12]Levi H. S. Lelis, Sandra Zilles, Robert C. Holte:
Stratified tree search: a novel suboptimal heuristic search algorithm. AAMAS 2013: 555-562 - [c11]Levi H. S. Lelis, Lars Otten, Rina Dechter:
Predicting the Size of Depth-First Branch and Bound Search Trees. IJCAI 2013: 594-600 - [c10]Levi H. S. Lelis:
Active Stratified Sampling with Clustering-Based Type Systems for Predicting the Search Tree Size of Problems with Real-Valued Heuristics. SOCS 2013: 123-132 - 2012
- [c9]Levi Lelis, Sandra Zilles, Robert C. Holte:
Fast and Accurate Predictions of IDA*'s Performance. AAAI 2012: 514-520 - [c8]Levi Lelis, Roni Stern, Ariel Felner, Sandra Zilles, Robert C. Holte:
Predicting Optimal Solution Cost with Bidirectional Stratified Sampling. ICAPS 2012 - [c7]Jordan Tyler Thayer, Roni Stern, Levi H. S. Lelis:
Are We There Yet? - Estimating Search Progress. SOCS 2012: 129-136 - [c6]Levi H. S. Lelis, Shahab Jabbari Arfaee, Sandra Zilles, Robert C. Holte:
Learning Heuristic Functions Faster by Using Predicted Solution Costs. SOCS 2012: 166-167 - [c5]Levi H. S. Lelis, Roni Stern, Ariel Felner, Sandra Zilles, Robert C. Holte:
Predicting Optimal Solution Cost with Bidirectional Stratified Sampling (Abstract). SOCS 2012: 186-187 - 2011
- [c4]Levi Lelis, Sandra Zilles, Robert C. Holte:
Time Complexity of Iterative-Deepening A*: The Informativeness Pathology (Abstract). AAAI 2011: 1800-1801 - [c3]Levi Lelis, Roni Stern, Shahab Jabbari Arfaee:
Predicting Solution Cost with Conditional Probabilities. SOCS 2011: 100-107 - [c2]Levi Lelis, Sandra Zilles, Robert C. Holte:
Improved Prediction of IDA*'s Performance via Epsilon-Truncation. SOCS 2011: 108-116
2000 – 2009
- 2009
- [c1]Levi Lelis, Jörg Sander:
Semi-supervised Density-Based Clustering. ICDM 2009: 842-847
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-10-07 22:24 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:
