6105 search results - page 251 / 1221 » A Parallel Algorithm for Bound-Smoothing |
154
click to vote
IPPS
1999
IEEE
15 years 11 months ago
1999
IEEE
Classical mesh partitioning algorithms were designed for rather static situations, and their straightforward application in a dynamical framework may lead to unsatisfactory result...
154
click to vote
PDPTA
2007
15 years 8 months ago
2007
- In this paper, we study the algorithm design aspects of three newly developed spin-wave architectures. The architectures are capable of simultaneously transmitting multiple signa...
147
click to vote
GECCO
2008
Springer
15 years 7 months ago
2008
Springer
In this paper, we report on our investigation of factors affecting the performance of various parallelization paradigms for multiobjective evolutionary algorithms. Different paral...
158
click to vote
SIGCSE
2008
ACM
15 years 6 months ago
2008
ACM
: The generalized problem of placing n queens on an n-by-n board provides an "embarrassingly parallel" problem for parallel solution. This paper expands on the discussion...
178
click to vote
SOFSEM
2010
Springer
16 years 3 months ago
2010
Springer
We extend the lower bound of Adler et. al [1] and Berenbrink [3] for parallel randomized load balancing algorithms. The setting in these asynchronous and distributed algorithms is...