845 search results - page 91 / 169 » Diagnosabilities of regular networks |
CORR
2006
Springer
13 years 8 months ago
2006
Springer
We propose consensus propagation, an asynchronous distributed protocol for averaging numbers across a network. We establish convergence, characterize the convergence rate for regul...
JPDC
2006
13 years 8 months ago
2006
Minimum Spanning Tree (MST) is one of the most studied combinatorial problems with practical applications in VLSI layout, wireless communication, and distributed networks, recent ...
BC
1999
13 years 7 months ago
1999
An ecient new method for the exact digital simulation of time-invariant linear systems is presented. Such systems are frequently encountered as models for neuronal systems, or as s...
NDSS
2008
IEEE
14 years 2 months ago
2008
IEEE
We study the problem of reliably searching for resources in untrusted peer-to-peer networks, where a significant portion of the participating network nodes may act maliciously to...
ANCS
2007
ACM
14 years 1 days ago
2007
ACM
Programming specialized network processors (NPU) is inherently difficult. Unlike mainstream processors where architectural features such as out-of-order execution and caches hide ...