期刊名称：Journal of Emerging Trends in Computing and Information Sciences
电子版ISSN：2079-8407
出版年度：2015
卷号：6
期号：10
页码：523-531
出版社：ARPN Publishers
摘要：A distributed constraint satisfaction problem (DisCSP) is a constraint satisfaction problem in which variables and constraints are distributed among multiple agents. One of the main issues in DisCSPs is privacy: agents may not want to share their values or their constraint or their domain, and they may wish to keep constraints as private as possible. In order to improve constraint privacy in the DisCSPs, we use partially known constraints (PKC) in which constraints are kept private and are only partially known to agents. A new version of nogood-based Asynchronous Forward-Checking (AFC-ng) algorithm that works with PKC, 2phase AFC-ng algorithm (AFC-ng-2ph), a hybrid private algorithm to DisCSPs, is presented in this paper. The experimental results on randomly generated DisCSPs show that the AFC-ng-2ph is more efficient than some private algorithms like two-phase asynchronous backtracking algorithm (ABT-2ph) and two-phase distributed Forward-Checking (DisFC-2ph).
