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.

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.*), HUnit (==1.2.*), 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 Sun Jul 5 11:11:27 UTC 2015
Distributions NixOS:0.1.6.0
Downloads 2561 total (22 in the last 30 days)
Rating (no votes yet) [estimated by rule of succession]
Your Rating
  • λ
  • λ
  • λ
Status Hackage Matrix CI
Docs not available [build log]
All reported builds failed as of 2016-12-08 [all 7 reports]

Modules

  • Data
    • Data.DCFL

Downloads

Maintainer's Corner

For package maintainers and hackage trustees