Sciweavers

24421 search results - page 51 / 4885
» Communicating Complex Systems
Sort
View
TSMC
2008
113views more  TSMC 2008»
13 years 7 months ago
Distributed Diagnosis Under Bounded-Delay Communication of Immediately Forwarded Local Observations
In this paper, we study distributed failure diagnosis under k-bounded communication delay, where each local site transmits its observations to other sites immediately after each o...
Wenbin Qiu, Ratnesh Kumar
CODES
2004
IEEE
13 years 11 months ago
Fast exploration of bus-based on-chip communication architectures
As a result of improvements in process technology, more and more components are being integrated into a single System-on-Chip (SoC) design. Communication between these components ...
Sudeep Pasricha, Nikil D. Dutt, Mohamed Ben-Romdha...
COCO
2001
Springer
161views Algorithms» more  COCO 2001»
14 years 7 days ago
Communication Complexity Lower Bounds by Polynomials
The quantum version of communication complexity allows the two communicating parties to exchange qubits and/or to make use of prior entanglement (shared EPRpairs). Some lower boun...
Harry Buhrman, Ronald de Wolf
SIGECOM
2005
ACM
105views ECommerce» more  SIGECOM 2005»
14 years 1 months ago
Communication complexity of common voting rules
We determine the communication complexity of the common voting rules. The rules (sorted by their communication complexity from low to high) are plurality, plurality with runoff, ...
Vincent Conitzer, Tuomas Sandholm
COCO
2000
Springer
161views Algorithms» more  COCO 2000»
14 years 2 days ago
Characterization of Non-Deterministic Quantum Query and Quantum Communication Complexity
It is known that the classical and quantum query complexities of a total Boolean function f are polynomially related to the degree of its representing polynomial, but the optimal ...
Ronald de Wolf