13376 search results - page 179 / 2676 » Problem Solving with |
107
click to vote
MOC
1998
15 years 2 months ago
1998
In this paper we construct and analyze new non-overlapping domain decomposition preconditioners for the solution of second-order elliptic and parabolic boundary value problems. The...
122
Voted
JSC
2010
15 years 1 months ago
2010
We consider the problem of solving a linear system Ax = b over a cyclotomic field. What makes cyclotomic fields of special interest is that we can easily find a prime p that sp...
132
click to vote
AIMSA
2008
Springer
15 years 9 months ago
2008
Springer
Abstract. Computational Grids provide a widely distributed computing environment suitable for randomized SAT solving. This paper develops techniques for incorporating learning, kno...
126
click to vote
FLOPS
2008
Springer
15 years 4 months ago
2008
Springer
Abstract. The paper introduces a collection of knowledge representation languages, V(C), parametrised over a class C of constraints. V(C) is an extension of both CR-Prolog and CASP...
119
click to vote
AMAI
2004
Springer
15 years 8 months ago
2004
Springer
Recent dynamic local search (DLS) algorithms such as SAPS are amongst the state-of-the-art methods for solving the propositional satisfiability problem (SAT). DLS algorithms modi...