6542 search results - page 210 / 1309 » The tao of parallelism in algorithms |
146
click to vote
IPPS
1997
IEEE
15 years 10 months ago
1997
IEEE
We present a parallel priority data structure that improves the running time of certain algorithms for problems that lack a fast and work-efficient parallel solution. As a main a...
135
click to vote
ICCS
2004
Springer
16 years 6 hour ago
2004
Springer
Abstract. Bulk Synchronous Parallel ML or BSML is a functional dataparallel language for programming bulk synchronous parallel (BSP) algorithms. The execution time can be estimated...
172
click to vote
CLUSTER
2002
IEEE
15 years 11 months ago
2002
IEEE
The join is the most important, but also the most time consuming operation in relational database systems. We implemented the parallel Hybrid Hash Join algorithm on a PC-cluster a...
177
click to vote
ICPP
2009
IEEE
16 years 1 months ago
2009
IEEE
—Equilibria computation is of great importance to many areas such as economics, control theory, and recently computer science. We focus on the computation of Nash equilibria in t...
180
click to vote
ISPDC
2008
IEEE
16 years 1 months ago
2008
IEEE
We consider the problem of computing all Nash equilibria in bimatrix games (i.e., nonzero-sum two-player noncooperative games). Computing all Nash equilibria for large bimatrix ga...