Research Explorer
Papers
Conferences
Authors
Topics
Keywords
Trends
Achievements
Explore
← Optimization
Mathematics & Optimization
›
Optimization
›
Online Algorithms
2190 directly classified papers
Papers per year
2002: 2
2003: 1
2005: 1
2006: 6
2007: 6
2008: 10
2009: 14
2010: 16
2011: 35
2012: 31
2013: 44
2014: 48
2015: 59
2016: 77
2017: 91
2018: 126
2019: 181
2020: 225
2021: 282
2022: 277
2023: 337
2024: 229
2025: 69
2026: 23
Papers
In-Domain African Languages Translation Using LLMs and Multi-armed Bandits
ACL 2025
Vib2Move: In-hand Object Reconfiguration via Fingertip Micro-vibrations
RSS 2025
Are Optimal Algorithms Still Optimal? Rethinking Sorting in LLM-Based Pairwise Ranking with Batching and Caching
ACL 2025
Disentangling the Dual Role of NIC Receive Rings
OSDI 2025
Kamino: Efficient VM Allocation at Scale with Latency-Driven Cache-Aware Scheduling
OSDI 2025
Enhancing Network Failure Mitigation with Performance-Aware Ranking
NSDI 2025
SIRD: A Sender-Informed, Receiver-Driven Datacenter Transport Protocol
NSDI 2025
The Benefits and Limitations of User Interrupts for Preemptive Userspace Scheduling
NSDI 2025
Large Network UWB Localization: Algorithms and Implementation
NSDI 2025
Building Massive MIMO Baseband Processing on a Single-Node Supercomputer
NSDI 2025
Efficient Methods for Non-stationary Online Learning
JMLR 2025
Improving Community-Participated Patrol for Anti-Poaching
AAAI 2025
Adaptive Merchant-Centric Risk Control via Unbiased Decision-Making and Dynamic Optimization in E-Commerce
AAAI 2025
Approximating Optimal Labelings for Temporal Connectivity
AAAI 2025
Parallel Greedy Best-First Search with a Bound on Expansions Relative to Sequential Search
AAAI 2025
Augmenting Online Algorithms for Knapsack Problem with Total Weight Information
AAAI 2025
Improved Bounds for Online Facility Location with Predictions
AAAI 2025
Solving Multiagent Path Finding on Highly Centralized Networks
AAAI 2025
Reputation-aware Revenue Allocation for Auction-based Federated Learning
AAAI 2025
Doubly-Bounded Queue for Constrained Online Learning: Keeping Pace with Dynamics of Both Loss and Constraint
AAAI 2025
Revisiting Projection-Free Online Learning with Time-Varying Constraints
AAAI 2025
Online Nonsubmodular Optimization with Delayed Feedback in the Bandit Setting
AAAI 2025
Safe Online Convex Optimization with Heavy-Tailed Observation Noises
AAAI 2025
Online and Streaming Algorithms for Constrained k-Submodular Maximization
AAAI 2025
On the Asymptotic Optimality of Confidence Interval Based Algorithms for Fixed Confidence MABs
AAAI 2025
<
1
2
3
4
5
…
88
>