717 search results - page 139 / 144 » Kill-safe synchronization abstractions |
116
Voted
ECAI
2008
Springer
15 years 2 months ago
2008
Springer
Abstract. This paper shows that we can take advantage of information about the probabilities of the occurrences of events, when this information is available, to refine the classic...
100
Voted
SIROCCO
2008
15 years 2 months ago
2008
Abstract. Consider a system composed of n sensors operating in synchronous rounds. In each round an input vector of sensor readings x is produced, where the i-th entry of x is a bi...
89
Voted
SIROCCO
2008
15 years 2 months ago
2008
Abstract. We consider a fixed, undirected, known network and a number of "mobile agents" which can traverse the network in synchronized steps. Some nodes in the network m...
123
click to vote
CORR
2010
Springer
15 years 26 days ago
2010
Springer
r of Abstraction (invited lecture) . . . . . . . . . . . . . . . . . . . . . . . . . . . 3 Barbara Liskov Fast Asynchronous Consensus with Optimal Resilience. . . . . . . . . . . ....
123
click to vote
CORR
2010
Springer
15 years 26 days ago
2010
Springer
Abstract. We present the discrete beeping communication model, which assumes nodes have minimal knowledge about their environment and severely limited communication capabilities. S...