
UDC
 Referenced in 19 articles
[sw20233]
 implementation of a divide and conquer algorithm for the unitary eigenproblem. We present a FORTRAN ... implementation of a divideandconquer method for computing the spectral resolution of a unitary ... applications mentioned above, the algorithm requires only O(n2) arithmetic operations. Experimental results presented indicate...

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

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

DISCO
 Referenced in 7 articles
[sw13152]
 realization problems: An SDPbased divideandconquer algorithm for largescale noisy anchorfree ... graph realization. We propose the DISCO algorithm for graph realization in ℝ d , given sparse ... intervertex distances as inputs. Our divideandconquer algorithm works as follows. When a group...

Quartets MaxCut
 Referenced in 6 articles
[sw29616]
 Quartets MaxCut: a divide and conquer quartets algorithm. Accurate phylogenetic reconstruction methods are currently limited ... problematic. In this paper, we describe an algorithm for constructing a tree from ... algorithm is based on a divide and conquer algorithm where our divide step uses...

Satin
 Referenced in 8 articles
[sw08972]
 style programs. Unlike manager/worker programs, divideandconquer algorithms operate by recursively dividing a problem ... hierarchical nature, the divideandconquer model maps cleanly to grid systems, which also tend ... contains a efficient and simple loadbalancing algorithm, Clusteraware Random Stealing (CRS), which outperforms...

Algorithm 730
 Referenced in 5 articles
[sw14348]
 implementation of a divide and conquer algorithm for the unitary eigenproblem. We present a FORTRAN ... implementation of a divideandconquer method for computing the spectral resolution of a unitary ... applications mentioned above, the algorithm requires only O(n2) arithmetic operations. Experimental results presented indicate...

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

ManySAT
 Referenced in 36 articles
[sw00544]
 standard DPLL algorithm. Additionally, each sequential algorithm shares clauses to improve the overall performance ... solvers generally designed using the divideandconquer paradigm. Experiments on many industrial SAT instances...

mod_binarymono.f90
 Referenced in 1 article
[sw29760]
 divide and conquer algorithm for exploiting policy function monotonicity. A divide and conquer algorithm...

aTrunk
 Referenced in 1 article
[sw29099]
 aTrunk  An ALSBased Trunk Detection Algorithm. This paper presents a rapid multireturn ... trunk detection approach. The multicore Divide & Conquer algorithm uses a CBH (Crown Base Height...

PHDC
 Referenced in 1 article
[sw18388]
 efficient hybrid tridiagonal divideandconquer algorithm on distributed memory architectures. In this paper ... efficient divideandconquer (DC) algorithm is proposed for the symmetric tridiagonal matrices based...

Akra Bazzi
 Referenced in 1 article
[sw28595]
 Theorem for analysing the complexity of Divide & Conquer algorithms. We also include a generalised version...

Algorithm 870
 Referenced in 2 articles
[sw12986]
 Algorithm 870: A static geometric medial axis domain decomposition in 2D Euclidean space. We present ... decomposition is based on the “divide and conquer” algorithmic paradigm and on a smoothing procedure...

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

ESES
 Referenced in 4 articles
[sw26786]
 Divideandconquer strategy for largescale Eulerian solvent excluded surface. Motivation: Surface generation ... introduce an outofcore and parallel algorithm to improve the ESES software. Results ... algorithm can successfully reduce memory footprint through a straightforward divideandconquer strategy to perform ... multicore computers or clusters, our algorithm can reduce the execution time by parallelizing most...

SMTS
 Referenced in 1 article
[sw29289]
 that supports recursively combining algorithm portfolios and divideandconquer with the exchange of learned ... supports interactive guidance of the algorithm through a web interface. We report positive experiences...

Bob++
 Referenced in 5 articles
[sw22243]
 framework for implementing sequential and/or parallel search algorithms. To our knowledge, the Bob++ is among ... search methods (B&B, D&C (divideandconquer), DP (dynamic programming), A*) for general ... makes transparent the parallelizations of the search algorithms. To parallelize Bob++ library, we integrated...

MERGEXPLAIN
 Referenced in 1 article
[sw24976]
 intrusive conflict detection algorithm which implements a divideandconquer strategy to decompose a problem...

SRN/HMM
 Referenced in 9 articles
[sw02952]
 recognition based on SRN/HMM A divideandconquer approach is presented for signerindependent continuous ... problem of continuous CSL recognition is divided into the subproblems of isolated CSL recognition ... states of HMM, and the Lattice Viterbi algorithm is employed to search the best word...