6105 search results - page 47 / 1221 » A Parallel Algorithm for Bound-Smoothing |
EUROPAR
2006
Springer
15 years 6 months ago
2006
Springer
111
Voted
IPPS
2000
IEEE
15 years 5 months ago
2000
IEEE
114
click to vote
PPOPP
2012
ACM
13 years 9 months ago
2012
ACM
The efforts of an expert to parallelize and optimize a dense linear algebra algorithm for distributed-memory targets are largely mechanical and repetitive. We demonstrate that the...
134
click to vote
PVLDB
2008
15 years 1 months ago
2008
Many commercial RDBMSs employ cost-based query optimization exploiting dynamic programming (DP) to efficiently generate the optimal query execution plan. However, optimization tim...