• ADMAT

  • Referenced in 31 articles [sw04864]
  • finite-differencing involve additional errors and heuristic choice of parameters. This toolbox is designed...
  • Regina

  • Referenced in 43 articles [sw04862]
  • These include the all-important simplification heuristics, key choices of data structures and algorithms...
  • Krimp

  • Referenced in 19 articles [sw28422]
  • datasets. Further, we extensively evaluate the heuristic choices made in the design of the algorithm...
  • LSSPER

  • Referenced in 29 articles [sw02485]
  • defines a subproblem solved externally by a heuristic or an exact solution approach (using either ... point of the method deals with the choice of the subproblem to be optimized ... method with current state-of-the-art heuristics, extensive numerical experiments have been performed...
  • PGAPack

  • Referenced in 16 articles [sw04922]
  • Multiple choices for SELECTION, CROSSOVER, and MUTATION operators Easy integration of hill-climbing heuristics...
  • GCDHEU

  • Referenced in 9 articles [sw01054]
  • algorithm based on integer GCD computation. A heuristic algorithm, GCDHEU, is described for polynomial ... also the algorithm of choice for many problems in up to four variables...
  • PARTY

  • Referenced in 10 articles [sw20518]
  • complete. A large number of efficient partitioning heuristics have been developed, but their performance ... solution quality is heavily influenced by choices of parameters and certain implementation details. Fortunately...
  • SPARSE-QR

  • Referenced in 17 articles [sw05215]
  • must therefore be approximated by a simple heuristic. We describe a multifrontal method for sparse ... augmented system method. A better choice of the parameter δ or iterative refinement must...
  • BayesVarSel

  • Referenced in 5 articles [sw11011]
  • BayesVarSel: Bayes Factors, Model Choice And Variable Selection In Linear Models. Conceived to calculate Bayes ... potential explanatory variables through parallel and heuristic versions (Garcia-Donato and Martinez-Beneito...
  • mPL6

  • Referenced in 3 articles [sw13200]
  • fast and scalable run time. Best-choice clustering (ISPD05) is used to construct a hierarchy ... possible to the continuous solution. Various discrete heuristics are applied to this legalized placement...
  • SoftAdapt

  • Referenced in 1 article [sw42062]
  • often suffer from slow convergence and poor choice of weights for the loss components. Traditionally ... equally or their weights are determined through heuristic approaches that yield near-optimal...
  • heuristica

  • Referenced in 0 articles [sw15957]
  • heuristics like Take The Best and unit-weight linear, which do two-alternative choice: which...
  • varrank

  • Referenced in 2 articles [sw23896]
  • varrank. It has a flexible implementation of heuristic approaches which perform variable ranking based ... data which are discretised using a large choice of possible rules. The two main problems...
  • SeaPearl

  • Referenced in 1 article [sw41604]
  • critical and non-trivial design choice with such methods is the branching strategy, directing ... design of machine learning-based heuristics to solve combinatorial optimization problems. The goal...
  • popt4jlib

  • Referenced in 1 article [sw30640]
  • contains a fairly large number of meta-heuristic and other exact optimization algorithms parallel/distributed Java ... parallel implementations of the algorithms of their choice, rather than simply using...
  • CoCoA

  • Referenced in 654 articles [sw00143]
  • CoCoA is a system for Computations in Commutative...
  • 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...
  • JMP

  • Referenced in 58 articles [sw00476]
  • For more than 20 years, JMP statistical discovery...