6365 search results - page 843 / 1273 » Fast Local Computation Algorithms |
165
click to vote
ATAL
2007
Springer
16 years 1 months ago
2007
Springer
This paper proposes a new variant of the task allocation problem, where the agents are connected in a social network and tasks arrive at the agents distributed over the network. W...
221
click to vote
ICS
1994
Tsinghua U.
15 years 11 months ago
1994
Tsinghua U.
We present a parallel code generation algorithm for complete applications and a new experimental methodology that tests the efficacy of our approach. The algorithm optimizes for d...
147
click to vote
EUC
2006
Springer
15 years 11 months ago
2006
Springer
Runtime data alignment has been paid attention recently since it can allocate data segment to processors dynamically according to applications' requirement. One of the key opt...
247
click to vote
PAMI
2010
15 years 2 months ago
2010
The Earth Mover's Distance (EMD) is a similarity measure that captures perceptual difference between two distributions. Its computational complexity, however, prevents a direc...
213
click to vote
PODC
2010
ACM
15 years 11 months ago
2010
ACM
We introduce Multi-Trials, a new technique for symmetry breaking for distributed algorithms and apply it to various problems in general graphs. For instance, we present three rand...