Co-occurring keywords · papers mentioning both
Papers
A Greedy Anytime Algorithm for Sparse PCA
COLT 2020
A Particle Swarm Based Algorithm for Functional Distributed Constraint Optimization Problems
AAAI 2020
Monte-Carlo Tree Search for Scalable Coalition Formation
IJCAI 2020
Reliable and Efficient Anytime Skeleton Learning
AAAI 2020
Anytime Heuristic for Weighted Matching Through Altruism-Inspired Behavior
IJCAI 2019
Anytime Recursive Best-First Search for Bounding Marginal MAP
AAAI 2019
Efficient Data Point Pruning for One-Class SVM
AAAI 2019
Path Planning with CPD Heuristics
IJCAI 2019
Procrastinating with Confidence: Near-Optimal, Anytime, Adaptive Algorithm Configuration
NeurIPS 2019
Meta-Level Control of Anytime Algorithms with Online Performance Prediction
IJCAI 2018
Stochastic Anytime Search for Bounding Marginal MAP
IJCAI 2018
Unsatisfiable Core Shrinking for Anytime Answer Set Optimization
IJCAI 2017
Anytime Exploration for Multi-armed Bandits using Confidence Information
ICML 2016
Anytime optimal algorithms in stochastic multi-armed bandits
ICML 2016
Anytime Recognition of Objects and Scenes
CVPR 2014
Asynchronous Anytime Sequential Monte Carlo
NeurIPS 2014
Combining 3D Shape, Color, and Motion for Robust Anytime Tracking
RSS 2014
Deterministic Anytime Inference for Stochastic Continuous-Time Markov Processes
ICML 2014
Online Stochastic Optimization under Correlated Bandit Feedback
ICML 2014
Efficient, guaranteed search with multi-agent teams
RSS 2009
Toward Provably Correct Feature Selection in Arbitrary Domains
NeurIPS 2009
Planning Long Dynamically-Feasible Maneuvers For Autonomous Vehicles
RSS 2008
Predictive Indexing for Fast Search
NeurIPS 2008
Anytime Induction of Cost-sensitive Trees
NeurIPS 2007
Anytime Learning of Decision Trees
JMLR 2007