Skip to main content

Research Repository

Advanced Search

All Outputs (32)

Solving DisCSPs with penalty-driven search. (2005)
Conference Proceeding
BASHARU,M., ARANA, I. and AHRIZ, H. 2005. Solving DisCSPs with penalty-driven search. In Proceedings of the 20th American Association for Artificial Intelligence national conference on artificial intelligence (AAAI-05), co-located with the 17th Annual conference on innovative applications of artificial intelligence (IAAI-05), 9-13 July 2005, Pittsburgh, USA. Palo Alto: AAAI Press, pages 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 optima by the use of both tempora... Read More about Solving DisCSPs with penalty-driven search..

Distributed guided local search for solving binary DisCSPs. (2005)
Conference Proceeding
BASHARU, M., ARANA, I. and AHRIZ, H. 2005. Distributed guided local search for solving binary DisCSPs. In Russell, I. and Markov, Z. (eds.) Proceedings of the 18th International conference of the Florida Artificial Intelligence Research Society (FLAIRS 2005), 16-18 May 2005, Clearwater, USA. Palo Alto: AAAI Press [online], pages 660-665. Available from: http://www.aaai.org/Papers/FLAIRS/2005/Flairs05-108.pdf

We introduce the Distributed Guided Local Search (Dist- GLS) algorithm for solving Distributed Constraint Satisfaction Problems. Our algorithm is based on the centralised Guided Local Search algorithm, which is extended with additional heuristics in... Read More about Distributed guided local search for solving binary DisCSPs..

Escaping local optima with penalties in distributed iterative improvement search. (2005)
Presentation / Conference
BASHARU, M., ARANA, I. and AHRIZ, H. 2005. Escaping local optima with penalties in distributed iterative improvement search. Presented at the 6th International workshop on distributed constraint reasoning (DCR 2005), part of the 19th International joint conference on artificial intelligence (IJCAI-05), 30 July - 5 August 2005, Edinburgh, UK.

The advantages offered by iterative improvement search make it a popular technique for solving problems in centralised settings. However, the key challenge with this approach is finding effective strategies for dealing with local optima. Such strateg... Read More about Escaping local optima with penalties in distributed iterative improvement search..

Escaping local optima in multi-agent oriented constraint satisfaction. (2004)
Conference Proceeding
BASHARU, M., AHRIZ, H. and ARANA, I. 2004. Escaping local optima in multi-agent oriented constraint satisfaction. In Coenen, F., Preece, A. and Macintosh, A. (eds.) Research and development in intelligent systems XX: technical proceedings of the 23rd Annual international conference of the British Computer Society's Specialist Group on Artificial Intelligence (SGAI) (AI-2003), 15-17 December 2003, Cambridge, UK. London: Springer [online], pages 97-110. Available from: https://doi.org/10.1007/978-0-85729-412-8_8

We present a multi-agent approach to constraint satisfaction where feedback and reinforcement are used in order to avoid local optima and, consequently, to improve the overall solution. Our approach, FeReRA, is based on the fact that an agents local... Read More about Escaping local optima in multi-agent oriented constraint satisfaction..

Building models through formal specification. (2004)
Conference Proceeding
RENKER, G. and AHRIZ, H. 2004. Building models through formal specification. In Régin, J.-C. and Rueher, M. (eds.) Integration of AI and OR techniques in constraint programming for combinatorial optimization problems: proceedings of the 1st International conference on integration of artificial intelligence and operations research techniques in constraint programming (CPAIOR 2004), 20-22 April 2004, Nice, France. Lecture notes in computer science, 3011. Berlin: Springer [online], pages 395-401. Available from: https://doi.org/10.1007/978-3-540-24664-0_29

Over the past years, a number of increasingly expressive languages for modelling constraint and optimisation problems have evolved. In developing a strategy to ease the complexity of building models for constraint and optimisation problems, we have a... Read More about Building models through formal specification..

Computer aided sustainable design. (2004)
Conference Proceeding
BENNADJI, A., AHRIZ, H. and ALASTAIR, P. 2005. Computer aided sustainable design. In Proceedings of the 1st International Arab Society for Computer Aided Architecrual Design (ASCAAD) conference on computer aided architectural design(ASCAAD 2005); e-design in architecure, 22-24 February 2005, Dhahran, Saudi Arabia. Dhahran: ASCAAD [online], pages 125-135. Available from: http://www.ascaad.org/conference/2004/proceedings.php

