• L-BFGS

  • Referenced in 715 articles [sw03229]
  • large nonlinear optimization problems subject to simple bounds on the variables. It is intended ... unconstrained problems and in this case performs similarly to its predecessor, algorithm L-BFGS (Harwell...
  • Knapsack

  • Referenced in 461 articles [sw04723]
  • will be considered with respect to relaxations, bounds, reductions and other algorithmic techniques ... results are presented to compare the actual performance of the most effective algorithms published...
  • AdaBoost.MH

  • Referenced in 456 articles [sw08517]
  • adapted to this model, yielding bounds that are slightly weaker in some cases, but applicable ... require any prior knowledge about the performance of the weak learning algorithm. We also study ... arbitrary finite set or a bounded segment of the real line...
  • LBFGS-B

  • Referenced in 313 articles [sw05142]
  • large nonlinear optimization problems subject to simple bounds on the variables. It is intended ... unconstrained problems and in this case performs similarly to its predecessor, algorithm L-BFGS (Harwell...
  • L-BFGS-B

  • Referenced in 160 articles [sw01234]
  • large nonlinear optimization problems subject to simple bounds on the variables. It is intended ... unconstrained problems and in this case performs similarly to its predecessor, algorithm L-BFGS (Harwell...
  • SuperLU

  • Referenced in 171 articles [sw00930]
  • square matrices but the triangular solves are performed only for square matrices. The matrix columns ... relative backward error, and estimate error bounds for the refined solutions...
  • OFMC

  • Referenced in 27 articles [sw09466]
  • translated to IF.par OFMC performs both protocol falsification and bounded session verification by exploring...
  • TAO

  • Referenced in 43 articles [sw10597]
  • solution of large optimization problems on high-performance parallel architectures. Our case study uses ... gradient projection, conjugate gradient) algorithm for solving bound-constrained convex quadratic problems. Our implementation ... available for a wide range of high-performance architectures and has been tested on problems...
  • MS-COCO

  • Referenced in 12 articles [sw32600]
  • Finally, we provide baseline performance analysis for bounding box and segmentation detection results using...
  • SATMC

  • Referenced in 8 articles [sw09469]
  • open and flexible platform for SAT-based bounded model checking [8] of security protocols. Under ... cryptography and of strong typing, SATMC performs a bounded analysis of the problem by considering...
  • Couenne

  • Referenced in 63 articles [sw04347]
  • important parts of sBB methods: bounds tightening (BT) and branching strategies. We extend a branching ... world MINLP instances. We also compare the performance of couenne with a state...
  • SuperLU-DIST

  • Referenced in 83 articles [sw00002]
  • square matrices but the triangular solves are performed only for square matrices. The matrix columns ... relative backward error, and estimate error bounds for the refined solutions...
  • CBMC

  • Referenced in 77 articles [sw09719]
  • SystemC using Scoot. It allows verifying array bounds (buffer overflows), pointer safety, ex­cep­tions ... languages, such as Verilog. The verification is performed by unwinding the loops in the program...
  • BACH

  • Referenced in 4 articles [sw11906]
  • BACH: bounded reachability checker for linear hybrid automata. Hybrid automata are well studied formal models ... present a prototype tool BACH to perform bounded reachability checking of linear hybrid automata ... experiment data shows that BACH has good performance and scalability, and supports our belief that...
  • MINTO

  • Referenced in 132 articles [sw04587]
  • integer linear programs by a branch-and-bound algorithm with linear programming relaxations. It also ... construct feasible solutions generate strong valid inequalities perform variable fixing based on reduced prices control...
  • SVMlight

  • Referenced in 260 articles [sw04076]
  • also provides methods for assessing the generalization performance efficiently. It includes two efficient estimation methods ... solving a sequence of optimization problems lower-bounding the solution using a form of local...
  • Pex

  • Referenced in 33 articles [sw07263]
  • performs a systematic program analysis (using dynamic symbolic execution, similar to path-bounded model-checking...
  • DeWall

  • Referenced in 22 articles [sw01745]
  • theoretical bounds reported in the literature. An evaluation of the performance on a number...
  • ADMiRA

  • Referenced in 31 articles [sw31664]
  • rank solution satisfying a prescribed data approximation bound. We propose an atomic decomposition providing ... rank matrix case. The performance guarantee is given in terms of the rank-restricted isometry ... property (R-RIP) and bounds both the number of iterations and the error...
  • HySAT

  • Referenced in 24 articles [sw01980]
  • various optimizations that arise naturally in the bounded model checking context, e.g. isomorphic replication ... that those optimizations are crucial to the performance of the tool...