1192 search results - page 80 / 239 » Computing Weakest Readings |
116
click to vote
COORDINATION
2005
Springer
15 years 9 months ago
2005
Springer
Abstract. A simple and effective way of coordinating distributed, mobile, and parallel applications is to use a virtual shared memory (VSM), such as a Linda tuple-space. In this p...
128
click to vote
FCT
2005
Springer
15 years 9 months ago
2005
Springer
We review a recently introduced computation model for streaming and external memory data. An important feature of this model is that it distinguishes between sequentially reading (...
145
click to vote
SC
2004
ACM
15 years 8 months ago
2004
ACM
In petabyte-scale distributed file systems that decouple read and write from metadata operations, behavior of the metadata server cluster will be critical to overall system perfo...
109
Voted
SPIN
1999
Springer
15 years 7 months ago
1999
Springer
A pattern-based approach to the presentation, codification and reuse of property specifications for finite-state verification was proposed by Dwyer and his colleagues in [4, 3]...
109
Voted
FOCS
1992
IEEE
15 years 7 months ago
1992
IEEE
We give a new characterization of NP: the class NP contains exactly those languages L for which membership proofs (a proof that an input x is in L) can be verified probabilisticall...