Skip to main content

Research Repository

Advanced Search

Stoch-DisPeL: exploiting randomisation in DisPeL.

Basharu, Muhammed; Arana, In�s; Ahriz, Hatem

Authors

Muhammed Basharu



Abstract

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.

Citation

BASHARU, M., ARANA, I. and AHRIZ, H. 2006. Stoch-DisPeL: exploiting randomisation in DisPeL. Presented at the 7th International workshop on distributed constraint reasoning (DCR 2006), part of the 5th International joint conference on autonomous agents and multiagent systems (AAMAS 2006), 8-12 May 2006, Hakodate, Japan.

Presentation Conference Type Conference Paper (unpublished)
Conference Name 7th International workshop on distributed constraint reasoning (DCR 2006)
Conference Location Hakodate, Japan
Start Date May 8, 2006
End Date May 12, 2006
Deposit Date Dec 8, 2008
Publicly Available Date Mar 28, 2024
Keywords DisPeL; Distributed constraint programming algorithm; Stoch DisPeL
Public URL http://hdl.handle.net/10059/264

Files




You might also like



Downloadable Citations