Now showing items 21-26 of 26

  • 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 ...
  • Verification of redesign models: a CSP approach. 

    Arana, Ines; Ahriz, Hatem (Professional Engineering Publishing, 2001-08-21)
    ARANA, I. and AHRIZ, H. 2001. Verification of redesign models: a CSP approach. In the Proceedings of the 13th international conference on engineering design (ICED'01), 21-23 August 2001, Glasgow, UK. Glasgow: Professional Engineering Publishing, pages 283-290.
    One of the initial stages in the manufacturing of an article is the production of a design which satisfies a set of user requirements. Much of the design work carried out in manufacturing companies can be classified as ...