416 search results - page 7 / 84 » A Paradigm for Parallel Matrix Algorithms: |
IPPS
2002
IEEE
15 years 3 months ago
2002
IEEE
: A novel broadcast technique for wormhole-routed mesh and torus parallel computers based on recursion is presented in this paper. It works by partitioning the graph into several s...
IPPS
1999
IEEE
15 years 3 months ago
1999
IEEE
The known fast sequential algorithms for multiplying two N N matrices (over an arbitrary ring) have time complexity ON , where 2 3. The current best value of is less than 2.3755....
103
click to vote
PPSN
2004
Springer
15 years 4 months ago
2004
Springer
Abstract. Evolution Strategies, Evolutionary Algorithms based on Gaussian mutation and deterministic selection, are today considered the best choice as far as parameter optimizatio...
SPAA
1999
ACM
15 years 3 months ago
1999
ACM
Matrix multiplication is an important kernel in linear algebra algorithms, and the performance of both serial and parallel implementations is highly dependent on the memory system...
TROB
2002
14 years 10 months ago
2002
Abstract--This paper investigates the synthesis of a spatial stiffness matrix using simple line springs. A new algorithm is developed, which enables the selection of constituent sp...