• Graphplan

  • Referenced in 179 articles [sw07746]
  • Fast planning through planning graph analysis. We introduce a new approach to planning in STRIPS ... paradigm. Graphplan always returns a shortest possible partial-order plan, or states that no valid ... total-order planner, Prodigy, and the partial-order planner, UCPOP, on a variety of interesting ... produced by Graphplan are quite sensible. Since searches made by this approach are fundamentally different...
  • TINKER

  • Referenced in 8 articles [sw04095]
  • partial charges and polarizable multipoles, a novel reaction field treatment of long range electrostatics, fast ... reaction path algorithm, our potential smoothing and search (PSS) methods for global optimization, Monte Carlo...
  • ADP_EM

  • Referenced in 3 articles [sw16893]
  • partial high-resolution models into a low-resolution density map. The method incorporates a fast ... rotational search based on spherical harmonics (SH) combined with a simple translational scanning. Results: This...
  • LPG

  • Referenced in 12 articles [sw20690]
  • current partial plan, and are dynamically evaluated during search using discrete Lagrange multipliers. The evaluation ... function uses some heuristics to estimate the ”search cost” and the ”execution cost” of achieving ... precedence graph” that is maintained during search, and that takes into account the mutex relations ... switch to best-first search after a certain number of search steps and ”restarts” have...
  • PESC

  • Referenced in 5 articles [sw17860]
  • acquisition function and call it Predictive Entropy Search with Constraints (PESC). PESC is an approximation ... with a mix of functions that are fast and slow to evaluate. These problems require ... bounded rationality approach and develop a partial update for PESC which trades off accuracy against...
  • ATLAS

  • Referenced in 194 articles [sw00056]
  • This paper describes the Automatically Tuned Linear Algebra...
  • C-XSC 2.0

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

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

  • Referenced in 161 articles [sw00490]
  • KNITRO is a solver for nonlinear optimization. It...
  • LANCELOT

  • Referenced in 276 articles [sw00500]
  • LANCELOT. A Fortran package for large-scale nonlinear...
  • LAPACK

  • Referenced in 1552 articles [sw00503]
  • LAPACK is written in Fortran 90 and provides...
  • LSQR

  • Referenced in 333 articles [sw00530]
  • Algorithm 583: LSQR: Sparse Linear Equations and Least...
  • Magma

  • Referenced in 2602 articles [sw00540]
  • Computer algebra system (CAS). Magma is a large...
  • Maple

  • Referenced in 4841 articles [sw00545]
  • The result of over 30 years of cutting...
  • Mathematica

  • Referenced in 5559 articles [sw00554]
  • Almost any workflow involves computing results, and that...
  • Matlab

  • Referenced in 11158 articles [sw00558]
  • MATLAB® is a high-level language and interactive...
  • NAG

  • Referenced in 359 articles [sw00610]
  • Produced by experts for use in a variety...
  • nauty

  • Referenced in 518 articles [sw00611]
  • graph-theoretic program NAUTY: nauty is a program...
  • NTL

  • Referenced in 188 articles [sw00638]
  • NTL is a high-performance, portable C++ library...