Skip to main content
Article thumbnail
Location of Repository

A Distributed Chaotic Iteration Algorithm

By Eric Monfroy and Jean-Hugues Réty


This paper discusses distributed constraint propagation. We propose a generic distributed framework based on the notion of chaotic iteration. We prove correctness and implicit termination of our algorithm that apply to distributed constraint satisfaction problems, and also leads to significant speed-ups on distributions of constraint satisfaction problems. 1 Introduction Constraint propagation is one of the most important techniques for finding solutions to sets of constraints. Constraint propagation algorithms usually aim at reaching some local consistency by gradually reducing a Constraint Satisfaction Problem (CSP) to another one that is equivalent but simpler. These algorithms were generally designed for specific constraint domains and a generic approach was proposed in [1, 2] based on the notion of chaotic iteration, a general technique used for computing limits of iterations of finite sets of functions. In this paper, we present a framework for distributed constraint propa..

Year: 1998
OAI identifier: oai:CiteSeerX.psu:
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • (external link)
  • (external link)
  • Suggested articles

    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.