Sciweavers

608 search results - page 29 / 122
» Random Systems with Complete Connections
Sort
View
CDC
2008
IEEE
162views Control Systems» more  CDC 2008»
14 years 4 months ago
Average consensus by gossip algorithms with quantized communication
— This work studies how the randomized gossip algorithm can solve the average consensus problem on networks with quantized communications. The algorithm is proved to converge to ...
Paolo Frasca, Ruggero Carli, Fabio Fagnani, Sandro...
ASYNC
2000
IEEE
145views Hardware» more  ASYNC 2000»
14 years 2 months ago
Practical Design of Globally-Asynchronous Locally-Synchronous Systems
In this paper we describe a complete design methodology for a globally asynchronous onchip communication network connecting both locally-synchronous and asynchronous modules. Sync...
Jens Muttersbach, Thomas Villiger, Wolfgang Fichtn...
ICPADS
2008
IEEE
14 years 4 months ago
Integrity-Preserving Replica Coordination for Byzantine Fault Tolerant Systems
The use of good random numbers is essential to the integrity of many mission-critical systems. However, when such systems are replicated for Byzantine fault tolerance, a serious i...
Wenbing Zhao
ACSAC
2006
IEEE
14 years 3 months ago
Address Space Layout Permutation (ASLP): Towards Fine-Grained Randomization of Commodity Software
Address space randomization is an emerging and promising method for stopping a broad range of memory corruption attacks. By randomly shifting critical memory regions at process in...
Chongkyung Kil, Jinsuk Jun, Christopher Bookholt, ...
GLOBECOM
2009
IEEE
14 years 4 months ago
Random Linear Network Coding for Time-Division Duplexing: Field Size Considerations
Abstract— We study the effect of the field size on the performance of random linear network coding for time division duplexing channels proposed in [1]. In particular, we study ...
Daniel Enrique Lucani, Muriel Médard, Milic...