• DICOPT

  • Referenced in 38 articles [sw04938]
  • Mellon University. The program is based on the extensions of the outer-approximation algorithm...
  • Church

  • Referenced in 51 articles [sw08946]
  • generative models. We introduce Church, a universal language for describing stochastic generative processes. Church ... query on any Church program, exactly and approximately, using Monte Carlo techniques...
  • Eigentaste

  • Referenced in 63 articles [sw12451]
  • collaborative filtering algorithm that uses universal queries to elicit real-valued user ratings ... online joke recommending system.par Jester has collected approximately 2,500,000 ratings from...
  • Agrep

  • Referenced in 11 articles [sw15546]
  • string or regular expression, with approximate matching capabilities and user-definable records. Developed ... Manber, Sun Wu et al. at the University of Arizona. ISC open source license since...
  • PURRS

  • Referenced in 9 articles [sw05465]
  • Parma University’s Recurrence Relation Solver) is a C++ library for the (possibly approximate) solution...
  • MUSTA

  • Referenced in 12 articles [sw09091]
  • Isaac Newton Institute for Mathematical Sciences, University of Cambridge, UK, 17th June (2003)] for constructing ... scheme may be interpreted as an unconventional approximate Riemann solver that has simplicity and generality...
  • GFORCE

  • Referenced in 22 articles [sw06607]
  • Isaac Newton Institute for Mathematical Sciences, University of Cambridge, UK, 17th June, 2003], resulting ... with the exact Riemann solver or complete approximate Riemann solvers, noting however that...
  • SuSpect

  • Referenced in 25 articles [sw00933]
  • breaking models, but also in the non-universal MSSM case with R-parity ... options and choices for model assumptions and approximations...
  • ADVENTURE

  • Referenced in 11 articles [sw06640]
  • Computational Mechanics Laboratory at Kyushu University. Our model is that of hydrogen dispersion ... fossil fuels. An analogy of the Boussinesq approximation is applied in our simulation. We describe...
  • RBF

  • Referenced in 2 articles [sw34726]
  • Approximation Methods with Matlab” by Gregory Fasshauer. RBF is developed by Trever Hines (hinest@umich.edu), University...
  • FRI

  • Referenced in 9 articles [sw07389]
  • covered (at level α), if all input universes are covered by rules at level ... base systems. Basically, FRI techniques perform interpolative approximate reasoning by taking into consideration the existing...
  • ANN toolbox

  • Referenced in 5 articles [sw09959]
  • Virginia University) and Mario Luca Fravolini (Perugia University). Later improvements were partially supported ... functions. Also, a Simulink example regarding the approximation of a scalar nonlinear function is included...
  • SecondString

  • Referenced in 1 article [sw27620]
  • approximate string-matching techniques. This code was developed by researchers at Carnegie Mellon University from...
  • BVLS

  • Referenced in 5 articles [sw04345]
  • model constrained to satisfy, in approximate l p -norm sense, a set of linear equality ... from the statlib gopher at Carnegie Mellon University...
  • DECIS

  • Referenced in 4 articles [sw21978]
  • solution strategies, such as solving the universe problem, the expected value problem, Monte Carlo sampling ... either an additive or a multiplicative approximation function. Pre-sampling is limited to using crude...
  • SpecialValue

  • Referenced in 2 articles [sw05463]
  • useful for fractions that would normally be approximated as floating point, or numbers that ... ideas behind the implementation are described in ‘Universal semantics for computer arithmetic implementations...
  • QuickhullDisk

  • Referenced in 5 articles [sw31399]
  • particularly for big data. QuickhullDisk is approximately 2.6 times faster than the incremental algorithm ... version from Voronoi Diagram Research Center, Hanyang University (http://voronoi.hanyang.ac.kr...
  • SparseCount2

  • Referenced in 1 article [sw41091]
  • varphi). The hashing-based techniques for approximate counting have emerged as a dominant approach, promising ... guarantees. The standard construction of strongly 2-universal hash functions employs dense XORs (i.e., involving...
  • ApproxMC3

  • Referenced in 1 article [sw41092]
  • varphi). The hashing-based techniques for approximate counting have emerged as a dominant approach, promising ... guarantees. The standard construction of strongly 2-universal hash functions employs dense XORs (i.e., involving...
  • ABAKO/RAPCAL

  • Referenced in 4 articles [sw20547]
  • local thermodynamic equilibrium (NLTE) conditions are universal in laboratory and astrophysical plasmas and, for this ... plasmas. ABAKO/RAPCAL combines a set of analytical approximations which yield substantial savings in computing running...