8780 search results - page 1543 / 1756 » On the Feasibility of Consistent Computations |
188
click to vote
STOC
2005
ACM
16 years 6 months ago
2005
ACM
A celebrated 1976 theorem of Aumann asserts that honest, rational Bayesian agents with common priors will never "agree to disagree": if their opinions about any topic ar...
191
click to vote
STOC
2004
ACM
16 years 6 months ago
2004
ACM
The Collect problem for an asynchronous shared-memory system has the objective for the processors to learn all values of a collection of shared registers, while minimizing the tot...
189
click to vote
SIGMOD
2002
ACM
16 years 6 months ago
2002
ACM
The widespread distribution and availability of smallscale sensors, actuators, and embedded processors is transforming the physical world into a computing platform. One such examp...
174
click to vote
PODC
2009
ACM
16 years 3 months ago
2009
ACM
The era of parallel computing for the masses is here, but writing correct parallel programs remains far more difficult than writing sequential programs. Aside from a few domains,...
166
click to vote
EUROSYS
2006
ACM
16 years 3 months ago
2006
ACM
Distributed systems are hard to build, profile, debug, and test. Monitoring a distributed system – to detect and analyze bugs, test for regressions, identify fault-tolerance pr...