Now showing items 11-22 of 22

  • 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 ...
  • An introduction to interval-based constraint processing. 

    Renker, Gerrit; Ahriz, Hatem (Polish Academy of Sciences Committee of Automatic Control and Robotics, 2006)
    RENKER, G. and AHRIZ, H., 2006. An introduction to interval-based constraint processing. Archives of Control Sciences, 16 (2), pp. 161-190
    Constraint programming is often associated with solving problems over finite domains. Many applications in engineering, CAD and design, however, require solving problems over continuous (real-valued) domains. While simple ...
  • A methodology for the elicitation of redesign knowledge. 

    Ahriz, Hatem; Arana, Ines (IOS Press, 2002-09)
    AHRIZ, H. and ARANA, I. 2002. A methodology for the elicitation of redesign knowledge. In: E. DAMIANI, R. J. HOWLETT, L. C. JAIN and N. ICHALKARANJE, eds. Knowledge-based intelligent information engineering systems and allied technologies. Proceedings of KES 2002. 16-18 September 2002, Crema, Italy. Pp. 156-160.
    We present MADAM, a methodology which allows the elicitation, capture, analysis and management of redesign knowledge. This area is characterised by the high reusability of problem solutions and is represented using three ...
  • 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. ...
  • Plan recommendation for well engineering. 

    Thomson, Richard; Massie, Stewart; Craw, Susan; Ahriz, Hatem; Mills, Ian (Springer http://dx.doi.org/10.1007/978-3-642-21827-9_45, 2011-07)
    THOMSON, R., MASSIE, S., CRAW, S., AHRIZ, H. and MILLS, I., 2011. Plan recommendation for well engineering. In: K. G. MEHOTRA, C. K. MOHAN, J. C. OH, P. K. VARSHNEY and M. ALI, eds. Modern Approaches in Applied Intelligence: Proceedings of the 24th International Conference on Industrial, Engineering and Other Applications of Applied Intelligent Systems, Part II. 28 June – 1 July 2011. Berlin: Springer. Pp. 436-445.
    Good project planning provides the basis for successful offshore well drilling projects. In this domain, planning occurs in two phases: an onshore phase develops a project plan; and an offshore phase implements the plan ...
  • 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 ...
  • Solving DisCSPs with penalty-driven search. 

    Basharu, Muhammed; Arana, Ines; Ahriz, Hatem (AAAI Press, 2005-07)
    BASHARU,M., ARANA, I. and AHRIZ, H. 2005. Solving DisCSPs with penalty-driven search. In: Proceedings of the Twentieth National Conference of Artificial Intelligence. 9-11 July 2005. Pittsburgh, Pennsylvania. pp. 47-52
    We introduce the Distributed, Penalty-driven Local search algorithm (DisPeL) for solving Distributed Constraint Satisfaction Problems. DisPeL is a novel distributed iterative improvement algorithm which escapes local ...
  • A step toward reusable model fragments. 

    Ahriz, Hatem; Tomasena, M. (IEEE Computer Society., 2001)
    AHRIZ, A. and TOMASENA, M., 2001. A step toward reusable model fragments. In: Proceedings of the International Conference on computational Intelligence for Modeling Control and Automation (CIMCA ‘2001). 9-11 July 2001. Las Vegas, USA. Pp. 559-566.
    In this paper we describe a system to elaborate models which are suitable for model based reasoning. A set of model fragments selected from a library will be put together to build a model candidate. The system relies on ...
  • Stoch-DisPeL: exploiting randomisation in DisPeL. 

    Basharu, Muhammed; Arana, Ines; Ahriz, Hatem (2006)
    BASHARU, M., ARANA, I. and AHRIZ, H., 2006. Stoch-DisPeL: exploiting randomisation in DisPeL. In: Proceedings of 7th International Workshop on Distributed Constraint Reasoning, DCR2006. 8 May 2006. Hakodate, Japan. pp. 117-131.
    We present Stoch-DisPeL, an extension of the distributed constraint programming algorithm DisPeL which incorporates randomisation into the algorithm. We justify the introduction of stochastic moves and analyse its ...