• condest

  • Referenced in 6 articles [sw08757]
  • computes a lower bound c for the 1-norm condition number of a square matrix...
  • Warmr

  • Referenced in 2 articles [sw37013]
  • than seven conditions, that could predict carcinogenicity. This results put a lower bound...
  • Karnak.sGbem

  • Referenced in 3 articles [sw10250]
  • optimization problem and incremental approach. The lower bound limit approach of the classical plasticity theory ... Multidomain Symmetric Galerkin Boundary Element Method, under conditions of plane and initial strains, ideal plasticity...
  • TiML

  • Referenced in 4 articles [sw27564]
  • distinguishing characteristic is supporting highly automated time-bound verification applicable to data structures with nontrivial ... type annotations, and the typechecker generates verification conditions that are discharged by an SMT solver ... Type and index inference are supported to lower annotation burden, and, furthermore, big-O complexity ... trees, functional queues, and dynamic tables with bounds like m n logn. The learning curve...
  • PREP/KITT

  • Referenced in 4 articles [sw12554]
  • procedure in which various upper and lower bounds may be obtained as close ... repair times can be considered. Any inhibit conditions having constant probabilities of occurrence...
  • optextras

  • Referenced in 1 article [sw11622]
  • when inadmissible parameters are provided. Checks on bounds and masks (fixed parameters) are available ... scaling or optimality conditions. An axial search to seek lower points on the objective function...
  • greedyBAPs

  • Referenced in 1 article [sw24158]
  • also prove some necessary and some sufficient conditions for distributional equivalence of BAPs which ... structures. This allows us to infer lower bounds of causal effects. We also present applications...
  • PSim

  • Referenced in 3 articles [sw23192]
  • well. This allows us to derive lower bounds on the step complexity of implementations ... that it satisfies a stronger progress condition than all the algorithms that it outperforms...
  • ODEA

  • Referenced in 3 articles [sw07671]
  • each node pair, such that two conditions are satisfied: 1. all paths are pairwise nonintersecting ... software. We devise a Branch-and-Bound scheme and fill in the contents ... ingredients: branching strategies, structural pruning, upper and lower cost bounds. This includes two novel ideas...
  • ANSYS

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

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

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

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

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

  • Referenced in 200 articles [sw00258]
  • Expokit provides a set of routines aimed at...
  • GAP

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

  • Referenced in 279 articles [sw00418]
  • HSL (formerly the Harwell Subroutine Library) is a...
  • KNITRO

  • Referenced in 197 articles [sw00490]
  • KNITRO is a solver for nonlinear optimization. It...