DisCSPs are composed of agents that manage variables which are connected by constraints, various algorithms for solving DisCSPs are searching through this network of constraints. The scale-free graphs have been proposed as a generic and universal model of network topologies that exhibit power-law distributions in the connectivity of network nodes. Little research was done concerning the network structure for DisCSP and in particular for scale-free networks. The asynchronous searching techniques are characterized by the occurrence of the nogood values during the search for the solution. In this article we analyzed the distribution of nogood values to agents and the way to use the information stored in the nogood, what we will call the nogood processor technique. We examine the effect of nogood processor for networks that have a scale-free structure. We develop a novel way for the distribution of nogood values to agents, the experiments show that it is more effective for several families of asynchronous techniques.
展开▼
