5183 search results - page 284 / 1037 » The Complexity of Distributions |
298
click to vote
DCOSS
2011
Springer
14 years 6 months ago
2011
Springer
—Available algorithms for the distributed construction of connected dominating sets in mobile ad hoc networks are inapplicable or suffer from a high complexity. This is mainly du...
224
click to vote
FTDCS
2004
IEEE
15 years 10 months ago
2004
IEEE
Peer-to-peer systems have the desirable property that the amount of resources available in the system increase as demand for services increases due to growth of the system. We exp...
171
click to vote
COORDINATION
2007
Springer
16 years 24 days ago
2007
Springer
Connectors have emerged as a powerful concept for composition and coordination of concurrent activities encapsulated as components and services. Compositional coordination models a...
217
click to vote
PODC
2011
ACM
14 years 9 months ago
2011
ACM
This work studies decision problems from the perspective of nondeterministic distributed algorithms. For a yes-instance there must exist a proof that can be verified with a distri...
181
click to vote
TCOM
2010
15 years 5 months ago
2010
—The optimal performance-complexity tradeoff for error-correcting codes at rates strictly below the Shannon limit is a central question in coding theory. This paper proposes a nu...