6897 search results - page 14 / 1380 » Parallelization of Modular Algorithms |
APCSAC
2005
IEEE
13 years 9 months ago
2005
IEEE
JPL
1998
13 years 7 months ago
1998
POPL
2011
ACM
12 years 10 months ago
2011
ACM
A number of deterministic parallel programming models with strong safety guarantees are emerging, but similar support for nondeterministic algorithms, such as branch and bound sea...
ATAL
2006
Springer
13 years 11 months ago
2006
Springer
In this paper we incorporate autonomous agents' capability to perform parallel interactions into the cooperative search model, resulting in a new method which outperforms the...
ISSAC
2005
Springer
14 years 29 days ago
2005
Springer
Let G = (4y2 + 2z)x2 + (10y2 + 6z) be the greatest common divisor (gcd) of two polynomials A, B ∈ [x,y, z]. Because G is not monic in the main variable x, the sparse modular ...