• ETPS

  • Referenced in 161 articles [sw06302]
  • reading the manual (which contains some complete examples) and playing with the system. The student ... without leaving the program. A record of completed exercises is maintained by ETPS...
  • HYPLAS

  • Referenced in 201 articles [sw17661]
  • pretence that the text provides a complete account of the topics considered but rather...
  • SuperLU

  • Referenced in 196 articles [sw00930]
  • supplied routines. This preordering for sparsity is completely separate from the factorization. Working precision iterative...
  • SPASS

  • Referenced in 185 articles [sw04108]
  • formula is valid, SPASS beiseite: Completion found. if the formula is not valid and because...
  • ASSAT

  • Referenced in 176 articles [sw02524]
  • used, works as follows: Computes the completion of P and converts it into...
  • AProVE

  • Referenced in 161 articles [sw07831]
  • pair framework [8] and therefore permits a completely flexible combination of different termination proof techniques...
  • KEEL

  • Referenced in 156 articles [sw06791]
  • processing techniques, allowing it to perform a complete analysis of any learning model in comparison...
  • VisualUTA

  • Referenced in 112 articles [sw16231]
  • respectively, a partial preorder and a strongly complete and negatively transitive relation ... possible weak preference relation is a complete relation. Every new pairwise comparison of reference alternatives...
  • Cinderella

  • Referenced in 153 articles [sw00127]
  • version of the program, two completely new parts were added: CindyLab, an environment for doing...
  • Miranda

  • Referenced in 153 articles [sw04986]
  • form of stable implementations of complete and well-documented programming languages. Miranda is a functional...
  • NQTHM

  • Referenced in 151 articles [sw07543]
  • These changes in the logic were described completely in their “Metafunctions: proving them correct...
  • MuPAD

  • Referenced in 139 articles [sw00606]
  • whose notebook interface provides access to the complete MuPAD language. Computer algebra system...
  • PYTHIA8

  • Referenced in 139 articles [sw09347]
  • written in Fortran, Pythia 8 represents a complete rewrite in C++. The current release...
  • GraphBase

  • Referenced in 138 articles [sw01555]
  • brief overview of the system. Complete details appeared in the author’s book with...
  • Why3

  • Referenced in 136 articles [sw04438]
  • Java, or Ada programs. Why3 is a complete reimplementation of the former Why platform. Among...
  • LSODE

  • Referenced in 135 articles [sw04374]
  • GEAR and GEARB packages, and reflects a complete redesign of the user interface and internal...
  • FEASPUMP

  • Referenced in 133 articles [sw04802]
  • model is a very important 𝒩𝒫-complete problem that can be extremely hard in practice...
  • softImpute

  • Referenced in 83 articles [sw12263]
  • softImpute: Matrix Completion via Iterative Soft-Thresholded SVD. Iterative methods for matrix completion that ... that at each iteration the matrix is completed with the current estimate. For large matrices...
  • seL4

  • Referenced in 91 articles [sw15222]
  • seL4: formal verification of an OS kernel. Complete formal verification is the only known ... formal proof of functional correctness of a complete, general-purpose operating-system kernel. Functional correctness...
  • Manopt

  • Referenced in 124 articles [sw08493]
  • machine learning applications, including low-rank matrix completion, sensor network localization, camera network registration, independent...