948 search results - page 6 / 190 » What can we achieve by arbitrary announcements |
CORR
2010
Springer
13 years 4 months ago
2010
Springer
Abstract--Recently, it has been shown that a quantize-mapand-forward scheme approximately achieves (within a constant number of bits) the Gaussian relay network capacity for arbitr...
PODC
2010
ACM
13 years 10 months ago
2010
ACM
We present Gatekeeper, a decentralized protocol that performs Sybil-resilient node admission control based on a social network. Gatekeeper can admit most honest nodes while limiti...
ICC
2007
IEEE
14 years 1 months ago
2007
IEEE
— Discrete input distributions are capacity-achieving for a variety of noise distributions whenever the input is subject to peak power or other bounding constraints. In this pape...
TARK
2005
Springer
14 years 9 days ago
2005
Springer
Current dynamic epistemic logics often become cumbersome and opaque when common knowledge is added for groups of agents. Still, postconditions regarding common knowledge express t...
ICDCIT
2005
Springer
14 years 10 days ago
2005
Springer
In this paper, we consider a contaminated network with an intruder. The task for the mobile agents is to decontaminate all hosts while preventing a recontamination and to do so as ...