Sciweavers

495 search results - page 68 / 99
» Information theory of wideband communications
Sort
View
70
Voted
PODC
2009
ACM
15 years 10 months ago
Bounding the locality of distributed routing algorithms
d Abstract] Prosenjit Bose School of Computer Science Carleton University Ottawa, Canada jit@scs.carleton.ca Paz Carmi Dept. of Computer Science Ben-Gurion Univ. of the Negev Beer-...
Prosenjit Bose, Paz Carmi, Stephane Durocher
PODC
2012
ACM
13 years 3 days ago
Byzantine broadcast in point-to-point networks using local linear coding
The goal of Byzantine Broadcast (BB) is to allow a set of fault-free nodes to agree on information that a source node wants to broadcast to them, in the presence of Byzantine faul...
Guanfeng Liang, Nitin H. Vaidya
110
Voted
IWLCS
2005
Springer
15 years 3 months ago
Counter Example for Q-Bucket-Brigade Under Prediction Problem
Aiming to clarify the convergence or divergence conditions for Learning Classifier System (LCS), this paper explores: (1) an extreme condition where the reinforcement process of ...
Atsushi Wada, Keiki Takadama, Katsunori Shimohara
STOC
2010
ACM
211views Algorithms» more  STOC 2010»
15 years 2 months ago
Distributed Computation in Dynamic Networks
In this paper we investigate distributed computation in dynamic networks in which the network topology changes from round to round. We consider a worst-case model in which the com...
Fabian Kuhn, Nancy Lynch and Rotem Oshman
CHI
2011
ACM
14 years 1 months ago
Collaborative creativity: a complex systems model with distributed affect
The study of creativity has received significant attention over the past century, with a recent increase in interest in collaborative, distributed creativity. We posit that creati...
Cecilia R. Aragon, Alison Williams