Sciweavers

1243 search results - page 223 / 249
» FPZL Schedulability Analysis
Sort
View
IPL
2010
112views more  IPL 2010»
14 years 11 months ago
The cost of probabilistic agreement in oblivious robot networks
In this paper, we look at the time complexity of two agreement problems in networks of oblivious mobile robots, namely, at the gathering and scattering problems. Given a set of ro...
Julien Clement, Xavier Défago, Maria Gradin...
102
Voted
JUCS
2010
108views more  JUCS 2010»
14 years 11 months ago
Integrating Social Networks for Context Fusion in Mobile Service Platforms
: It is important for mobile service providers to be aware of user contexts and to provide contextually relevant mobile services to users. Thereby, in this paper, we propose a nove...
Jason J. Jung
QUESTA
2010
107views more  QUESTA 2010»
14 years 11 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...
QUESTA
2010
131views more  QUESTA 2010»
14 years 11 months ago
Asymptotically optimal parallel resource assignment with interference
Motivated by scheduling in cellular wireless networks and resource allocation in computer systems, we study a service facility with two classes of users having heterogeneous servi...
Maaike Verloop, R. Núñez Queija
TCOM
2010
111views more  TCOM 2010»
14 years 10 months ago
Design of irregular LDPC codes with optimized performance-complexity tradeoff
—The optimal performance-complexity tradeoff for error-correcting codes at rates strictly below the Shannon limit is a central question in coding theory. This paper proposes a nu...
Benjamin Smith, Masoud Ardakani, Wei Yu, Frank R. ...