DCFL: Communication Free Learning-based constraint solver

[ data, library, mit ] [ Propose Tags ]

An implementation of Communication Free Learning, a technique used to solve Constraint Satisfcation Problems (CSPs) in a parallelizable manner. The algorithm is described in the paper Decentralized Constraint Satisfaction by Duffy, et. al. and this implementation provides both parallel and serial solvers.

Versions [faq] 0.1.0.0, 0.1.1.0, 0.1.2.0, 0.1.3.0, 0.1.4.0, 0.1.5.0, 0.1.6.0
Dependencies base (>=4.6 && <=5.0), deepseq (>=1.2), HUnit (>=1.2), parallel (>=3.0), random (>=1.0) [details]
License MIT
Author Dhaivat Pandya
Maintainer dpandya@college.harvard.edu
Category Data
Home page https://github.com/Poincare/DCFL
Source repo head: git clone https://github.com/Poincare/DCFL.git
Uploaded by dpandya at Wed Jul 8 08:14:37 UTC 2015
Distributions NixOS:0.1.6.0
Downloads 2539 total (69 in the last 30 days)
Rating (no votes yet) [estimated by rule of succession]
Your Rating
  • λ
  • λ
  • λ
Status Hackage Matrix CI
Docs available [build log]
Last success reported on 2015-07-08 [all 1 reports]

Modules

[Index]

Downloads

Maintainer's Corner

For package maintainers and hackage trustees