Improved Forward Checking Tree Algorithm for Distributed Constraint Satisfaction Problems
Constraint Programming (CP) is one of the promising and hopeful Artificial Intelligence paradigms. It’s based on its powerful framework named Constraint Satisfaction Problem (CSP). This framework makes it possible to formalize many real world combinatorial problems. The Distributed CSP (DisCSP) is used when the problem is distributed into groups of variables; each one managed by a specific agent; and that the values of those variables can only be modified by their respective agent. Many algorithms have been proposed to solve DisCSP problems. Their main purpose is to reduce the solving time, the number of constraint checks and the number of exchanged messages between the agents during the solving process. In this paper, we propose a new algorithm based on the Asynchronous Forward Checking Tree (AFC-tree) algorithm for the DisCSP problems named Improved Forward Checking Tree (IFC-tree). The experimental results show the efficiency of this algorithm by improving different metrics of the solving performances.
Disclaimer/Regarding indexing issue:
We have provided the online access of all issues and papers to the indexing agencies (as given on journal web site). It’s depend on indexing agencies when, how and what manner they can index or not. Hence, we like to inform that on the basis of earlier indexing, we can’t predict the today or future indexing policy of third party (i.e. indexing agencies) as they have right to discontinue any journal at any time without prior information to the journal. So, please neither sends any question nor expects any answer from us on the behalf of third party i.e. indexing agencies.Hence, we will not issue any certificate or letter for indexing issue. Our role is just to provide the online access to them. So we do properly this and one can visit indexing agencies website to get the authentic information.