6105 search results - page 206 / 1221 » A Parallel Algorithm for Bound-Smoothing |
155
click to vote
JSAT
2008
15 years 6 months ago
2008
We show how to exploit the 32/64 bit architecture of modern computers to accelerate some of the algorithms used in satisfiability solving by modifying assignments to variables in ...
160
click to vote
IPPS
2002
IEEE
15 years 11 months ago
2002
IEEE
We present a parallel algorithm for performing multipoint linkage analysis of genetic marker data on large family pedigrees. The algorithm effectively distributes both the computa...
202
click to vote
PARA
2004
Springer
15 years 11 months ago
2004
Springer
Abstract. This paper presents new efficient parallel algorithms for finding approximate solutions to graph coloring problems. We consider an existing shared memory parallel graph...
160
click to vote
IPPS
1997
IEEE
15 years 10 months ago
1997
IEEE
Given an n-degree polynomial f x over an arbitrary ring, the shift of f x by c is the operation which computes coefficients of the polynomial f x + c . In this paper we conside...
174
click to vote
PPAM
2005
Springer
15 years 12 months ago
2005
Springer
Abstract. In this paper we deal with the problem of finding an optimal query execution plan in database systems. We improve the analysis of a polynomial-time approximation algorit...