E. Monfroy. A Coordination-based Chaotic Iteration Algorithm for Constraint Propagation. In Carroll, Damiani, Haddad, Oppenheim (eds.) Proceedings of the 2000 ACM Symposium on Applied Computing , pp. 262--269, ACM Press. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
A Coordination-Based Framework for Distributed Constraint Solving - Zoeteweij (2002) (Correct)
....software. Note: This work is supported by NWO under project number 612.069.003. Note: This report combines references [15, 16, 17] 1. Introduction The applicability of the Idealized Worker Idealized Manager (IWIM) model of coordination in the area of constraint solving has been studied in [3, 11]. This work has materialized in DICE (DIstributed Constraint Environment) a framework, implemented using the Manifold coordination language, where distributed constraint solvers are constructed from software components in a number of predefined categories: domain types for the variables of a ....
....set becomes empty. After each reduction step, the algorithm considers the changes that have been made, and reduction steps that depend on these changes are added to the set. In contrast to such inherently sequential algorithms, DICE implements the coordination based chaotic iteration algorithm of [11]. In this algorithm, each CSP variable is represented by a process that maintains the domain of that variable. Also each domain reduction function is represented by a process that receives input from the processes corresponding to the CSP variables that the function applies to. Channel connections ....
[Article contains additional citation context not shown here]
E. Monfroy. A Coordination-based Chaotic Iteration Algorithm for Constraint Propagation. In Carroll, Damiani, Haddad, Oppenheim (eds.) Proceedings of the 2000 ACM Symposium on Applied Computing , pp. 262--269, ACM Press.
Distributed Splitting of Constraint Satisfaction Problems - Arbab, Monfroy (2000) (1 citation) Self-citation (Monfroy) (Correct)
....The Netherlands fFarhad.Arbab,Eric.Monfroyg cwi.nl ABSTRACT Constraint propagation aims to reduce a constraint satisfaction problem into an equivalent but simpler one. However, constraint propagation must be interleaved with a splitting mechanism in order to compose a complete solver. In [13] a framework for constraint propagation based on a control driven coordination model was presented. In this paper we extend this framework in order to integrate a distributed splitting mechanism. This technique has three main advantages: 1) in a single distributed and generic framework, ....
....be interleaved with a splitting mechanism in order to compose a complete solver. This mechanism works by splitting the domain of a variable (i.e. the values the variable can assume) into (sub)domains, creating in this way sub CSP s. After several splittings, we obtain a tree of subCSP s. In [13] a framework for constraint propagation based on a control driven coordination model was presented. In this paper we extend this framework in order to integrate a distributed splitting mechanism. Intuitively, with every split, we would like to duplicate the entire network of agents in a CSP, one ....
[Article contains additional citation context not shown here]
E. Monfroy. A Coordination-based Chaotic Iteration Algorithm for Constraint Propagation. In J. Carroll, E. Damiani, H. Haddad, and D. Oppenheim, editors, Proceedings of the 2000 ACM Symposium on Applied Computing (SAC'2000), pages 262--269, Villa Olmo, Como, Italy, March 2000. ACM Press.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC