In the pooled data problem we are given n agents with hidden state bits,...
In this paper we study dynamic averaging load balancing on general graph...
Consider the many shared resource scheduling problem where jobs have to ...
We consider the so-called Independent Cascade Model for rumor spreading ...
We study the Consensus problem among n agents, defined as follows.
Initi...
Opinion spreading in a society decides the fate of elections, the succes...
In the problem called single resource constraint scheduling, we are give...
We study Nonpreemptive Peak Demand Minimization (NPDM) problem, where we...
An important area of combinatorial optimization is the study of packing ...
We study the Multiple Cluster Scheduling problem and the Multiple Strip
...
Integer linear programs of configurations, or configuration IPs, are a
c...
We study pseudo-polynomial Strip Packing. Given a set of rectangular axi...