• simannf90

  • Referenced in 119 articles [sw05059]
  • algorithm is essentially an iterative random search procedure with adaptive moves along the coordinate directions ... permits uphill moves under the control of a probabilistic criterion, thus tending to avoid ... first local minima encountered. The new method proved to be more reliable than the others ... Nelder-Mead method and the adaptive random search method of the reviewer), being always able...
  • GOP

  • Referenced in 6 articles [sw17432]
  • problem for a multi-layer line search method. The approach is presented and implemented ... Ball, Genetic Algorithm, Differential Evolution and Controlled Random Search. We validate our methodology by considering ... alone and with two additional global optimization methods (Direct Tabu Search and Continuous Greedy Randomized...
  • S-TaLiRo

  • Referenced in 20 articles [sw09775]
  • TaLiRo is a Matlab (TM) toolbox that searches for trajectories of minimal robustness in Simulink/Stateflow ... randomized testing based on stochastic optimization techniques including Monte-Carlo methods and Ant-Colony Optimization ... industry for model-based development of control software. We present the architecture of S-TaLiRo...
  • BART-BMA

  • Referenced in 5 articles [sw23498]
  • uses Bayesian model averaging and a greedy search algorithm to obtain a posterior distribution more ... incorporates elements of both BART and random forests to offer a model-based algorithm which ... many areas of bioinformatics. We showcase this method using simulated data and data from ... distinguish between patients with cardiovascular disease and controls and another to classify aggressive from...
  • JaTeCS

  • Referenced in 1 article [sw20538]
  • natural language processing tools, multi-language support, methods for feature selection and weighting, the implementation ... light) which enable their full control from code. JaTeCS support its expansion by abstracting through ... train-test, k-fold validation, grid-search optimization, randomized runs) which enable fast realization...
  • Honey badger algorithm

  • Referenced in 1 article [sw40622]
  • controlled randomization techniques, HBA maintains ample population diversity even towards the end of the search ... solving optimization problems with complex search-space, as well as, its superiority in terms ... exploration-exploitation balance, as compared to other methods used in this study. The source code...
  • ADOL-C

  • Referenced in 249 articles [sw00019]
  • ADOL-C: Automatic Differentiation of C/C++. We present...
  • ANSYS

  • Referenced in 703 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 384 articles [sw00118]
  • The goal of the CGAL Open Source Project...
  • complib

  • Referenced in 34 articles [sw00149]
  • COMPlib: COnstraint matrix-optimization problem library–a collection...
  • Coq

  • Referenced in 1880 articles [sw00161]
  • Coq is a formal proof management system. It...
  • CSDP

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

  • Referenced in 65 articles [sw00177]
  • CUTE: a concolic unit testing engine for C...
  • C-XSC 2.0

  • Referenced in 127 articles [sw00182]
  • A C++ class library for extended scientific computing...
  • DEA

  • Referenced in 244 articles [sw00194]
  • Data Envelopment Analysis (DEA) is becoming an increasingly...
  • GAP

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