2473 search results - page 211 / 495 » The Logic of Communication Graphs |
185
click to vote
ISPA
2004
Springer
15 years 9 months ago
2004
Springer
Static DHT topologies influence important features of such DHTs such as scalability, communication load balancing, routing efficiency and fault tolerance. Nevertheless, it is co...
151
click to vote
BMCBI
2010
15 years 4 months ago
2010
Background: Assembling genomic sequences from a set of overlapping reads is one of the most fundamental problems in computational biology. Algorithms addressing the assembly probl...
115
click to vote
DCC
2007
IEEE
16 years 3 months ago
2007
IEEE
We consider the distributed computation of a function of random sources with minimal communication. Specifically, given two discrete memoryless sources, X and Y , a receiver wishe...
143
click to vote
SIROCCO
2007
15 years 5 months ago
2007
We consider the problem of periodic exploration of all nodes in undirected graphs by using a nite state automaton called later a robot. The robot, using a constant number of state...
161
click to vote
CN
2010
15 years 23 days ago
2010
Probabilistic flooding has been frequently considered as a suitable dissemination information approach for limiting the large message overhead associated with traditional (full) f...