• MUSCLE

  • Referenced in 75 articles [sw13193]
  • expectation score, and refinement using tree‐dependent restricted partitioning. The speed and accuracy of MUSCLE ... accuracy on each of these sets. Without refinement, MUSCLE achieves average accuracy statistically indistinguishable from...
  • JOSTLE

  • Referenced in 35 articles [sw04985]
  • load-balance existing partitions (such as those deriving from adaptive refined meshes). It achieves this ... then using state-of-the-art graph partitioning techniques. The code is extremely fast...
  • ERODE

  • Referenced in 7 articles [sw20210]
  • relations over ODE variables: forward differential equivalence partitions ODE variables into blocks for which ... compute the coarsest equivalence that refines a given initial partition. In the special case ... CTMCs), it implements a more efficient partition-refinement algorithm...
  • ForestClaw

  • Referenced in 11 articles [sw19374]
  • quadtree. Dynamic grid refinement and parallel partitioning of the grids is done through...
  • GridSpiderPar

  • Referenced in 2 articles [sw42921]
  • Dynamic load balancing with the parallel partitioning tool GridSpiderPar. Dynamically adaptive meshes are used often ... high-performance computing. A mesh is locally refined or de-refined in spots of interest ... parallel geometric algorithm of mesh partitioning and the parallel incremental algorithm of graph partitioning from ... partitioning tool GridSpiderPar. Initial partition of a mesh with local refinement ((6.7 cdot10^6) hexahedrons...
  • RefficientLib

  • Referenced in 6 articles [sw20337]
  • present a novel algorithm for adaptive mesh refinement in computational physics meshes in a distributed ... developed for nodally based parallel domain partitions where the nodes of the mesh belong ... also capable of dealing with nonbalanced hierarchical refinement, where multirefinement level jumps are possible between ... load rebalancing step, including both graph partitioning and space-filling renumbering algorithms. The presented algorithm...
  • NuscaS

  • Referenced in 2 articles [sw09857]
  • tetrahedra longest-edge partition is used as a refinement mesh algorithm. In this paper...
  • BARD

  • Referenced in 4 articles [sw08274]
  • plans. BARD facilitates map creation and refinement through command-line, graphical user interface, and automatic ... methods. Since redistricting is a computationally complex partitioning problem not amenable to an exact optimization ... selectable metaheuristics that can be used to refine existing or randomly-generated redistricting plans based...
  • ParFUM

  • Referenced in 16 articles [sw08855]
  • designed to allow for mesh modification, including refinement and coarsening. Using the ParFUM framework also ... mesh using, for example, the Metis graph partitioning library...
  • SCLaP

  • Referenced in 1 article [sw20060]
  • commonly used method to tackle the graph partitioning problem in practice is the multilevel metaheuristic ... coarsening phase and the refinement phase of multilevel graph partitioning. We mainly target networks with...
  • Dendro

  • Referenced in 7 articles [sw29068]
  • module, and a module for adaptive mesh refinement (AMR). Here, we focus on the multigrid ... scalar and vector fields, and parallel partition of multilevel octree forests. We describe a bottom...
  • OctPUM

  • Referenced in 8 articles [sw08383]
  • approximation functions, generated using the partition of unity approach, are compactly supported on n-dimensional ... tips may be obtained without excessive local refinements using localized enrichment functions. In order...
  • RKPM2D

  • Referenced in 9 articles [sw38411]
  • quality of approximation, simple h-adaptive refinement, and ability to embed physics-based enrichment functions ... nodal representative domain creation by Voronoi diagram partitioning, boundary condition specification, reproducing kernel shape function...
  • SA-cluster

  • Referenced in 10 articles [sw06867]
  • goal of graph clustering is to partition vertices in a large graph into clusters based ... graph vertices. As part of the clustering refinement, the graph edge weights are iteratively adjusted...
  • Vole

  • Referenced in 1 article [sw42938]
  • Perfect refiners for permutation group backtracking algorithms. Backtrack search is a fundamental technique for computing ... been formulated in terms of points, ordered partitions, and graphs. We provide a framework ... introduce the concept of perfect refiners to better understand and compare the pruning power available...
  • refine

  • Referenced in 1 article [sw41473]
  • refine is a 2D and 3D mesh adaptation tool implemented in the C language. Mesh ... geometry source. Parallel execution is supported with partitioning and load balancing. Solution fields are provided...
  • Inc-cluster

  • Referenced in 5 articles [sw06866]
  • goal of graph clustering is to partition vertices in a large graph into clusters based ... graph vertices. As part of the clustering refinement, the graph edge weights are iteratively adjusted...
  • ParTopS

  • Referenced in 4 articles [sw08857]
  • Those models require high levels of mesh refinement at the crack tip region so that ... communication of topological changes among mesh partitions and also to avoid the use of locks...
  • ADOL-C

  • Referenced in 257 articles [sw00019]
  • ADOL-C: Automatic Differentiation of C/C++. We present...