Co-occurring keywords · papers mentioning both
Papers
Multi-Agent Corridor Reasoning for Multi-Agent Path Finding
AAAI 2026
An Asymptotically Optimal Coordinate Descent Algorithm for Learning Bayesian Networks from Gaussian Models
JMLR 2025
Bidirectional Search while Ensuring Meet-In-The-Middle via Effective and Efficient-to-Compute Termination Conditions
IJCAI 2025
Branches: Efficiently Seeking Optimal Sparse Decision Trees via AO*
ICML 2025
Utilitarian Algorithm Configuration for Infinite Parameter Spaces
ICLR 2025
A Unified Linear Programming Framework for Offline Reward Learning from Human Demonstrations and Feedback
ICML 2024
Optimal Survival Trees: A Dynamic Programming Approach
AAAI 2024
G*: A New Approach to Bounding Curvature Constrained Shortest Paths through Dubins Gates
RSS 2023
Combining Constraint Solving and Bayesian Techniques for System Optimization
IJCAI 2022
Sparse Tree Search Optimality Guarantees in POMDPs with Continuous Observation Spaces
IJCAI 2020
Enriching Non-Parametric Bidirectional Search Algorithms
AAAI 2019
How to tell when a clustering is (approximately) correct using convex relaxations
NeurIPS 2018
A Practical Scheme and Fast Algorithm to Tune the Lasso With Optimality Guarantees
JMLR 2016
Near Optimal Behavior via Approximate State Abstraction
ICML 2016
Maximum Persistency via Iterative Relaxed Inference With Graphical Models
CVPR 2015
Motion Planning for Unlabeled Discs with Optimality Guarantees
RSS 2015