6105 search results - page 223 / 1221 » A Parallel Algorithm for Bound-Smoothing |
233
click to vote
PVM
2010
Springer
15 years 5 months ago
2010
Springer
Abstract. Designing and tuning parallel applications with MPI, particularly at large scale, requires understanding the performance implications of different choices of algorithms ...
146
Voted
ICCS
2004
Springer
16 years 12 days 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...
180
Voted
CLUSTER
2002
IEEE
16 years 4 hour 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...
192
Voted
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...
191
Voted
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...