Co-occurring keywords · papers mentioning both
Papers
Flexible, Lifelong, Explainable, and Robust Solutions for Multi-Agent Path Finding Problems
AAAI 2026
Eco Search: A No-delay Best-First Search Algorithm for Program Synthesis
AAAI 2025
Multi-View Unsupervised Column Subset Selection via Combinatorial Search (Student Abstract)
AAAI 2025
A SAT Solver + Computer Algebra Attack on the Minimum Kochen–Specker Problem
IJCAI 2024
Can LLMs Fix Issues with Reasoning Models? Towards More Likely Models for AI Planning
AAAI 2024
Sparsest Models Elude Pruning: An Exposé of Pruning’s Current Capabilities
ICML 2024
Co-Certificate Learning with SAT Modulo Symmetries
IJCAI 2023
Electrophysiological Brain Source Imaging via Combinatorial Search with Provable Optimality
AAAI 2023
Monte Carlo Thought Search: Large Language Model Querying for Complex Scientific Reasoning in Catalyst Design
EMNLP 2023
Towards Efficient and Domain-Agnostic Evasion Attack with High-Dimensional Categorical Inputs
AAAI 2023
Complex Query Answering with Neural Link Predictors (Extended Abstract)*
IJCAI 2022
Accelerated Combinatorial Search for Outlier Detection with Provable Bound on Sub-Optimality
AAAI 2021
Complex Query Answering with Neural Link Predictors
ICLR 2021
Unsatisfiability Proofs for Weight 16 Codewords in Lam's Problem
IJCAI 2020
A SAT+CAS Approach to Finding Good Matrices: New Examples and Counterexamples
AAAI 2019
Multi-Agent Path Finding for Large Agents
AAAI 2019
Searching with Consistent Prioritization for Multi-Agent Path Finding
AAAI 2019
HOUDINI: Lifelong Learning as Program Synthesis
NeurIPS 2018
Multi-Agent Path Finding with Deadlines
IJCAI 2018
Embed and Project: Discrete Sampling with Universal Hashing
NeurIPS 2013
Polynomial Time Optimal Query Algorithms for Finding Graphs with Arbitrary Real Weights
COLT 2013