
ManySAT
 Referenced in 40 articles
[sw00544]
 solvers generally designed using the divideandconquer paradigm. Experiments on many industrial SAT instances...

DeWall
 Referenced in 24 articles
[sw01745]
 DeWall: a fast divide and conquer Delaunay triangulation algorithm in $E^d$. The paper deals ... original interpretation of the wellknown Divide and Conquer paradigm. One of the main characteristics...

QUICKXPLAIN
 Referenced in 32 articles
[sw28625]
 accelerate the basic method by a divideandconquer strategy and thus provide the technological...

UDC
 Referenced in 19 articles
[sw20233]
 Algorithm 730. An implementation of a divide and conquer algorithm for the unitary eigenproblem ... present a FORTRAN implementation of a divideandconquer method for computing the spectral resolution...

cuFFT
 Referenced in 24 articles
[sw11258]
 effort. The FFT is a divideandconquer algorithm for efficiently computing discrete Fourier transforms...

Satin
 Referenced in 8 articles
[sw08972]
 convenient for the programmer to write divide and conquer style programs. Unlike manager/worker programs, divide ... conquer algorithms operate by recursively dividing a problem into smaller subproblems. This recursive subdivision goes ... hierarchical nature, the divideandconquer model maps cleanly to grid systems, which also tend...

Quartets MaxCut
 Referenced in 7 articles
[sw29616]
 Quartets MaxCut: a divide and conquer quartets algorithm. Accurate phylogenetic reconstruction methods are currently limited ... algorithm is based on a divide and conquer algorithm where our divide step uses...

DISCO
 Referenced in 7 articles
[sw13152]
 graph realization problems: An SDPbased divideandconquer algorithm for largescale noisy anchor ... range intervertex distances as inputs. Our divideandconquer algorithm works as follows. When...

Pochoir
 Referenced in 10 articles
[sw25851]
 optimization strategy of Pochoir is divideandconquer (cacheoblivious algorithm). In higher dimensional space...

SRN/HMM
 Referenced in 9 articles
[sw02952]
 language recognition based on SRN/HMM A divideandconquer approach is presented for signerindependent ... problem of continuous CSL recognition is divided into the subproblems of isolated CSL recognition...

Algorithm 730
 Referenced in 5 articles
[sw14348]
 Algorithm 730: An implementation of a divide and conquer algorithm for the unitary eigenproblem ... present a FORTRAN implementation of a divideandconquer method for computing the spectral resolution...

PaInleSS
 Referenced in 8 articles
[sw21967]
 solving like clause exchanges, portfolio and divide and conquer strategies. It also enables users...

ESES
 Referenced in 4 articles
[sw26786]
 Divideandconquer strategy for largescale Eulerian solvent excluded surface. Motivation: Surface generation ... reduce memory footprint through a straightforward divideandconquer strategy to perform the calculation...

Coquet
 Referenced in 6 articles
[sw09919]
 various circuits: a textbook divide and conquer adder of parametric size, some higherorder...

MultiPlane
 Referenced in 4 articles
[sw01966]
 networks. The new framework uses a divide and conquer approach. More specifically, the framework divides...

Bob++
 Referenced in 5 articles
[sw22243]
 search methods (B&B, D&C (divideandconquer), DP (dynamic programming), A*) for general...

nuSpectral
 Referenced in 5 articles
[sw26228]
 nonuniformly sampled data. Asymptotically fast divideandconquer schemes for the computation of the variants...

MapleAmpharos
 Referenced in 2 articles
[sw25920]
 propagation rate based splitting heuristic for divideandconquer solvers. In this paper, we present ... divideandconquer SAT solver, MapleAmpharos, that uses a novel propagationrate (PR) based splitting ... that, in the context of divideandconquer solvers, it is most profitable to split...

Nimrod/O
 Referenced in 4 articles
[sw00620]
 optimization algorithms, namely BFGS, Simplex, Divide and Conquer and Simulated Annealing. Jobs can be executed...

TiML
 Referenced in 4 articles
[sw27564]
 using the Master Theorem to handle divideandconquerlike recurrences). We have evaluated TiML...