• ManySAT

  • Referenced in 40 articles [sw00544]
  • solvers generally designed using the divide-and-conquer 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 well-known Divide and Conquer paradigm. One of the main characteristics...
  • QUICKXPLAIN

  • Referenced in 32 articles [sw28625]
  • accelerate the basic method by a divide-and-conquer 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 divide-and-conquer method for computing the spectral resolution...
  • cuFFT

  • Referenced in 24 articles [sw11258]
  • effort. The FFT is a divide-and-conquer 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 divide-and-conquer 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 SDP-based divide-and-conquer algorithm for large-scale noisy anchor ... range intervertex distances as inputs. Our divide-and-conquer algorithm works as follows. When...
  • Pochoir

  • Referenced in 10 articles [sw25851]
  • optimization strategy of Pochoir is divide-and-conquer (cache-oblivious algorithm). In higher dimensional space...
  • SRN/HMM

  • Referenced in 9 articles [sw02952]
  • language recognition based on SRN/HMM A divide-and-conquer approach is presented for signer-independent ... 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 divide-and-conquer 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]
  • Divide-and-conquer strategy for large-scale Eulerian solvent excluded surface. Motivation: Surface generation ... reduce memory footprint through a straightforward divide-and-conquer strategy to perform the calculation...
  • Coquet

  • Referenced in 6 articles [sw09919]
  • various circuits: a text-book divide and conquer adder of parametric size, some higher-order...
  • 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 (divide-and-conquer), DP (dynamic programming), A*) for general...
  • nuSpectral

  • Referenced in 5 articles [sw26228]
  • nonuniformly sampled data. Asymptotically fast divide-and-conquer schemes for the computation of the variants...
  • MapleAmpharos

  • Referenced in 2 articles [sw25920]
  • propagation rate based splitting heuristic for divide-and-conquer solvers. In this paper, we present ... divide-and-conquer SAT solver, MapleAmpharos, that uses a novel propagation-rate (PR) based splitting ... that, in the context of divide-and-conquer 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 divide-and-conquer-like recurrences). We have evaluated TiML...