2927 search results - page 272 / 586 » Secure Distributed Human Computation |
161
click to vote
PODC
2010
ACM
15 years 8 months ago
2010
ACM
In this paper, we consider the problem of maximizing the throughput of Byzantine agreement, when communication links have finite capacity. Byzantine agreement is a classical probl...
163
click to vote
PODC
2011
ACM
14 years 9 months ago
2011
ACM
This paper focuses on designing incentive mechanisms for overlay multicast systems. Existing proposals on the problem are no longer able to provide proper incentives when rational...
211
click to vote
GRID
2006
Springer
15 years 6 months ago
2006
Springer
Monitoring and correlation of streaming data from multiple sources is becoming increasingly important in many application areas. Example applications include automated commodities...
209
click to vote
CL
2007
Springer
15 years 6 months ago
2007
Springer
The CCS (Calculus of Communicating Systems) process algebra is a well-known formal model of synchronization and communication. It is used for the analysis of safety and liveness i...
178
click to vote
STOC
2002
ACM
16 years 6 months ago
2002
ACM
A fundamental problem of distributed computing is that of simulating a secure broadcast channel, within the setting of a point-to-point network. This problem is known as Byzantine...