Periodic broadcast scheduling typically considers a set of discrete data items, characterized by their popularity, size and scheduling cost. A classic goal is the definition of an infinite, periodic schedule that yields ...

In this work, we consider an interesting variant of the well-studied KP model [18] for selfish routing that reflects some influence from the much older Wardrop model [31]. In the new model, user traffics are still unsplittable, ...

The control of large segmented telescopes is a challenging one due to the complexity and high order of the system. The high order dynamics lead to high order controllers that require more memory and faster computations for ...

Uncertainty is an intrinsic phenomenon in control of gene regulatory networks (GRNs). The presence of uncertainty is related to impreciseness of GRN models due to: (1) Errors caused by imperfection of measurement devices ...

In this work, we introduce and study a simple, graph-theoretic model for selfish scheduling among m non-cooperative users over a collection of n machines

In this work, we study the combinatorial structure and the computational complexity of Nash equilibria for a certain game that models selfish routing over a network consisting of m parallel links. We assume a collection ...

Given an arbitrary network, and a routing problem with congestion C and dilation D, a long standing open problem is to show the existence of bufferless routing algorithms with optimal performance guarantees (routing time ...