Decentralized Constraint Satisfaction · HackerPapers discussionshttps://hackerpaper.kaipfister.de/p/1103.3240/Collected HN comments and submissions linking this paper.enMon, 02 Nov 2026 11:16:22 GMTDecentralized Constraint Satisfaction — mentioned by deepnethttps://news.ycombinator.com/item?id=10103298urn:hackerpapers:mention:1103.3240:10103298Sat, 22 Aug 2015 18:36:32 GMT<p>Abstract [non pdf] Decentralized Constraint Satisfaction by K. R. Duffy, C. Bordenave, D. J. Leith http://arxiv.org/abs/1103.3240</p><p><a href="https://hackerpaper.kaipfister.de/p/1103.3240/">Paper and discussion history</a>. A mention is not an endorsement.</p>cs.AIDecentralized Constraint Satisfaction — mentioned by dhaivatpandyahttps://news.ycombinator.com/item?id=10103166urn:hackerpapers:mention:1103.3240:10103166Sat, 22 Aug 2015 18:02:31 GMT<p>Communication Free Learning is actually a recently proposed algorithm to resolve constraints. The research paper it originated from is here: http://arxiv.org/pdf/1103.3240.pdf The &quot;Communication Free&quot; part of it means that we can update variables&#x27; values in parallel without having to communicate the updated variable values between the processes updating the variables.</p><p><a href="https://hackerpaper.kaipfister.de/p/1103.3240/">Paper and discussion history</a>. A mention is not an endorsement.</p>cs.AI