• ABAQUS

  • Referenced in 1259 articles [sw04215]
  • reduce costs and inefficiencies, and gain a competitive advantage...
  • MiniSat

  • Referenced in 483 articles [sw00577]
  • crafted” categories of the SAT 2005 competition...
  • CGS

  • Referenced in 289 articles [sw08225]
  • author is that this combination is a competitive solver for nonsymmetric linear systems, at least...
  • Neural Network Toolbox

  • Referenced in 166 articles [sw07378]
  • unsupervised learning with self-organizing maps and competitive layers. With the toolbox you can design...
  • CONOPT

  • Referenced in 147 articles [sw02791]
  • concludes that GRG codes can be very competitive with other codes for large-scale nonlinear...
  • SATzilla

  • Referenced in 77 articles [sw06281]
  • instances solved, or score in a competition). The excellent performance of SATzilla was independently verified ... Competition, where our SATzilla07 solvers won three gold, one silver and one bronze medal ... including instances from the most recent SAT competition...
  • PDDL

  • Referenced in 83 articles [sw07079]
  • challenges of application. The International Planning Competitions have acted as an important motivating force behind ... language, PDDL2.1, that was used in the competition. We describe the syntax of the language...
  • Gfan

  • Referenced in 104 articles [sw04698]
  • ordinary Gröbner basis computations Gfan is not competitive in speed compared to programs such...
  • Yices

  • Referenced in 95 articles [sw04436]
  • MaxSMT (and, dually, unsat cores) and is competitive as an ordinary SAT and MaxSAT solver...
  • GrabCut

  • Referenced in 91 articles [sw15842]
  • moderately difficult examples the proposed method outperforms competitive tools...
  • MACS-VRPTW

  • Referenced in 78 articles [sw06303]
  • updating. We show that MACS-VRPTW is competitive with the best known existing methods both...
  • PSwarm

  • Referenced in 53 articles [sw00742]
  • showed that the resulting algorithm is highly competitive with other global optimization methods based only ... global optimization) and the results confirm its competitiveness in terms of efficiency and robustness...
  • k-means++

  • Referenced in 72 articles [sw21622]
  • obtain an algorithm that is Θ(logk)-competitive with the optimal clustering. Preliminary experiments show...
  • Taylor

  • Referenced in 67 articles [sw10816]
  • some examples, showing that it is very competitive in many situations. This is especially true...
  • Serpent

  • Referenced in 42 articles [sw21989]
  • finalist in the AES competition. The winner, Rijndael, got 86 votes at the last ... fastest version at the time of the competition ran at over 45 Mbit/sec...
  • NINJA

  • Referenced in 37 articles [sw02398]
  • been made, and Java now can be competitive with C/C++ in many important situations, significant ... Java environment show that Java can be competitive in performance with highly optimized and tuned...
  • RIEMANN

  • Referenced in 50 articles [sw09351]
  • modern processor is shown to be cost-competitive with schemes that are based...
  • PRINCE

  • Referenced in 47 articles [sw13240]
  • within one clock cycle with a very competitive chip area compared to known solutions...
  • Piccolo

  • Referenced in 45 articles [sw13242]
  • remarkable. Thus, Piccolo is one of the competitive ultra-lightweight blockciphers which are suitable...