We consider the task scheduling scenario where the controller activates one from K task
types at each time. Each task induces a random completion time, and a reward is obtained …

In multi-server queueing systems where there is no central queue holding all incoming jobs,
job dispatching policies are used to assign incoming jobs to the queue at one of the servers …

We consider a system consisting of a single transmitter/receiver pair and N channels over
which they may communicate. Packets randomly arrive to the transmitter's queue and wait to …

We consider the task scheduling scenario where the controller activates one from task types
at each time. Each task induces a random completion time, and a reward is obtained only …

In this paper, we study the problem of dynamic channel allocation for URLLC traffic in a multi-
user multichannel wireless network where urgent packets have to be successfully received …

We introduce two classes of measurement-based wireless schedulers. The Opportunistic
Guaranteed Rate Scheduler (OGRS) meets a user's delay constraints by opportunistically …

We consider dynamic rate and channel adaptation in a cognitive radio network serving
heterogeneous applications under dynamically varying channel availability and rate …

In this paper, we address the problem of scheduling real-time traffic over hybrid channels
with throughput constraints in a single-hop downlink wireless network. Unlike previous work …

User dissatisfaction due to buffering pause during streaming is a significant cost to the
system, which we model as a non-decreasing function of the frequency of buffering pause …

Time-constrained decision processes have been ubiquitous in many fundamental
applications in physics, biology and computer science. Recently, restart strategies have …