论文信息 - Stoch-DisPeL: exploiting randomisation in DisPeL.

Stoch-DisPeL: exploiting randomisation in DisPeL.

We present Stoch-DisPeL, an extension of the distributed constraint programming algorithm DisPeL which incorporates randomisation into the algorithm. We justify the introduction of stochastic moves and analyse its performance on random DisCSPs and on Distributed SAT problems. We also empirically compare Stoch-DisPeL’s performance to that of DisPel and DSA-B1N our improved version of DSA. The results obtained show a clear advantage of the introduction of random moves in DisPeL. Our new algorithm, Stoch-DisPeL, also performs better than DSA-B1N.

Muhammed Basharu | Inés Arana | Hatem Ahriz

[1] I. Arana,et al. Escaping local optima with penalties in distributed iterative improvement search. , 2005 .

[2] Bart Selman,et al. Boosting Combinatorial Search Through Randomization , 1998, AAAI/IAAI.

[3] Holger H. Hoos,et al. Scaling and Probabilistic Smoothing: Efficient Dynamic Local Search for SAT , 2002, CP.

[4] Makoto Yokoo,et al. The distributed breakout algorithms , 2005, Artif. Intell..

[5] M. Yokoo,et al. Distributed Breakout Algorithm for Solving Distributed Constraint Satisfaction Problems , 1996 .

[6] Weixiong Zhang,et al. Distributed stochastic search and distributed breakout: properties, comparison and applications to constraint optimization problems in sensor networks , 2005, Artif. Intell..

[7] Christian Bessiere,et al. Backtracking in Distributed Constraint Networks , 1998 .

[8] Muhammed Basharu,et al. Solving DisCSPs with Penalty Driven Search , 2005, AAAI.

[9] Weixiong Zhang,et al. Distributed Stochastic Search for Constraint Satisfaction and Optimization: Parallelism, Phase Transitions and Performance , 2002 .

[10] Thomas Stützle,et al. SATLIB: An Online Resource for Research on SAT , 2000 .

[11] Thomas Stützle,et al. Evaluating Las Vegas Algorithms: Pitfalls and Remedies , 1998, UAI.