30 citations · 165 across the 49 of their papers we have counts for
7 papers · 1 filter
On the Asymptotic Optimality of Work-Conserving Disciplines in Completion Time Minimization
Wenxin Li
In this paper, we prove that under mild stochastic assumptions, work-conserving disciplines are asymptotic optimal for minimizing total completion time. As a byproduct of our analy…
Optimizing Information Freshness using Low-Power Status Updates via Sleep-Wake Scheduling
Ahmed M. Bedewy, Yin Sun, Rahul Singh +1
In this paper, we consider the problem of optimizing the freshness of status updates that are sent from a large number of low-power source nodes to a common access point. The sourc…
Delay-Optimal and Energy-Efficient Communications with Markovian Arrivals
Xiaoyu Zhao, Wei Chen, Joohyun Lee +1
In this paper, delay-optimal and energy-efficient communication is studied for a single link under Markov random arrivals. We present the optimal tradeoff between delay and power o…
Data Poisoning Attacks on Stochastic Bandits
Fang Liu, Ness Shroff
Stochastic multi-armed bandits form a class of online learning problems that have important applications in online recommendation systems, adaptive medical treatment, and many othe…
A Faster FPTAS for Knapsack Problem With Cardinality Constraint
Wenxin Li, Joohyun Lee
We study the -item knapsack problem (i.e., -dimensional KP), which is a generalization of the famous 0-1 knapsack problem (i.e., -dimensional KP) in which an upper bound…
Fundamental Limits of Approximate Gradient Coding
Sinong Wang, Jiashang Liu, Ness Shroff
It has been established that when the gradient coding problem is distributed among servers, the computation load (number of stored data partitions) of each worker is at least $…