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. (http:/arxiv.orgpdf/1103.3240.pdf) and this implementation provides both parallel and serial solvers.


[Last Documentation]

  • Data
    • Data.DCFL


Maintainer's Corner

Package maintainers

For package maintainers and hackage trustees


Versions [RSS],,,,,,
Dependencies base (>=4.6 && <4.7), HUnit (>=1.2 && <1.3), random (>=1.0 && <1.1) [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-05T11:11:27Z
Distributions NixOS:
Reverse Dependencies 1 direct, 0 indirect [details]
Downloads 5043 total (1 in the last 30 days)
Rating (no votes yet) [estimated by Bayesian average]
Your Rating
  • λ
  • λ
  • λ
Status Docs not available [build log]
All reported builds failed as of 2016-12-08 [all 7 reports]