• ISUD

  • Referenced in 13 articles [sw34491]
  • Integral simplex using decomposition for the set partitioning problem. Since the 1970s, several authors have ... studied the structure of the set partitioning polytope and proposed adaptations of the simplex algorithm ... coefficients. We present results for large-scale problems (with up to 500,000 variables...
  • KELLEY

  • Referenced in 631 articles [sw04829]
  • reader!) and understand.’ par This book is partitioned into two parts. The first part, occupying ... introduces a parameter identification problem and a discretized optimal control problem, both of which ... nonlinear least squares problems. Both, overdetermined and underdetermined nonlinear least squares problems are considered. Chapter ... problem and the discretized optimal control problem introduced in chapter 1, and with a set...
  • Essence

  • Referenced in 22 articles [sw27491]
  • formal language for specifying combinatorial problems in a manner similar to natural rigorous specifications that ... combinatorial objects, such as tuples, sets, multisets, relations, partitions and functions. Essence also allows these ... partitions, sets of sets of partitions, and so forth. Therefore, a problem that requires finding...
  • GTSP Instances Library

  • Referenced in 14 articles [sw14651]
  • Traveling Salesman Problem (TSP), where the node set is partitioned into clusters, and the objective ... least) one node in each cluster. The problem is NP-hard. In 1997, Fischetti, Salazar...
  • TASC

  • Referenced in 4 articles [sw02567]
  • common problem that they use only one set of attributes for both partitioning the data ... measuring the similarity between objects. This problem has limited the use of the existing algorithms ... which partitions data space by constructing a decision tree using one attribute set, and measures...
  • 4eMka2

  • Referenced in 53 articles [sw16168]
  • system is resolving of multi-criteria sorting problems. System can be used in many different ... other connected with analysis of vast data sets. The main difference between this system ... that it bases on rough set theory combined with dominance relation, which is quite ... set of already classified examples. These rules could be used to make partition...
  • COUPL+

  • Referenced in 1 article [sw18595]
  • algorithms behind this package. A multi-level partitioning method is described which is effective ... skewed data, solving the multi-set median-finding problem. Partitioning elements over...
  • GTSP-LIB

  • Referenced in 6 articles [sw25565]
  • exactly one-in-a-set generalized traveling salesman problem (GTSP). In the GTSP, a complete ... input along with a partition of the vertices into disjoint sets. The objective ... tour) in the graph that visits each set exactly once and has minimum length ... wide range of existing and new problem libraries. We show that on the GTSP...
  • TRIOPT

  • Referenced in 6 articles [sw02486]
  • optimization problems. The method starts by forming a Delaunay triangulation of a given set ... domain, and then, it assesses the simplices (partitions) obtained for re-partitioning. Function values...
  • GCTA

  • Referenced in 22 articles [sw23135]
  • recently developed to address the ”missing heritability” problem. GCTA estimates the variance explained ... estimate and partition complex trait variation with large GWAS data sets...
  • PARTY

  • Referenced in 10 articles [sw20518]
  • certain implementation details. Fortunately, the partitioning problem itself is clearly defined and its description leads ... interface. The PARTY partitioning library serves a variety of different partitioning methods. Instead of implementing ... improved over several years and the default setting of the library enables a fast ... PARTY partitioning library successfully to solve their partitioning problem. For further information, in particular...
  • L2CXCV

  • Referenced in 2 articles [sw26952]
  • change is also unknown of the optimization problem. A highly useful description of the constraints ... considered. The underlying algorithm partitions the data into two disjoint sets of adjacent data ... strictly convex quadratic programming problem for each set. The piecewise linear interpolant ... other one. The partition into suitable sets is achieved by a finite iterative algorithm, which...
  • IsoRank

  • Referenced in 13 articles [sw08324]
  • eigenvalue problem for every pair of input networks and then using k-partite matching ... species; we believe these are the first set of functional orthologs that cover...
  • PeakSegDisk

  • Referenced in 3 articles [sw41661]
  • Disk-based implementation of Functional Pruning Optimal Partitioning with up-down constraints problem), can handle huge data sets (10^7 or more...
  • CLIFF

  • Referenced in 10 articles [sw35898]
  • reference partition on the basis of the selected features. On a well-studied problem involving ... original expert labeling of the sample set...
  • RKPM2D

  • Referenced in 8 articles [sw38411]
  • make RKPM promising for solving challenging engineering problems. The aim of the present software package ... methods. The RKPM2D software consists of a set of data structures and subroutines for discretizing ... nodal representative domain creation by Voronoi diagram partitioning, boundary condition specification, reproducing kernel shape function ... RKPM2D are discussed in detail. Benchmark problems solved by RKPM2D are presented to demonstrate...
  • Cluster

  • Referenced in 1 article [sw16464]
  • compare interpretations of a single data set. The authors present some methods as well ... cluster partitions. The package CLUSTER can solve the following basic problems of cluster analysis ... many clusters are present in a given set of objects X if its cluster structure ... unknown? (2) If different partitions of X are obtained for a given value...
  • Privman

  • Referenced in 3 articles [sw35845]
  • Privman: A Library for Partitioning Applications. Writing secure, trusted software for UNIX platforms is difficult ... apparent that the current set of solutions are neither achieving acceptance nor having sufficient impact ... address a particularly difficult problem in secure code development: partitioning processes to isolate privileges...
  • GraphSET

  • Referenced in 1 article [sw09795]
  • investigation of a wide range of embedding problems. GraphSET can be used in the study ... set partitioned into color classes. The tool has two primary uses: (i) studying theoretical problems...
  • SPaVS

  • Referenced in 1 article [sw42214]
  • Stochastic partitioning for variable selection in multivariate mixture of regression models. The relative ease with ... interest in relating high-dimensional data sets. This problem can be framed as a multivariate ... regression model with one data set treated as a response matrix and the other ... review a stochastic partitioning method that addresses this problem by fitting a mixture of regression...