@inproceedings { , title = {Solving DisCSPs with penalty-driven search.}, abstract = {We introduce the Distributed, Penalty-driven Local search algorithm (DisPeL) for solving Distributed Constraint Satisfaction Problems. DisPeL is a novel distributed iterative improvement algorithm which escapes local optima by the use of both temporary and incremental penalties and a tabu-like no-good store. We justify the use of these features and provide empirical results which demonstrate the competitiveness of the algorithm.}, conference = {20th American Association for Artificial Intelligence national conference on artificial intelligence (AAAI-05)}, isbn = {9781577352365}, note = {COMPLETED}, pages = {47-52}, publicationstatus = {Published}, publisher = {Association for the Advancement of Artificial Intelligence}, url = {http://hdl.handle.net/10059/288}, keyword = {Distributed constraint satisfaction problems, DisPeL, DisCSP, Distributed penalty driven local search algorithm}, year = {2005}, author = {Basharu, Muhammed and Arana, Inés and Ahriz, Hatem} }