Browsing by Author "Arana, Ines"
Now showing items 423 of 24

DisBOwd: a distributed constraint satisfaction algorithm for coarsegrained distributed problems.
Basharu, Muhammed; Arana, Ines; Ahriz, Hatem (SpringerVerlag http://dx.doi.org/10.1007/9781848000940_3, 2007)BASHARU, M., ARANA, I. and AHRIZ, H. 2007. DisBOwd: a distributed constraint satisfaction algorithm for coarsegrained distributed problems. In: M. BRAMER, F. COENEN and M. PETRIDIS, eds. Research and Development in Intelligent Systems XXIV. Proceedings of the 27th SGAI International Conference on Artificial Intelligence, AI07. 1012 December 2007. Cambridge. pp. 2336We present a distributed iterative improvement algorithm for solving coarsegrained distributed constraint satisfaction problems (DisCSPs). Our algorithm is inspired by the Distributed Breakout for coarsegrained ... 
Distributed guided local search for solving binary DisCSPs.
Basharu, Muhammed; Arana, Ines; Ahriz, Hatem (AAAI Press, 200505)BASHARU, M., ARANA, I. and AHRIZ, H. 2005. Distributed guided local search for solving binary DisCSPs. In: Proceedings of the 18th International FLAIRS Conference. 1618 May 2005. Florida. pp. 660665We 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 ... 
DynABT: dynamic asynchronous backtracking for dynamic DisCSPs.
Omomowo, Bayo; Arana, Ines; Ahriz, Hatem (Springer Verlag http://dx.doi.org/10.1007/9783540857761_24, 2008)OMOMOWO, B., ARANA, I. and AHRIZ, H. 2008. DynABT: Dynamic asynchronous backtracking for dynamic DisCSPs. In: Proceedings of the 13th International Conference on Artificial Intelligence: Methodology, Systems, Applications (AIMSA). 46 September 2008. Varna, Bulgaria. pp. 285296Constraint Satisfaction has been widely used to model static combinatorial problems. However, many AI problems are dynamic and take place in a distributed environment, i.e. the problems are distributed over a number ... 
Dynamic agent priotisation with penalties in distributed local search.
SamboMagaji, Amina; Arana, Ines; Ahriz, Hatem (SciTePress http://dx.doi.org/10.5220/0004259202760281, 201302)SAMBOMAGAJI, A., ARANA, I. and AHRIZ, H., 2013. Dynamic agent priotisation with penalties in distributed local search. In: J. FILIPE and A. L. N. FRED, EDS, Proceedings of the Fifth International Conference on Agents and Artificial Intelligence (ICAART 2013), 1518 February 2013. Lisbon: SciTePress. Pp. 276281.Distributed Constraint Satisfaction Problems (DisCSPs) solving techniques solve problems which are distributed over a number of agents.The distribution of the problem is required due to privacy, security or cost issues ... 
Escaping local optima in multiagent oriented constraint satisfaction.
Basharu, Muhammed; Ahriz, Hatem; Arana, Ines (SpringerVerlag., 2004)BASHARU, M., AHRIZ, H. and ARANA, I., 2003. Escaping local optima in multiagent oriented constraint satisfaction. In: F. COENEN, A. PREECE and A. MACINTOSH, eds. Research and development in intelligent systems Xx. Proceedings of Ai2003, the twentythird SGAI international conference on innovative techniques and applications of artificial intelligence. 1517 December 2003. Cambridge, UK. Pp. 97110.We present a multiagent 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 ... 
Escaping local optima with penalties in distributed iterative improvement search.
Basharu, Muhammed; Arana, Ines; Ahriz, Hatem (IJCAI, 200507)BASHARU, M., ARANA, I. and AHRIZ, H., 2005. Escaping local optima with penalties in distributed iterative improvement search. In: Proceedings of the 6th International Workshop on Distributed Constraint Reasoning, DCR2005. 30 July 2005. pp. 192206.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 ... 
Escaping local optima: constraint weights vs. value penalties.
Basharu, Muhammed; Arana, Ines; Ahriz, Hatem (Springer Verlag http://dx.doi.org/10.1007/9781848000940_5, 2007)BASHARU, M., ARANA, I. and AHRIZ, H. 2007. Escaping local optima: constraint weights vs. value penalties. In: M. BRAMER, F. COENEN and PETRIDIS, M. (eds.) Research and development in intelligent systems XXIV. Proceedings of the 27th SGAI International Conference on Artificial Intelligence, AI07, 1012 December 2007. Cambridge. pp. 5164Constraint Satisfaction Problems can be solved using either iterative improvement or constructive search approaches. Iterative improvement techniques converge quicker than the constructive search techniques on large ... 
Facilitating DLbased hybrid reasoning with inference fusion.
Hu, Bo; Arana, Ines; Compatangelo, Ernesto (SpringerVerlag, 200212)HU, B., ARANA, I. and COMPATANGELO, E. 2002. Facilitating DLbased hybrid reasoning with inference fusion. In: M. BRAMER and A. PREECE eds. Research and Development in Intelligent Systems XIX: Proceedings of ES2002, the Twentysecond SGAI International Conference on Knowledge Based Systems and Applied Artificial Intelligence. December 2002. Cambridge. pp. 91 104.We present an extension to DLbased taxonomic reasoning by means of the proposed inference fusion, i.e. the dynamic combination of inferences from distributed heterogeneous reasoners. Our approach integrates results ... 
Facilitating DLbased hybrid reasoning with inference fusion.
Hu, Bo; Arana, Ines; Compatangelo, Ernesto (Elsevier http://dx.doi.org/10.1016/S09507051(03)000261, 200307)HU, B., ARANA, I. and COMPATANGELO, E., 2003. Facilitating DLbased hybrid reasoning with inference fusion. Knowledge Based Systems, 16 (56), pp. 4248.We present an extension to DLbased taxonomic reasoning by means of inference fusion, i.e. the dynamic combination of inferences from distributed heterogeneous reasoners. Our approach integrates results from a DLbased ... 
Hybrid algorithms for distributed constraint satisfaction.
Lee, David Alexander James (The Robert Gordon University School of Computing, 201004)A Distributed Constraint Satisfaction Problem (DisCSP) is a CSP which is divided into several interrelated 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, KitYing (Springer Verlag http://dx.doi.org/10.1007/9783540857761_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). 46 September 2008. Varna, Bulgaria. pp. 375379We present a hybrid approach to Distributed Constraint Satisfaction which combines incomplete, fast, penaltybased local search with complete, slower systematic search. Thus, we propose the hybrid algorithm PenDHyb ... 
A hybrid approach to solving coarsegrained DisCSPs.
Lee, David; Arana, Ines; Ahriz, Hatem; Hui, KitYing (International Foundation for Autonomous Agents & MultiAgent Systems http://www.ifaamas.org/Proceedings/aamas09/pdf/02_Extended_Abstract/C_SP_0555.pdf, 200905)LEE, D., ARANA, I., AHRIZ, H. and HUI, KY., 2009. A hybrid approach to solving coarsegrained DisCSPs. In: Proceedings of the Eighth International Conference on Autonomous Agents and Multi Agent Systems (AAMAS 09), 1015 May 2009. Budapest: IFAAMAS. Pp. 12351236.A coarsegrained Distributed Constraint Satisfaction Problem (DisCSP) consists of several loosely connected constraint satisfaction subproblems, each assigned to an individual agent. We present MultiHyb, a twophase ... 
Inference fusion: a hybrid approach to taxonomic reasoning.
Hu, Bo; Compatangelo, Ernesto; Arana, Ines (AAAI, 2003)HU, B., ARANA, I. and COMPATANGELO, E., 2003. Inference fusion: a hybrid approach to taxonomic reasoning. In: I. RUSSELL and S. HALLER, eds. Proceedings of the 16th International FLAIRS conference. 1214 May 2003. St. Augustine, Florida: AAAI. pp. 103107.We present a hybrid way to extend taxonomic reasoning using inference fusion, i.e. the dynamic combination of inferences from distributed heterogeneous reasoners. Our approach integrates results from a DLbased taxonomic ... 
Infusion: a hybrid reasoning system with description logics.
Hu, Bo; Compatangelo, Ernesto; Arana, Ines (ACTA Press http://www.actapress.com/Content_of_Proceeding.aspx?proceedingid=237, 2003)HU, B., COMPATANGELO, E. and ARANA, I., 2003. Infusion fusion: a hybrid reasoning system with description logics. Third IASTED International Conference on Artificial Intelligence and Applications. 810 September 2003. Benalmadena, Spain. Pp. 327332.We discussed a new approach using inference fusion, i.e. the cooperative reasoning from distributed heterogeneous inference systems, to extend the expressive and deductive powers of existing Description Logic (DL) based ... 
A methodology for the elicitation of redesign knowledge.
Ahriz, Hatem; Arana, Ines (IOS Press, 200209)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. Knowledgebased intelligent information engineering systems and allied technologies. Proceedings of KES 2002. 1618 September 2002, Crema, Italy. Pp. 156160.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 ... 
MultiHDCS: solving DisCSPs with complex local problems cooperatively.
Lee, David; Arana, Ines; Ahriz, Hatem; Hui, KitYing (IEEE Computer Society http://dx.doi.org/10.1109/WIIAT.2010.141, 201009)LEE, D., ARANA, I., AHRIZ, H. and HUI, K., 2010. MultiHDCS: solving DisCSPs with complex local problems cooperatively. In: Proceedings of IEEE/WIC/ACM International Conference on Web Intellligence and Intelligent Agent Technology (WIIAT 2010). 31 August – 3 September 2010.We propose MultiHDCS, a new hybrid approach for solving Distributed CSPs with complex local problems. In MultiHDCS, each agent concurrently: (i) runs a centralised systematic search for its complex local problem; (ii) ... 
Multihyb: a hybrid algorithm for solving DisCSPs with complex local problems.
Lee, David; Arana, Ines; Ahriz, Hatem; Hui, KitYing (IEEE Computer Society. http://dx.doi.org/10.1109/WIIAT.2009.181, 200909)LEE, D., ARANA, I., AHRIZ, H. and HUI, K.Y., 2009. Multihyb: a hybrid algorithm for solving DisCSPs with complex local problems. In: P. BOLDI, G. VIZZARI, G. PASI and R. BAEZAYATES eds. Web Intelligence and Intelligent Agent Technologies, 2009. WIIAT '09. IEEE/WIC/ACM International Joint Conferences on , vol.2. 1518 September 2009, Los Alamitos, California: IEEE Computer Society. Pp. 379382.A coarsegrained 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. ... 
Solving coarsegrained DisCSPs with MultiDisPeL and DisBOwd.
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 coarsegrained DisCSPs with MultiDisPeL and DisBOwd. 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). 25 November 2007. California, USA. Pp. 335341.We present MultiDisPel, a penaltybased local search distributed algorithm which is able to solve coarsegrained Distributed Constraint Satisfaction Problems (DisCSPs) efficiently. MultiDisPeL uses penalties on values ... 
Solving DisCSPs with penaltydriven search.
Basharu, Muhammed; Arana, Ines; Ahriz, Hatem (AAAI Press, 200507)BASHARU,M., ARANA, I. and AHRIZ, H. 2005. Solving DisCSPs with penaltydriven search. In: Proceedings of the Twentieth National Conference of Artificial Intelligence. 911 July 2005. Pittsburgh, Pennsylvania. pp. 4752We introduce the Distributed, Penaltydriven Local search algorithm (DisPeL) for solving Distributed Constraint Satisfaction Problems. DisPeL is a novel distributed iterative improvement algorithm which escapes local ... 
StochDisPeL: exploiting randomisation in DisPeL.
Basharu, Muhammed; Arana, Ines; Ahriz, Hatem (2006)BASHARU, M., ARANA, I. and AHRIZ, H., 2006. StochDisPeL: exploiting randomisation in DisPeL. In: Proceedings of 7th International Workshop on Distributed Constraint Reasoning, DCR2006. 8 May 2006. Hakodate, Japan. pp. 117131.We present StochDisPeL, 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 ...