Sciweavers

554 search results - page 76 / 111
» Approximability of OFDMA Scheduling
Sort
View
APPROX
2006
Springer
124views Algorithms» more  APPROX 2006»
15 years 1 months ago
Combinatorial Algorithms for Data Migration to Minimize Average Completion Time
The data migration problem is to compute an efficient plan for moving data stored on devices in a network from one configuration to another. It is modeled by a transfer graph, wher...
Rajiv Gandhi, Julián Mestre
QUESTA
2010
107views more  QUESTA 2010»
14 years 8 months ago
On the inapproximability of M/G/K: why two moments of job size distribution are not enough
The M/G/K queueing system is one of the oldest model for multi-server systems, and has been the topic of performance papers for almost half a century. However, even now, only coar...
Varun Gupta, Mor Harchol-Balter, J. G. Dai, Bert Z...
INFOCOM
2009
IEEE
15 years 4 months ago
Computing the Capacity Region of a Wireless Network
—We consider a wireless network of n nodes that communicate over a common wireless medium under some interference constraints. Our work is motivated by the need for an efficient...
Ramakrishna Gummadi, Kyomin Jung, Devavrat Shah, R...
ALDT
2009
Springer
172views Algorithms» more  ALDT 2009»
15 years 4 months ago
On Multi-dimensional Envy-Free Mechanisms
Traditional performance analysis of approximation algorithms considers overall performance, while economic fairness analysis focuses on the individual performance each user receiv...
Ahuva Mu'alem
GCC
2005
Springer
15 years 3 months ago
An Efficient Network Information Model Using NWS for Grid Computing Environments
Grid computing technologies enable large-scale aggregation and sharing of resources via wide-area networks focused on sharing computational, data, and other resources to form gener...
Chao-Tung Yang, Po-Chi Shih, Sung-Yi Chen, Wen-Chu...