mighty-metropolis

The classic Metropolis algorithm.
git clone git://git.jtobin.io/mighty-metropolis.git
Log | Files | Refs | README | LICENSE

commit 509f316170aad907cd474dc399bab658b8adbf22
parent 9179b1c88410e15f532fa7d51e94ce20ed484a56
Author: Jared Tobin <jared@jtobin.io>
Date:   Sun, 27 Oct 2024 19:46:32 +0800

Remove old badges and such in readme.

Diffstat:
MREADME.md | 6------
1 file changed, 0 insertions(+), 6 deletions(-)

diff --git a/README.md b/README.md @@ -1,9 +1,5 @@ # mighty-metropolis -[![Build Status](https://secure.travis-ci.org/jtobin/mighty-metropolis.png)](http://travis-ci.org/jtobin/mighty-metropolis) -[![Hackage Version](https://img.shields.io/hackage/v/mighty-metropolis.svg)](http://hackage.haskell.org/package/mighty-metropolis) -[![MIT License](https://img.shields.io/badge/license-MIT-blue.svg)](https://github.com/jtobin/mighty-metropolis/blob/master/LICENSE) - The classic Metropolis algorithm. Wander around parameter space according to a simple spherical Gaussian distribution. @@ -21,8 +17,6 @@ See the *test* directory for example usage. main :: IO () main = withSystemRandom . asGenIO $ mcmc 10000 1 [0, 0] rosenbrock -![trace](https://dl.dropboxusercontent.com/spa/u0s6617yxinm2ca/osecfv_w.png) - *mighty-metropolis* is a member of the [declarative][decl] suite of libraries, containing a bunch of MCMC algorithms that play nicely together.