Now showing items 1-3 of 3

  • Combining search strategies for distributed constraint satisfaction. 

    Magaji, Amina Sambo-Muhammad (Robert Gordon University School of Computing Science and Digital Media, 2015-08)
    Many real-life problems such as distributed meeting scheduling, mobile frequency allocation and resource allocation can be solved using multi-agent paradigms. Distributed constraint satisfaction problems (DisCSPs) is a ...
  • 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 ...
  • Escaping local optima: constraint weights vs. value penalties. 

    Basharu, Muhammed; Arana, Ines; Ahriz, Hatem (Springer Verlag http://dx.doi.org/10.1007/978-1-84800-094-0_5, 2007)
    BASHARU, M., ARANA, I. and AHRIZ, H. 2007. Escaping local optima: constraint weights vs. value penalties. In: M. BRAMER, F. COENEN and PETRIDIS, M. (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. 51-64
    Constraint Satisfaction Problems can be solved using either iterative improvement or constructive search approaches. Iterative improvement techniques converge quicker than the constructive search techniques on large ...