• METIS

  • Referenced in 404 articles [sw04089]
  • serial programs for partitioning graphs, partitioning finite element meshes, and producing fill reducing orderings ... bisection, multilevel k-way, and multi-constraint partitioning schemes developed...
  • PHAVer

  • Referenced in 105 articles [sw04123]
  • overapproximation and by partitioning the state space based on user-definable constraints and the dynamics...
  • PaToH

  • Referenced in 30 articles [sw09873]
  • multilevel hypergraph partitioner, Hypergraph partitioning with fixed cells, Multi-constraint hypergraph partitioner...
  • MISER3

  • Referenced in 72 articles [sw04190]
  • combination of both, subject to general constraints. The method used is based on the idea ... piecewise linear (continuous) functions defined on suitable partitions of the time interval. The code then...
  • veDYNA

  • Referenced in 9 articles [sw04237]
  • nonlinear constraints without exceeding an a priori fixed number of calculation steps. Partitioned linear-implicit ... techniques to keep the error in the constraints bounded for arbitrary time intervals. These methods...
  • APOGEE

  • Referenced in 24 articles [sw08451]
  • extended pooling problems via linear and logarithmic partitioning schemes. Our recent work globally optimized ... extended pooling problem incorporating environmental regulations into constraints. The pooling problems were optimized using...
  • Essence

  • Referenced in 14 articles [sw27491]
  • Essence: A constraint language for specifying combinatorial problems. Essence is a formal language for specifying ... objects, such as tuples, sets, multisets, relations, partitions and functions. Essence also allows these combinatorial...
  • NP Datalog

  • Referenced in 9 articles [sw13446]
  • intuitive and efficient constructs (namely, stratified negation, constraints, and exclusive disjunction) is introduced. Next ... disjunction to define (nondeterministically) subsets (or partitions) of relations is investigated. This language, called 𝒩𝒫𝒟atalog...
  • LITMUS

  • Referenced in 4 articles [sw09391]
  • results from such an evaluation, in which partitioned earliest-deadline-first (EDF) scheduling, preemptive ... constraints. To our knowledge, this paper is the first attempt by anyone to compare partitioned...
  • SamplingStrata

  • Referenced in 3 articles [sw11930]
  • cost under the condition to satisfy precision constraints in a multivariate and multidomain case. This ... genetic algorithm: each solution (i.e. a particular partition in strata of the sampling frame ... calculate the sampling size satisfying precision constraints on the target estimates. Functions in the package...
  • SPeeDI

  • Referenced in 7 articles [sw00896]
  • existence of a finite and computable partition of the state space into classes of states ... resort to (forward or backward) propagation of constraints, typically (unions of convex) polyhedra or ellipsoids...
  • BoostCluster

  • Referenced in 5 articles [sw08555]
  • given clustering algorithm by exploiting the pairwise constraints. The key challenge in designing a boosting ... number of popular clustering algorithms (K-means, partitional SingleLink, spectral clustering), and its performance...
  • PATOMA

  • Referenced in 3 articles [sw25553]
  • shape blocks under tight fixed-outline area constraints and a wirelength objective. Dramatic improvement over ... construction of strictly legal layouts for every partition block at every level of a cutsize...
  • EPCM

  • Referenced in 3 articles [sw03458]
  • flexible hyperspheric dichotomy is proposed which may partition a dataset into two parts: the main ... objective function of EPCM with some novel constraints. Finally, EPCM is realized by using...
  • L2CXCV

  • Referenced in 2 articles [sw26952]
  • problem. A highly useful description of the constraints is that they follow from the assumption ... process considered. The underlying algorithm partitions the data into two disjoint sets of adjacent data ... concave on the other one. The partition into suitable sets is achieved by a finite ... twice the number of the divided differences constraints. The quadratic programming technique makes...
  • NTUplace3

  • Referenced in 2 articles [sw13201]
  • wirelength, modern placers need to consider various constraints such as preplaced blocks and density ... controlled by white-space reallocation using partitioning and cut-line shifting during GP and cell...
  • ADOL-C

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

  • Referenced in 569 articles [sw00044]
  • ANSYS offers a comprehensive software suite that spans...
  • ATLAS

  • Referenced in 192 articles [sw00056]
  • This paper describes the Automatically Tuned Linear Algebra...
  • BARON

  • Referenced in 265 articles [sw00066]
  • BARON is a computational system for solving nonconvex...