Skip to content
conftrace_

anytime algorithm

50 papers

Papers

An Anytime Algorithm for Good Arm Identification JMLR 2026 A Multiagent Path Search Algorithm for Large-Scale Coalition Structure Generation AAAI 2025 Anytime Multi-Agent Path Finding with an Adaptive Delay-Based Heuristic AAAI 2025 Adaptive Anytime Multi-Agent Path Finding Using Bandit-Based Large Neighborhood Search AAAI 2024 Anytime Sorting Algorithms IJCAI 2024 Practical Anytime Algorithms for Judicious Partitioning of Active Directory Attack Graphs IJCAI 2024 Rectangle Search: An Anytime Beam Search AAAI 2024 Stop! Planner Time: Metareasoning for Probabilistic Planning Using Learned Performance Profiles AAAI 2024 Anytime-Competitive Reinforcement Learning with Policy Prior NeurIPS 2023 Blossom: an Anytime Algorithm for Computing Optimal Decision Trees ICML 2023 Fast Converging Anytime Model Counting AAAI 2023 Improving LaCAM for Scalable Eventually Optimal Multi-Agent Pathfinding IJCAI 2023 Parallel Index-Based Search Algorithm for Coalition Structure Generation (Student Abstract) AAAI 2023 Spike-Based Anytime Perception WACV 2023 Anytime Learning of Sum-Product and Sum-Product-Max Networks PGM 2022 Anytime Multi-Agent Path Finding via Machine Learning-Guided Large Neighborhood Search AAAI 2022 Efficient Algorithms for Extreme Bandits AISTATS 2022 Large Neighbourhood Search for Anytime MaxSAT Solving IJCAI 2022 Offline Vehicle Routing Problem with Online Bookings: A Novel Problem Formulation with Applications to Paratransit IJCAI 2022 Almost Optimal Anytime Algorithm for Batched Multi-Armed Bandits ICML 2021 Anytime Depth Estimation with Limited Sensing and Computation Capabilities on Mobile Devices CoRL 2021 Anytime Heuristic and Monte Carlo Methods for Large-Scale Simultaneous Coalition Structure Generation and Assignment AAAI 2021 Anytime Multi-Agent Path Finding via Large Neighborhood Search IJCAI 2021 Batched Thompson Sampling NeurIPS 2021 Focused Inference and System P AAAI 2021