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.




Maintainer's Corner

Package maintainers

For package maintainers and hackage trustees


Versions [RSS],,,,,,
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 2015-07-08T08:14:37Z
Distributions NixOS:
Reverse Dependencies 1 direct, 0 indirect [details]
Downloads 5196 total (20 in the last 30 days)
Rating (no votes yet) [estimated by Bayesian average]
Your Rating
  • λ
  • λ
  • λ
Status Docs available [build log]
Last success reported on 2015-07-08 [all 1 reports]