@hackage / DCFL

Communication Free Learning-based constraint solver

Latest0.1.6.0

About

Metadata

  • Last updated , by dpandya
  • License MIT

  • Maintained by: dpandya@college.harvard.edu

  • Lottery factor: 0

Links

Installation

Readme

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.