• AdMit

  • Referenced in 8 articles [sw09498]
  • target density function. The core algorithm consists of the function AdMit which fits an adaptive ... importance sampling or the independence chain Metropolis-Hastings algorithm is used to obtain quantities ... difficult task of tuning a sampling algorithm. The relevance of the package is shown ... cases of importance sampling and the Metropolis-Hastings algorithm using a naive candidate and with...
  • Figaro

  • Referenced in 10 articles [sw28902]
  • classes. Figaro provides a modular, compositional Metropolis-Hastings algorithm, and gives the modeler optional control...
  • MHTrajectoryR

  • Referenced in 2 articles [sw18786]
  • model space is huge, a Metropolis-Hastings algorithm carries out the model selection by maximizing...
  • glmdisc

  • Referenced in 1 article [sw33577]
  • Logistic Regression. A Stochastic-Expectation-Maximization (SEM) algorithm (Celeux et al. (1995) ) ... added to the model through a Metropolis-Hastings algorithm (Hastings...
  • CosmoHammer

  • Referenced in 1 article [sw21685]
  • typically based on the Metropolis-Hastings algorithm. Some of the required calculations can however ... achieve greater speed through parallelisation, MCMC algorithms need to have short auto-correlation times ... from cosmic microwave background data. While Metropolis-Hastings is dominated by overheads, CosmoHammer is able...
  • Graph_sampler

  • Referenced in 1 article [sw20652]
  • faster jumping kernel strategy in the Metropolis-Hastings algorithm. The source C code distributed...
  • Biips

  • Referenced in 3 articles [sw19385]
  • sequential Monte Carlo based algorithms (particle filters, particle independent Metropolis-Hastings, particle marginal Metropolis-Hastings...
  • HelpersMG

  • Referenced in 0 articles [sw15949]
  • with change of color of text, Metropolis-Hastings algorithm for Bayesian MCMC analysis, plot graphs...
  • BClass

  • Referenced in 1 article [sw26091]
  • within them. Using standard Metropolis-Hastings and Gibbs sampling algorithms, we constructed a sampler...
  • Venture

  • Referenced in 8 articles [sw14670]
  • describe a family of stochastic regeneration algorithms for efficiently modifying PET fragments contained within scaffolds ... general-purpose inference strategies such as Metropolis-Hastings, Gibbs sampling, and blocked proposals based...
  • fabMix

  • Referenced in 2 articles [sw32111]
  • swap states using a Metropolis-Hastings move. Eight different parameterizations give rise to parsimonious representations ... simulated output with the Equivalence Classes Representatives algorithm (Papastamoulis and Iliopoulos (2010) ,...
  • CoCoA

  • Referenced in 621 articles [sw00143]
  • CoCoA is a system for Computations in Commutative...
  • GAUSS

  • Referenced in 116 articles [sw00322]
  • The GAUSS Mathematical and Statistical System is a...
  • hsmm

  • Referenced in 14 articles [sw00419]
  • R package hsmm: Hidden Semi Markov Models: This...
  • LAPACK

  • Referenced in 1626 articles [sw00503]
  • LAPACK is written in Fortran 90 and provides...
  • Maple

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

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

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

  • Referenced in 8359 articles [sw00771]
  • R is a language and environment for statistical...