6105 search results - page 237 / 1221 » A Parallel Algorithm for Bound-Smoothing |
213
click to vote
PPSN
2010
Springer
15 years 4 months ago
2010
Springer
The all-pairs shortest path problem is the first non-artificial problem for which it was shown that adding crossover can significantly speed up a mutation-only evolutionary algorit...
220
click to vote
ICDCN
2011
Springer
14 years 10 months ago
2011
Springer
In this paper, we propose to use graph-mining techniques to understand the communication pattern within a data-centre. We model the communication observed within a data-centre as a...
173
click to vote
IPPS
2007
IEEE
16 years 24 days ago
2007
IEEE
Applications such as parallel computing, online games, and content distribution networks need to run on a set of resources with particular network connection characteristics to ge...
179
click to vote
IPPS
2006
IEEE
16 years 16 days ago
2006
IEEE
Efficient multisite job scheduling facilitates the cooperation of multi-domain massively parallel processor systems in a computing grid environment. However, co-allocation, hetero...
144
click to vote
ICS
1989
Tsinghua U.
15 years 10 months ago
1989
Tsinghua U.
We consider iterative algorithms of the form z := f(z), executed by a parallel or distributed computing system. We focus on asynchronous implementations whereby each processor ite...