Sciweavers

8669 search results - page 217 / 1734
» Computing matrix representations
Sort
View
ICTAI
2006
IEEE
14 years 3 months ago
Computing the Equilibria of Bimatrix Games Using Dominance Heuristics
We propose a formulation of a general-sum bimatrix game as a bipartite directed graph with the objective of establishing a correspondence between the set of the relevant structure...
Raghav Aras, Alain Dutech, François Charpil...
PARA
1994
Springer
14 years 1 months ago
Parallel Computation of the Eigenstructure of Toeplitz-plus-Hankel Matrices on Multicomputers
In this paper we present four parallel algorithms to compute any group of eigenvalues and eigenvectors of a Toeplitz-plus-Hankel matrix. These algorithms parallelize a method that...
José M. Badía, Antonio M. Vidal
EGH
2007
Springer
14 years 3 months ago
Scan primitives for GPU computing
The scan primitives are powerful, general-purpose data-parallel primitives that are building blocks for a broad range of applications. We describe GPU implementations of these pri...
Shubhabrata Sengupta, Mark Harris, Yao Zhang, John...
HPDC
1995
IEEE
14 years 1 months ago
Disk-Directed I/O for an Out-of-Core Computation
New file systems are critical to obtain good I/O performance on large multiprocessors. Several researchers have suggested the use of collective file-system operations, in which ...
David Kotz
IAJIT
2011
13 years 4 months ago
Blocked-based sparse matrix-vector multiplication on distributed memory parallel computers
: The present paper discusses the implementations of sparse matrix-vector products, which are crucial for high performance solutions of large-scale linear equations, on a PC-Cluste...
Rukhsana Shahnaz, Anila Usman