12301 search results - page 2190 / 2461 » Distributed Computation in Dynamic Networks |
133
click to vote
BMCBI
2006
15 years 4 months ago
2006
Background: Computing exact multipoint LOD scores for extended pedigrees rapidly becomes infeasible as the number of markers and untyped individuals increase. When markers are exc...
139
click to vote
ICDCN
2010
Springer
15 years 11 months ago
2010
Springer
Pease et al. introduced the problem of Byzantine Generals (BGP) to study the effects of Byzantine faults in distributed protocols for reliable broadcast. It is well known that BG...
123
click to vote
ISAAC
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. Set agreement is a fundamental problem in distributed computing in which processes collectively choose a small subset of values from a larger set of proposals. The imposs...
139
click to vote
NOSSDAV
2005
Springer
15 years 9 months ago
2005
Springer
An improved prototype of the “voiscape” voice communication medium has been developed and subjectively evaluated. Voiscape enables natural and seamless voice communication by ...
150
click to vote
SPAA
2004
ACM
15 years 9 months ago
2004
ACM
Given a general graph G, a fundamental problem is to find a spanning tree H that best approximates G by some measure. Often this measure is some combination of the congestion and...