• MAXFLOW

  • Referenced in 134 articles [sw13223]
  • Experimental Comparison of Min-Cut/Max-Flow Algorithms for Energy Minimization in Vision.” Yuri Boykov...
  • 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 ... resolution of the fault tree into the cut and path sets. The algorithm used starts ... resolve the fault tree to obtain the minimal sets. A key point of the algorithm...
  • 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 ... information for the components of each minimal cut or path set, for each minimal ... each component and for each minimal cut set or path set. For the system, reliability...
  • Bubble-FOS/C

  • Referenced in 8 articles [sw06814]
  • relaxed solution to an edge cut minimizing binary quadratic program (BQP). This result provides...
  • FuzzyFTA

  • Referenced in 6 articles [sw12421]
  • system includes algorithms to consider the minimal cut set approach for the top event calculation...
  • 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...
  • 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...
  • ITEM ToolKit

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

  • Referenced in 3 articles [sw06840]
  • relaxed solution to an edge cut minimizing binary quadratic program (BQP). This result provides...
  • Thaw

  • Referenced in 14 articles [sw01150]
  • dense in the smooth surface, whereas the cut locus from the same point ... introducing a minimal angular resolution and discarding those points of the cut locus...
  • MFMC_Countable

  • Referenced in 1 article [sw38014]
  • proof of the maximum-flow minimal-cut theorem for networks with countably many edges...
  • reliability

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

  • Referenced in 2 articles [sw39271]
  • time needed to develop programs. Minimize computation times. Cut down on programming errors, Provide...
  • ELISA

  • Referenced in 9 articles [sw02195]
  • cut down on the communication and load transfer overheads by minimizing the frequency of status...
  • LPCCbnc

  • Referenced in 5 articles [sw31750]
  • cut. A linear program with linear complementarity constraints (LPCC) requires the minimization of a linear ... optimization problem. We develop a branch-and-cut algorithm to find a global optimum...
  • DAOmap

  • Referenced in 2 articles [sw26287]
  • technology mapping problem for FPGA architectures to minimize chip area, or the total number ... consider the potential node duplications during the cut enumeration/generation procedure so the mapping costs encoded ... cuts drive the area-optimization objective more effectively; (ii) after the timing constraint is determined ... global optimality information to minimize mapping area; (iii) an iterative cut selection procedure is carried...
  • 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 ... extended set of instances of the max-cut problem. We further include SpeeDP within...
  • Minlog

  • Referenced in 2 articles [sw30424]
  • Minlog is a theorem prover for propositional minimal logic and Heyting’s intuitionist logic ... implements a decision procedure based on a cut-free sequent calculus formulation of these systems...
  • Muriqui

  • Referenced in 2 articles [sw32925]
  • Approximation; LP/NLP based Branch-And-Bound; Extended Cutting Plane; Extended Supporting Hyperplane; Nonlinear Branch ... heuristic; Relaxation Enforced Neighborhood Search; Integrality Gap Minimization Heuristic, versions...
  • EDO

  • Referenced in 2 articles [sw29926]
  • exception handling path unoptimized, while stack cutting optimizes the exception handling path by adding extra ... exception-intensive programs without slowing down exception-minimal programs. It is a feedback-directed dynamic...