Stoch-DisPeL: exploiting randomisation in DisPeL.
Muhammed Basharu, Inés Arana, Hatem Ahriz · Open Access Institutional Repository at Robert Gordon University (Robert Gordon University) · 2006
Abstract. We present Stoch-DisPeL, an extension of the distributed constraint programming algorithm DisPeL which incorporates randomi-sation 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. 1