2814 search results - page 135 / 563 » Competitive Analysis of Distributed Algorithms |
145
Voted
ICASSP
2009
IEEE
15 years 9 months ago
2009
IEEE
Abstract –In this paper, a variational message passing framework is proposed for Markov random fields, which is computationally more efficient and admits wider applicability comp...
132
Voted
SPAA
2004
ACM
15 years 8 months ago
2004
ACM
This paper presents the first polylogarithmic-competitive online algorithms for two-metric network design problems. These problems arise naturally in the design of computer netwo...
109
click to vote
PPSN
2004
Springer
15 years 8 months ago
2004
Springer
Current Genetic Algorithms can efficiently address order-k separable problems, in which the order of the linkage is restricted to a low value k. Outside this class, there exist hie...
113
Voted
CORR
2011
Springer
14 years 9 months ago
2011
Springer
With the explosion of the size of digital dataset, the limiting factor for decomposition algorithms is the number of passes over the input, as the input is often stored out-of-cor...
144
click to vote
IPPS
2003
IEEE
15 years 7 months ago
2003
IEEE
In this paper we present an algorithm for scheduling parallel applications that consist of a divisible workload. Our algorithm uses multiple rounds to overlap communication and co...