6105 search results - page 207 / 1221 » A Parallel Algorithm for Bound-Smoothing |
139
click to vote
ICCS
2003
Springer
15 years 11 months ago
2003
Springer
The exact enumeration of most interesting combinatorial problems has exponential computational complexity. The finite-lattice method reduces this complexity for most two-dimension...
153
click to vote
STOC
1998
ACM
15 years 10 months ago
1998
ACM
We study integrated prefetching and caching problems following the work of Cao et. al. [3] and Kimbrel and Karlin [13]. Cao et. al. and Kimbrel and Karlin gave approximation algor...
155
click to vote
HPCN
1997
Springer
15 years 10 months ago
1997
Springer
This paper describes a distributed algorithm for Boolean function manipulation. The algorithm is based on Binary Decision Diagrams (BDDs), which are one of the most commonly used ...
174
click to vote
VLDB
1995
ACM
15 years 10 months ago
1995
ACM
We address the problem of finding parallel plans for SQL queries using the two-phase approach of join ordering and query rewrite (JOQR) followed by parallelization. We focus on t...
170
click to vote
IPPS
2010
IEEE
15 years 4 months ago
2010
IEEE
This work presents the first extensive study of singlenode performance optimization, tuning, and analysis of the fast multipole method (FMM) on modern multicore systems. We consid...