541 search results - page 24 / 109 » Factoring Solution Sets of Polynomial Systems in Parallel |
74
Voted
IPPS
1998
IEEE
15 years 1 months ago
1998
IEEE
We present a novel scheme for the solution of linear differential equation systems on parallel computers. The Implicit Pipeline (ImP) method uses an implicit timeintegration schem...
ICCAD
1999
IEEE
15 years 1 months ago
1999
IEEE
We present optimal solutions to the test scheduling problem for core-based systems. We show that test scheduling is equivalent to the m-processor open-shop scheduling problem and ...
83
Voted
IEEEPACT
1998
IEEE
15 years 1 months ago
1998
IEEE
Compile-time scheduling is one approach to extract parallelism which has proved effective when the execution behavior is predictable. Unfortunately, the performance of most priori...
CGF
2008
14 years 9 months ago
2008
Algebraic Point Set Surfaces (APSS) define a smooth surface from a set of points using local moving least-squares (MLS) fitting of algebraic spheres. In this paper we first revisi...
ITCC
2000
IEEE
15 years 1 months ago
2000
IEEE
Parallel computers can do more than simply speed up sequential computations. They are capable of nding solutions that are far better in quality than those obtained by sequential c...