Now showing items 1-6 of 6

  • Hybrid algorithms for distributed constraint satisfaction. 

    Lee, David Alexander James (The Robert Gordon University School of Computing, 2010-04)
    LEE, D., ARANA, I., AHRIZ, H. and HUI, K.-Y., 2008. A hybrid approach to distributed constraint satisfaction. In: D. DOCHEV, P. TRAVERSO and M. PISTORE, eds. Artificial intelligence: methodology, systems and applications. Proceedings of the 13th International Conference, AIMSA 2008. Varna, Bulgaria, September 4-6 2008. pp. 375-379.
     
    LEE, D., ARANA, I., AHRIZ, H. and HUI, K.-Y., 2009. Multi-hyb: a hybrid algorithm for solving DisCSPs with complex local problems. In: Proceedings of 2009 IEEE/WIC/ACM International Conference on Intelligent Agent Technology (IAT 2009). Milan, Italy. 15th-18th September 2009. pp. 379-382.
     
    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). Budapest, Hungary. 10th-15th May 2009. pp. 1235-1236.
     
    A Distributed Constraint Satisfaction Problem (DisCSP) is a CSP which is divided into several inter-related complex local problems, each assigned to a different agent. Thus, each agent has knowledge of the variables and ...
  • A hybrid approach to distributed constraint satisfaction. 

    Lee, David; Arana, Ines; Ahriz, Hatem; Hui, Kit-Ying (Springer Verlag http://dx.doi.org/10.1007/978-3-540-85776-1_33, 2008)
    LEE, D., ARANA, I., AHRIZ, H. and HUI, K. 2008. A hybrid approach to distributed constraint satisfaction. In: Proceedings of the 13th International Conference on Artificial Intelligence: Methodology, Systems, Applications (AIMSA). 4-6 September 2008. Varna, Bulgaria. pp. 375-379
    We present a hybrid approach to Distributed Constraint Satisfaction which combines incomplete, fast, penalty-based local search with complete, slower systematic search. Thus, we propose the hybrid algorithm PenDHyb ...
  • 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-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. ...
  • Related scientific information: a study on user-defined relevance. 

    Beresi, Ulises Cervino (Robert Gordon University School of Computing, 2011-09)
    This dissertation presents an investigation into the manifestations of relevance observed in the context of related scientific information. The main motivation is to observe if researchers, in the context of knowledge ...