One of the most important aspects architects need to consider fairly early on is that of energy saving, cost, thermal comfort and the effect on the environment in terms of CO2 emissions. At present, during the early design stage of a building, differ... Read More about Computer aided sustainable design..

CSP: there is more than one way to model it. (2003)
Conference Proceeding
RENKER, G., AHRIZ, H. and ARANA, I. 2003. CSP: there is more than one way to model it. In Bramer, M., Preece, A. and Coenen, F. (eds.) Research and development in intelligent systems XIX: proceedings of the 22nd British Computer Society's Specialist Group on Artificial Intelligence (SGAI) international conference on knowledge based systems and applied artificial intelligence (ES2002), 10-12 December 2002, Cambridge, UK. London: Springer [online], pages 395-408. Available from: https://doi.org/10.1007/978-1-4471-0651-7_28

In this paper, we present an approach for conceptual modelling of con- straint satisfaction problems (CSP). The main objective is to achieve a similarly high degree of modelling support for constraint problems as it is already available in other disc... Read More about CSP: there is more than one way to model it..

A methodology for the elicitation of redesign knowledge. (2002)
Conference Proceeding
AHRIZ, H. and ARANA, I. 2002. A methodology for the elicitation of redesign knowledge. In Damiani, E., Howlett, R.J., Jain, L.C. and Ichalkaranje, N. (eds.) Knowledge-based intelligent information engineering systems and allied technologies: proceedings of the 6th International conference on knowledge-based intelligent information and engineering systems (KES 2002), 16-18 September 2002, Crema, Italy. Frontiers in artificial intelligence and applications, 82. Amsterdam: IOS Press.

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 views: physical, functional a... Read More about A methodology for the elicitation of redesign knowledge..

A step toward reusable model fragments. (2001)
Conference Proceeding
AHRIZ, H. and TOMASENA, M. 2001. A step toward reusable model fragments. In Proceedings of the 2001 International conference on computational intelligence for modeling control and automation (CIMCA 2001), 9-11 July 2001, Las Vegas, USA. New York: IEEE, pages 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 the bond graph notation, which... Read More about A step toward reusable model fragments..

Verification of redesign models: a CSP approach. (2001)
Conference Proceeding
ARANA, I. and AHRIZ, H. 2001. Verification of redesign models: a CSP approach. In Culley, S. (ed.) Proceedings of the 13th International conference on engineering design (ICED'01), 21-23 August 2001, Glasgow, UK. Zurich: 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 redesign, i.e. producing a new... Read More about Verification of redesign models: a CSP approach..

Modeling as a fragment assembling process. (1999)
Conference Proceeding
AHRIZ, H. and TOMASENA, M. 1999. Modeling as a fragment assembling process. In Price, C. (ed.) Proceedings of the 13th International workshop on qualitative reasoning (QR99), 6-9 June 1999, Loch Awe, UK. Evanston, IL: Qualitative Reasoning Group [online], pages 1-10. Available from: http://www.qrg.northwestern.edu/papers/Files/qr-workshops/QR99/Ahriz_1999_Modeling_Fragment_Assembling_Process.pdf

Model based reasoning about physical systems deals with diagnosis, supervision, interpretation, explanation, etc. Most of the contributions to this domain do not pay much attention to model construction, and it was generally accepted that a model was... Read More about Modeling as a fragment assembling process..

Automatic modelling for diagnosis. (1997)
Conference Proceeding
AHRIZ, A. and XIA, S. 1997. Automatic modelling for diagnosis. In Ironi, L. (ed.) Proceedings of the 11th International workshop on qualitative reasoning (QR97), 3-6 June 1997, Cortona, Italy. Pavia: Istituto di Analisi Numerica [online], pages 3-12. Available from: http://www.qrg.northwestern.edu/papers/Files/qr-workshops/QR97/Ahriz_1997_Automatic_Modelling_Diagnosis.pdf

Much of the past work on fault diagnosis did not pay enough attention to model construction and its important role in aiding problem solving. It was generally accepted that a model was available or was assumed to be present in a certain format before... Read More about Automatic modelling for diagnosis..