Export Citations
Save this search
Please login to be able to save your searches and receive alerts for new content matching your search criteria.
- research-articleJune 2024
- research-articleNovember 2022
Adversarial Bandits with Knapsacks
Journal of the ACM (JACM), Volume 69, Issue 6Article No.: 40, Pages 1–47https://doi.org/10.1145/3557045We consider Bandits with Knapsacks (henceforth, BwK), a general model for multi-armed bandits under supply/budget constraints. In particular, a bandit algorithm needs to solve a well-known knapsack problem: find an optimal packing of items into a limited-...
- research-articleJune 2021
Kernel-based Methods for Bandit Convex Optimization
Journal of the ACM (JACM), Volume 68, Issue 4Article No.: 25, Pages 1–35https://doi.org/10.1145/3453721We consider the adversarial convex bandit problem and we build the first poly(T)-time algorithm with poly(n) √T-regret for this problem. To do so, we introduce three new ideas in the derivative-free optimization literature: (i) kernel methods, (ii) a ...
- research-articleMay 2019
Bandits and Experts in Metric Spaces
Journal of the ACM (JACM), Volume 66, Issue 4Article No.: 30, Pages 1–77https://doi.org/10.1145/3299873In a multi-armed bandit problem, an online algorithm chooses from a set of strategies in a sequence of trials to maximize the total payoff of the chosen strategies. While the performance of bandit algorithms with a small finite strategy set is well ...
- research-articleMarch 2018
Bandits with Knapsacks
Journal of the ACM (JACM), Volume 65, Issue 3Article No.: 13, Pages 1–55https://doi.org/10.1145/3164539Multi-armed bandit problems are the predominant theoretical model of exploration-exploitation tradeoffs in learning, and they have countless applications ranging from medical trials, to communication networks, to Web search and advertising. In many of ...
-
- research-articleNovember 2015
A Polylogarithmic-Competitive Algorithm for the k-Server Problem
Journal of the ACM (JACM), Volume 62, Issue 5Article No.: 40, Pages 1–49https://doi.org/10.1145/2783434We give the first polylogarithmic-competitive randomized online algorithm for the k-server problem on an arbitrary finite metric space. In particular, our algorithm achieves a competitive ratio of Õ(log3 n log2 k) for any metric space on n points. Our ...
- research-articleMay 2015
Preemptive Uniprocessor Scheduling of Mixed-Criticality Sporadic Task Systems
- Sanjoy Baruah,
- Vincenzo Bonifaci,
- Gianlorenzo D'angelo,
- Haohan Li,
- Alberto Marchetti-Spaccamela,
- Suzanne Van Der Ster,
- Leen Stougie
Journal of the ACM (JACM), Volume 62, Issue 2Article No.: 14, Pages 1–33https://doi.org/10.1145/2699435Systems in many safety-critical application domains are subject to certification requirements. For any given system, however, it may be the case that only a subset of its functionality is safety-critical and hence subject to certification; the rest of ...
- research-articleMay 2013
Paging and list update under bijective analysis
Journal of the ACM (JACM), Volume 60, Issue 2Article No.: 7, Pages 1–18https://doi.org/10.1145/2450142.2450143It has long been known that for the paging problem in its standard form, competitive analysis cannot adequately distinguish algorithms based on their performance: there exists a vast class of algorithms that achieve the same competitive ratio, ranging ...
- research-articleAugust 2012
A Primal-Dual Randomized Algorithm for Weighted Paging
Journal of the ACM (JACM), Volume 59, Issue 4Article No.: 19, Pages 1–24https://doi.org/10.1145/2339123.2339126We study the weighted version of the classic online paging problem where there is a weight (cost) for fetching each page into the cache. We design a randomized O(log k)-competitive online algorithm for this problem, where k is the cache size. This is ...
- research-articleOctober 2011
Hardness of Approximating Flow and Job Shop Scheduling Problems
Journal of the ACM (JACM), Volume 58, Issue 5Article No.: 20, Pages 1–32https://doi.org/10.1145/2027216.2027218We consider several variants of the job shop problem that is a fundamental and classical problem in scheduling. The currently best approximation algorithms have worse than logarithmic performance guarantee, but the only previously known ...
- research-articleAugust 2009
A unified approach to scheduling on unrelated parallel machines
Journal of the ACM (JACM), Volume 56, Issue 5Article No.: 28, Pages 1–31https://doi.org/10.1145/1552285.1552289We develop a single rounding algorithm for scheduling on unrelated parallel machines; this algorithm works well with the known linear programming-, quadratic programming-, and convex programming-relaxations for scheduling to minimize completion time, ...
- articleMarch 2007
Speed scaling to manage energy and temperature
Journal of the ACM (JACM), Volume 54, Issue 1Article No.: 3, Pages 1–39https://doi.org/10.1145/1206035.1206038Speed scaling is a power management technique that involves dynamically changing the speed of a processor. We study policies for setting the speed of the processor for both of the goals of minimizing the energy used and the maximum temperature attained. ...
- articleJanuary 2006
On the Sum-of-Squares algorithm for bin packing
In this article we present a theoretical analysis of the online Sum-of-Squares algorithm (SS) for bin packing along with several new variants. SS is applicable to any instance of bin packing in which the bin capacity B and item sizes s(a) are integral (...
- articleJuly 2005
Source routing and scheduling in packet networks
We study routing and scheduling in packet-switched networks. We assume an adversary that controls the injection time, source, and destination for each packet injected. A set of paths for these packets is admissible if no link in the network is ...
- articleJuly 2004
Nonclairvoyant scheduling to minimize the total flow time on single and parallel machines
Scheduling a sequence of jobs released over time when the processing time of a job is only known at its completion is a classical problem in CPU scheduling in time sharing operating systems. A widely used measure for the responsiveness of the system is ...
- articleSeptember 2003
The geometric maximum traveling salesman problem
We consider the traveling salesman problem when the cities are points in ℝd for some fixed d and distances are computed according to geometric distances, determined by some norm. We show that for any polyhedral norm, the problem of finding a tour of ...
- articleSeptember 2003
Reasoning about temporal relations: The tractable subalgebras of Allen's interval algebra
Allen's interval algebra is one of the best established formalisms for temporal reasoning. This article provides the final step in the classification of complexity for satisfiability problems over constraints expressed in this algebra. When the ...
- articleJuly 2003
Minimizing flow time nonclairvoyantly
We consider the problem of scheduling a collection of dynamically arriving jobs with unknown execution times so as to minimize the average flow time. This is the classic CPU scheduling problem faced by time-sharing operating systems where preemption is ...
- articleMarch 2002
Task assignment with unknown duration
We consider a distributed server system and ask which policy should be used for assigning jobs (tasks) to hosts. In our server, jobs are not preemptible. Also, the job's service demand is not known a priori. We are particularly concerned with the case ...
- articleSeptember 2001
A unified approach to approximating resource allocation and scheduling
We present a general framework for solving resource allocation and scheduling problems. Given a resource of fixed size, we present algorithms that approximate the maximum throughput or the minimum loss by a constant factor. Our approximation factors ...