2924 search results - page 278 / 585 » Lower Bounds in Distributed Computing |
141
Voted
TIT
1998
15 years 3 months ago
1998
—A sequential decoder for linear block codes that performs maximum-likelihood soft-decision decoding is described. The decoder uses a metric computed from a lower bound on the co...
123
click to vote
SPAA
2010
ACM
15 years 8 months ago
2010
ACM
In dynamically multithreaded platforms that employ work stealing, there appears to be a fundamental tradeoff between providing provably good time and space bounds and supporting S...
148
click to vote
SIGSOFT
2007
ACM
16 years 4 months ago
2007
ACM
The standard language for describing the asymptotic behavior of algorithms is theoretical computational complexity. We propose a method for describing the asymptotic behavior of p...
118
click to vote
WAOA
2007
Springer
15 years 10 months ago
2007
Springer
We consider the following distributed optimization problem: three agents i = 1, 2, 3 are each presented with a load drawn independently from the same known prior distribution. Then...
135
click to vote
ICPADS
2005
IEEE
15 years 9 months ago
2005
IEEE
We study decentralised low delay degree-constrained overlay multicast tree construction for single source real-time applications. This optimisation problem is NP-hard even if comp...