2924 search results - page 511 / 585 » Lower Bounds in Distributed Computing |
128
Voted
MOBICOM
2006
ACM
15 years 8 months ago
2006
ACM
Mobile sensors cover more area over a period of time than the same number of stationary sensors. However, the quality of coverage achieved by mobile sensors depends on the velocit...
134
Voted
VLDB
2000
ACM
15 years 6 months ago
2000
ACM
Strict consistency of replicated data is infeasible or not required by many distributed applications, so current systems often permit stale replication, in which cached copies of ...
128
click to vote
USS
2008
15 years 5 months ago
2008
We address the problem of auditing an election when precincts may have different sizes. Prior work in this field has emphasized the simpler case when all precincts have the same s...
149
Voted
BMCBI
2006
15 years 2 months ago
2006
Background: Single nucleotide polymorphisms (SNPs) are locations at which the genomic sequences of population members differ. Since these differences are known to follow patterns,...
147
Voted
TC
2010
14 years 9 months ago
2010
In this paper, we define and study a new class of capacity planning models called MAP queueing networks. MAP queueing networks provide the first analytical methodology to describe ...