147 search results - page 20 / 30 » An optimal lower bound for anonymous scheduling mechanisms |
CORR
2006
Springer
14 years 11 months ago
2006
Springer
We consider the multiple-access communication problem in a distributed setting for both the additive white Gaussian noise channel and the discrete memoryless channel. We propose a ...
MST
2000
14 years 11 months ago
2000
We consider the problem of processing a given number of tasks on a given number of processors as quickly as possible when only vague information about the processing time of a task...
103
click to vote
EMSOFT
2009
Springer
15 years 3 months ago
2009
Springer
This paper addresses the question of producing modular sequential imperative code from synchronous data-flow networks. Precisely, given a system with several input and output flow...
RTCSA
1999
IEEE
15 years 4 months ago
1999
IEEE
In this paper; we describe optimal algorithmsfor incorporating error recovery in the imprecise computation model. In that model eack task compriser a mandatory and an optional par...
PODS
2004
ACM
15 years 11 months ago
2004
ACM
The problem of disk declustering is to distribute data among multiple disks to reduce query response times through parallel I/O. A strictly optimal declustering technique is one t...