Sciweavers

2303 search results - page 33 / 461
» Interior-Point Methods in Parallel Computation
Sort
View
APPT
2009
Springer
14 years 3 months ago
Computational Performance of a Parallelized Three-Dimensional High-Order Spectral Element Toolbox
In this paper, a comprehensive performance review of an MPI-based high-order three-dimensional spectral element method C++ toolbox is presented. The focus is put on the performance...
Christoph Bosshard, Roland Bouffanais, Christian C...
TC
2008
13 years 8 months ago
Low-Complexity Bit-Parallel Square Root Computation over GF(2^{m}) for All Trinomials
In this contribution we introduce a low-complexity bit-parallel algorithm for computing square roots over binary extension fields. Our proposed method can be applied for any type ...
Francisco Rodríguez-Henríquez, Guill...
ISSAC
2007
Springer
99views Mathematics» more  ISSAC 2007»
14 years 2 months ago
Computing monodromy via parallel homotopy continuation
Numerical homotopy continuation gives a powerful tool for the applied scientist who seeks solutions to a system of polynomial equations. Techniques from numerical homotopy continu...
Anton Leykin, Frank Sottile
IPPS
2007
IEEE
14 years 3 months ago
Self Adaptive Application Level Fault Tolerance for Parallel and Distributed Computing
Most application level fault tolerance schemes in literature are non-adaptive in the sense that the fault tolerance schemes incorporated in applications are usually designed witho...
Zizhong Chen, Ming Yang, Guillermo A. Francia III,...
CG
2008
Springer
13 years 10 months ago
Parallel Monte-Carlo Tree Search
Monte-Carlo Tree Search (MCTS) is a new best-first search method that started a revolution in the field of Computer Go. Parallelizing MCTS is an important way to increase the stren...
Guillaume Chaslot, Mark H. M. Winands, H. Jaap van...