Sciweavers

284 search results - page 3 / 57
» Distributed Agreement with Optimal Communication Complexity
Sort
View
AUTOMATICA
2011
14 years 4 months ago
Distributed averaging on digital erasure networks
Iterative distributed algorithms are studied for computing arithmetic averages over networks of agents connected through memoryless broadcast erasure channels. These algorithms do...
Ruggero Carli, Giacomo Como, Paolo Frasca, Federic...
CDC
2009
IEEE
126views Control Systems» more  CDC 2009»
15 years 2 months ago
The standard parts problem and the complexity of control communication
The objective of the standard parts optimal control problem is to find a number, m, of control inputs to a given input-output system that can be used in different combinations to...
John Baillieul, Wing Shing Wong
ICDCN
2010
Springer
15 years 1 months ago
On Communication Complexity of Secure Message Transmission in Directed Networks
Abstract. We re-visit the problem of perfectly secure message transmission (PSMT) in a directed network under the presence of a threshold adaptive Byzantine adversary, having unbou...
Arpita Patra, Ashish Choudhary, C. Pandu Rangan
ATAL
2004
Springer
15 years 2 months ago
On the Communication Complexity of Multilateral Trading
We study the complexity of a multilateral negotiation framework where autonomous agents agree on a sequence of deals to exchange sets of discrete resources in order to both furthe...
Ulrich Endriss, Nicolas Maudet
CORR
2006
Springer
104views Education» more  CORR 2006»
14 years 9 months ago
Asymptotically Optimal Multiple-access Communication via Distributed Rate Splitting
We consider the multiple-access communication problem in a distributed setting for both the additive white Gaussian noise channel and the discrete memoryless channel. We propose a ...
Jian Cao, Edmund M. Yeh