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 ...
  • Escaping local optima with penalties in distributed iterative improvement search. 

    Basharu, Muhammed; Arana, Ines; Ahriz, Hatem (IJCAI, 2005-07)
    BASHARU, M., ARANA, I. and AHRIZ, H., 2005. Escaping local optima with penalties in distributed iterative improvement search. In: Proceedings of the 6th International Workshop on Distributed Constraint Reasoning, DCR2005. 30 July 2005. pp. 192-206.
    The advantages offered by iterative improvement search make it a popular technique for solving problems in centralised settings. However, the key challenge with this approach is finding effective strategies for dealing ...
  • Solving coarse-grained DisCSPs with Multi-DisPeL and DisBO-wd. 

    Basharu, Muhammed; Arana, Ines; Ahriz, Hatem (IEEE Computer Society http://dx.doi.org/10.1109/IAT.2007.68, 2007)
    BASHARU, M., ARANA, I and AHRIZ, A., 2007. Solving coarse-grained DisCSPs with Multi-DisPeL and DisBO-wd. In: TSAU YOUNG LIN, JEFFREY M. BRADSHAW, MATTHIAS KLUSCH, CHENGQUI ZHANG, ANDREI BRODER and HOWARD HO, eds. 2007 IEEE/WIC/ACM International Conference on Intelligent Agent Technology (IAT 2007 Main Conference Proceedings). 2-5 November 2007. California, USA. Pp. 335-341.
    We present Multi-DisPel, a penalty-based local search distributed algorithm which is able to solve coarse-grained Distributed Constraint Satisfaction Problems (DisCSPs) efficiently. Multi-DisPeL uses penalties on values ...