Now showing items 1-3 of 3

  • DisBO-wd: a distributed constraint satisfaction algorithm for coarse-grained distributed problems. 

    Basharu, Muhammed; Arana, Ines; Ahriz, Hatem (Springer-Verlag http://dx.doi.org/10.1007/978-1-84800-094-0_3, 2007)
    BASHARU, M., ARANA, I. and AHRIZ, H. 2007. DisBO-wd: a distributed constraint satisfaction algorithm for coarse-grained distributed problems. In: M. BRAMER, F. COENEN and M. PETRIDIS, eds. Research and Development in Intelligent Systems XXIV. Proceedings of the 27th SGAI International Conference on Artificial Intelligence, AI-07. 10-12 December 2007. Cambridge. pp. 23-36
    We present a distributed iterative improvement algorithm for solving coarse-grained distributed constraint satisfaction problems (DisCSPs). Our algorithm is inspired by the Distributed Breakout for coarse-grained ...
  • Distributed guided local search for solving binary DisCSPs. 

    Basharu, Muhammed; Arana, Ines; Ahriz, Hatem (AAAI Press, 2005-05)
    BASHARU, M., ARANA, I. and AHRIZ, H. 2005. Distributed guided local search for solving binary DisCSPs. In: Proceedings of the 18th International FLAIRS Conference. 16-18 May 2005. Florida. pp. 660-665
    We introduce the Distributed Guided Local Search (Dist- GLS) algorithm for solving Distributed Constraint Satisfaction Problems. Our algorithm is based on the centralised Guided Local Search algorithm, which is extended ...
  • Solving DisCSPs with penalty-driven search. 

    Basharu, Muhammed; Arana, Ines; Ahriz, Hatem (AAAI Press, 2005-07)
    BASHARU,M., ARANA, I. and AHRIZ, H. 2005. Solving DisCSPs with penalty-driven search. In: Proceedings of the Twentieth National Conference of Artificial Intelligence. 9-11 July 2005. Pittsburgh, Pennsylvania. pp. 47-52
    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 ...