Now showing items 1-4 of 4

  • 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 ...
  • Dynamic agent priotisation with penalties in distributed local search. 

    Sambo-Magaji, Amina; Arana, Ines; Ahriz, Hatem (SciTePress http://dx.doi.org/10.5220/0004259202760281, 2013-02)
    SAMBO-MAGAJI, A., ARANA, I. and AHRIZ, H., 2013. Dynamic agent priotisation with penalties in distributed local search. In: J. FILIPE and A. L. N. FRED, EDS, Proceedings of the Fifth International Conference on Agents and Artificial Intelligence (ICAART 2013), 15-18 February 2013. Lisbon: SciTePress. Pp. 276-281.
    Distributed Constraint Satisfaction Problems (DisCSPs) solving techniques solve problems which are distributed over a number of agents.The distribution of the problem is required due to privacy, security or cost issues ...
  • Multi-HDCS: solving DisCSPs with complex local problems cooperatively. 

    Lee, David; Arana, Ines; Ahriz, Hatem; Hui, Kit-Ying (IEEE Computer Society http://dx.doi.org/10.1109/WI-IAT.2010.141, 2010-09)
    LEE, D., ARANA, I., AHRIZ, H. and HUI, K., 2010. Multi-HDCS: solving DisCSPs with complex local problems cooperatively. In: Proceedings of IEEE/WIC/ACM International Conference on Web Intellligence and Intelligent Agent Technology (WI-IAT 2010). 31 August – 3 September 2010.
    We propose Multi-HDCS, a new hybrid approach for solving Distributed CSPs with complex local problems. In Multi-HDCS, each agent concurrently: (i) runs a centralised systematic search for its complex local problem; (ii) ...
  • Multi-hyb: a hybrid algorithm for solving DisCSPs with complex local problems. 

    Lee, David; Arana, Ines; Ahriz, Hatem; Hui, Kit-Ying (IEEE Computer Society. http://dx.doi.org/10.1109/WI-IAT.2009.181, 2009-09)
    LEE, D., ARANA, I., AHRIZ, H. and HUI, K.-Y., 2009. Multi-hyb: a hybrid algorithm for solving DisCSPs with complex local problems. In: P. BOLDI, G. VIZZARI, G. PASI and R. BAEZA-YATES eds. Web Intelligence and Intelligent Agent Technologies, 2009. WI-IAT '09. IEEE/WIC/ACM International Joint Conferences on , vol.2. 15-18 September 2009, Los Alamitos, California: IEEE Computer Society. Pp. 379-382.
    A coarse-grained Distributed Constraint Satisfaction Problem (DisCSP) is a constraint problem where several agents, each responsible for solving one part (a complex local problem), cooperate to determine an overall solution. ...