The local-search package
This library represents a first attempt at creating a generalised library for local (non-exhaustive) search in Haskell. It is based on work presented to IFL2010, a draft of which is currently available on the homepage. The library models local search space using a rose tree, with child nodes forming the neighbourhood of any solution. The tree can then be transformed by various combinators to implement different searching strategies; the result is then navigated to yield a sequence of solutions.
Properties
| Versions | 0.0.1, 0.0.2, 0.0.3 |
|---|---|
| Dependencies | base (≥2.0 & ≤5), containers (≥0.2.0.1), random (≥1.0.0.1) |
| License | GPL |
| Copyright | Copyright (c) 2010 Richard Senington |
| Author | Richard Senington & David Duke |
| Maintainer | sc06r2s@leeds.ac.uk |
| Stability | experimental |
| Category | Control, Optimisation, Local Search |
| Home page | http://www.comp.leeds.ac.uk/sc06r2s/Projects/HaskellLocalSearch |
| Upload date | Thu Sep 9 10:18:46 UTC 2010 |
| Uploaded by | RichardSenington |
| Built on | ghc-6.12, ghc-7.0 |
Modules
Downloads
- local-search-0.0.3.tar.gz (Cabal source package)
- package description (included in the package)