Now showing items 2-3 of 3

  • A hybrid approach to solving coarse-grained DisCSPs. 

    Lee, David; Arana, Ines; Ahriz, Hatem; Hui, Kit-Ying (International Foundation for Autonomous Agents & Multi-Agent Systems http://www.ifaamas.org/Proceedings/aamas09/pdf/02_Extended_Abstract/C_SP_0555.pdf, 2009-05)
    LEE, D., ARANA, I., AHRIZ, H. and HUI, K-Y., 2009. A hybrid approach to solving coarse-grained DisCSPs. In: Proceedings of the Eighth International Conference on Autonomous Agents and Multi Agent Systems (AAMAS 09), 10-15 May 2009. Budapest: IFAAMAS. Pp. 1235-1236.
    A coarse-grained Distributed Constraint Satisfaction Problem (DisCSP) consists of several loosely connected constraint satisfaction subproblems, each assigned to an individual agent. We present Multi-Hyb, a two-phase ...
  • 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. ...