• MOCUS

  • Referenced in 9 articles [sw12553]
  • tree, and control parameters specifying the minimal cut set length to be obtained MOCUS determines ... system failure modes, or minimal cut sets, and the system success modes, or minimal path ... fault tree into the cut and path sets. The algorithm used starts with the main ... fault tree to obtain the minimal sets. A key point of the algorithm is that...
  • PREP/KITT

  • Referenced in 4 articles [sw12554]
  • tree. The PREP program finds the minimal cut sets and/or the minimal path sets ... system fault tree. (A minimal cut set is a smallest set of components such that ... components of each minimal cut or path set, for each minimal cut or path ... each component and for each minimal cut set or path set. For the system, reliability...
  • FuzzyFTA

  • Referenced in 6 articles [sw12421]
  • system includes algorithms to consider the minimal cut set approach for the top event calculation...
  • FATRAM

  • Referenced in 3 articles [sw25821]
  • algorithms have been developed for determining minimal cut sets for logic models (in particular, fault ... method for determining the minimal cut sets, which makes more efficient use of computer memory ... method. The FATRAM algorithm for finding minimal cut sets for fault trees does use computer...
  • CALMA

  • Referenced in 109 articles [sw03235]
  • number of frequencies used is to be minimized. Problems of this type were investigated within ... developed optimization algorithms based on branch-and-cut and constraint satisfaction, and approximation techniques including ... algorithms were tested and compared on a set of real-life instances...
  • ITEM ToolKit

  • Referenced in 3 articles [sw12549]
  • analyzes Common Cause Failure (CCF); Produces Minimal Cut Sets; Identifies Fault Tree Sequencing, Initiator...
  • reliability

  • Referenced in 1 article [sw25368]
  • supply. Reliability analysis technique using the minimal cut set method has been implemented. In addition...
  • LPCCbnc

  • Referenced in 5 articles [sw31750]
  • LPCC) requires the minimization of a linear objective over a set of linear constraints together ... optimization problem. We develop a branch-and-cut algorithm to find a global optimum...
  • ELISA

  • Referenced in 9 articles [sw02195]
  • cut down on the communication and load transfer overheads by minimizing the frequency of status ... transfer and status exchange within the buddy set of a processor. It is shown that...
  • SpeeDP

  • Referenced in 4 articles [sw07003]
  • cut problems) that can be formulated as the non-convex nonlinear programming problem of minimizing ... LRSDP problem with the unconstrained minimization of a new merit function and we define ... codes on an extended set of instances of the max-cut problem. We further include...
  • RubiksCubeGeneticAlgorithmsSolver

  • Referenced in 1 article [sw38923]
  • taken as operations it will give a minimal cube’s grammar. By building formal grammar ... example) set of formal grammar sentences can be represented as population individuals. Single cut point...
  • ADOL-C

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

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

  • Referenced in 119 articles [sw00114]
  • The program cdd+ (cdd, respectively) is a C...
  • CGAL

  • Referenced in 396 articles [sw00118]
  • The goal of the CGAL Open Source Project...
  • CoCoA

  • Referenced in 659 articles [sw00143]
  • CoCoA is a system for Computations in Commutative...
  • Coq

  • Referenced in 1898 articles [sw00161]
  • Coq is a formal proof management system. It...
  • CSDP

  • Referenced in 202 articles [sw00169]
  • CSDP, A C Library for Semidefinite Programming. This...
  • FEMLAB

  • Referenced in 57 articles [sw00274]
  • COMSOL Multiphysics, vormals FEMLAB, ist eine Software zur...
  • GAP

  • Referenced in 3190 articles [sw00320]
  • GAP is a system for computational discrete algebra...