Sciweavers

191 search results - page 29 / 39
» Time Efficient Gossiping in Known Radio Networks
Sort
View
PODC
2009
ACM
14 years 9 months ago
Simple and efficient asynchronous byzantine agreement with optimal resilience
Consider a completely asynchronous network consisting of n parties where every two parties are connected by a private channel. An adversary At with unbounded computing power activ...
Arpita Patra, Ashish Choudhary, C. Pandu Rangan
APDC
1997
13 years 10 months ago
A Parallel Algorithm for Optimal Task Assignment in Distributed Systems
' An efficient assignment of tasks to the processors is imperative for achieving a fast job turnaround time in a parallel or distributed enviornment. The assignment problem is...
Ishfaq Ahmad, Muhammad Kafil
MST
2002
169views more  MST 2002»
13 years 8 months ago
Bulk Synchronous Parallel Algorithms for the External Memory Model
Abstract. Blockwise access to data is a central theme in the design of efficient external memory (EM) algorithms. A second important issue, when more than one disk is present, is f...
Frank K. H. A. Dehne, Wolfgang Dittrich, David A. ...
IJCIA
2002
137views more  IJCIA 2002»
13 years 8 months ago
Co-Evolution in Social Interactions
An interesting problem which has been widely investigated is under what circumstances will a society of rational agents realize some particular stable situations, and whether they ...
Hiroshi Sato, Akira Namatame
KDD
2003
ACM
122views Data Mining» more  KDD 2003»
14 years 9 months ago
Natural communities in large linked networks
We are interested in finding natural communities in largescale linked networks. Our ultimate goal is to track changes over time in such communities. For such temporal tracking, we...
John E. Hopcroft, Omar Khan, Brian Kulis, Bart Sel...