6105 search results - page 110 / 1221 » A Parallel Algorithm for Bound-Smoothing |
ARCS
2004
Springer
15 years 7 months ago
2004
Springer
Abstract: We report on our experiences with the implementation of a parallel algorithm to compute the cycle structure of a permutation given as an oracle. As a sub-problem, the cyc...
113
click to vote
PARA
2004
Springer
15 years 7 months ago
2004
Springer
We describe the parallelization of an efficient algorithm for balanced truncation that allows to reduce models with state-space dimension up to O(105 ). The major computational tas...
ISSAC
1989
Springer
15 years 5 months ago
1989
Springer
In this paper, we describe a parallelization scheme for Collins’ cylindrical algebraic decomposition algorithm for quantifier elimination in the theory of real closed fields. ...
131
click to vote
KES
1999
Springer
15 years 5 months ago
1999
Springer
Abstract—Dynamic Demes is a new method for the parallelisation of evolutionary algorithms. It was derived as a combination of two other parallelisation algorithms: the master-sla...
112
click to vote
CG
2008
Springer
15 years 3 months ago
2008
Springer
Monte-Carlo tree search is a powerful paradigm for the game of Go. We present a parallel Master-Slave algorithm for Monte-Carlo tree search. We experimented the algorithm on a netw...