220 search results - page 5 / 44 » Minimizing Average Flow-time : Upper and Lower Bounds |
GLOBECOM
2010
IEEE
14 years 6 months ago
2010
IEEE
In this paper, we design the optimal precoding matrices for amplify-and-forward (AF) multiple-input multipleoutput (MIMO) relay networks. Specifically, we consider a dualhop relay ...
TIT
2008
14 years 9 months ago
2008
In this paper, redundant random ensembles are defined and their average stopping set (SS) weight distributions are analyzed. A redundant random ensemble consists of a set of binar...
ISAAC
2009
Springer
15 years 4 months ago
2009
Springer
The Fermat-Weber center of a planar body Q is a point in the plane from which the average distance to the points in Q is minimal. We first show that for any convex body Q in the ...
ISMVL
2003
IEEE
15 years 2 months ago
2003
IEEE
We consider the path length in decision diagrams for multiple-valued functions. This is an important measure of a decision diagram, since this models the time needed to evaluate t...
SODA
2008
ACM
14 years 11 months ago
2008
ACM
We consider the problem of minimizing average latency cost while obliviously routing traffic in a network with linear latency functions. This is roughly equivalent to minimizing t...