6105 search results - page 220 / 1221 » A Parallel Algorithm for Bound-Smoothing |
179
click to vote
KI
2011
Springer
15 years 1 months ago
2011
Springer
We have parallelized our general game player Ary on a cluster of computers. We propose multiple parallelization algorithms. For the sake of simplicity all our algorithms have proce...
176
click to vote
IPPS
2007
IEEE
16 years 22 days ago
2007
IEEE
A comparative study of parallel metaheuristics executed in grid environments is proposed, having as case study a genetic algorithm, a simulated annealing algorithm and a random se...
152
click to vote
IPPS
1997
IEEE
15 years 10 months ago
1997
IEEE
Star networks were proposedrecently as an attractive alternative to the well-known hypercube models for interconnection networks. Extensive research has been performed that shows ...
168
click to vote
ASIACRYPT
2003
Springer
15 years 10 months ago
2003
Springer
One of the recent thrust areas in research on hyperelliptic curve cryptography has been to obtain explicit formulae for performing arithmetic in the Jacobian of such curves. We con...
140
Voted
CORR
2008
Springer
15 years 6 months ago
2008
Springer
We present parallel and sequential dense QR factorization algorithms that are optimized to avoid communication. Some of these are novel, and some extend earlier work. Communicatio...