homepage: https://github.com/Poincare/DCFL
changelog-type: ''
hash: 282f5f63610dae110dd23adbba1cc9c96437657bd039d9eaf033e6d5bad82bd1
test-bench-deps: {}
maintainer: dpandya@college.harvard.edu
synopsis: Communication Free Learning-based constraint solver
changelog: ''
basic-deps:
  base: ==4.6.*
  HUnit: ==1.2.*
  random: ==1.0.*
all-versions:
- '0.1.0.0'
- '0.1.1.0'
author: Dhaivat Pandya
latest: '0.1.1.0'
description-type: haddock
description: A serialized and centralized implementation of Communication Free Learning,
  a technique used to solve Constraint Satisfcation Problems (CSPs) in a parallelizable
  manner.
license-name: MIT

homepage: https://github.com/Poincare/DCFL
changelog-type: ''
hash: f1f5d0b4ad6ca3703e7260eb6b494f0f75fa784154fa11890e29b9e2c6e4ac27
test-bench-deps: {}
maintainer: dpandya@college.harvard.edu
synopsis: Communication Free Learning-based constraint solver
changelog: ''
basic-deps:
  base: ==4.6.*
  HUnit: ==1.2.*
  random: ==1.0.*
all-versions:
- '0.1.0.0'
- '0.1.1.0'
- '0.1.2.0'
author: Dhaivat Pandya
latest: '0.1.2.0'
description-type: haddock
description: 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.org/pdf/1103.3240.pdf) and this implementation provides both parallel
  and serial solvers.
license-name: MIT

Update from Hackage at 2015-07-05T11:19:18+0000
Update from Hackage at 2015-07-05T11:19:18+0000
