We consider the issue of deadline tardiness under global multiprocessor scheduling algorithms. We present a general tardiness-bound derivation that is applicable to a wide variety...
This paper considers the multi-input multi-output (MIMO) relay channel where multiple antennas are employed by each terminal. Compared to single-input singleoutput (SISO) relay ch...
Caleb K. Lo, Sriram Vishwanath, Robert W. Heath Jr...
In this paper a two-level hierarchical model for the location of concentrators and routers in computers networks is presented. Given a set of candidate locations and the capacitie...
Queueing networks are studied with finite capacities for clusters of stations, rather than for individual stations. First, an instructive tandem cluster example is studied to show...
Given a graph G, the Shortest Capacitated Paths Problem (SCPP) consists of determining a set of paths of least total length, linking given pairs of vertices in G, and satisfying c...