All Outputs (25)

Real-time relative permeability prediction using deep learning. (2018)
Journal Article
ARIGBE, O.D., OYENEYIN, M.B., ARANA, I. and GHAZI, M.D. 2019. Real-time relative permeability prediction using deep learning. Journal of petroleum exploration and production technologies [online], 9(2), pages 1271-1284. Available from: https://doi.org/10.1007/s13202-018-0578-5

A review of the existing two and three phase relative permeability correlations shows a lot of pitfalls and restrictions imposed by (a) their assumptions (b) generalization ability and (c) difficulty with updating in real time for different reservoir... Read More about Real-time relative permeability prediction using deep learning..

Combining search strategies for distributed constraint satisfaction. (2015)
Thesis
MAGAJI, A.S-M. 2015. Combining search strategies for distributed constraint satisfaction. Robert Gordon University, PhD thesis.

Many real-life problems such as distributed meeting scheduling, mobile frequency allocation and resource allocation can be solved using multi-agent paradigms. Distributed constraint satisfaction problems (DisCSPs) is a framework for describing such p... Read More about Combining search strategies for distributed constraint satisfaction..

Dynamic agent prioritisation with penalties in distributed local search. (2013)
Conference Proceeding
SAMBO-MAGAJI, A., ARANA, I. and AHRIZ, H. 2013. Dynamic agent prioritisation with penalties in distributed local search. In Filipe, J. and Fred, A. (eds.) Proceedings of the 5th International conference on agents and artificial intelligence (ICAART 2013), 15-18 February 2013, Barcelona, Spain. Setúbal: Science and Technology Publications [online], volume 1, pages 276-281. Available from: https://doi.org/10.5220/0004259202760281

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 and, therefore centralised prob... Read More about Dynamic agent prioritisation with penalties in distributed local search..

Multi-HDCS: solving DisCSPs with complex local problems cooperatively. (2010)
Conference Proceeding
LEE, D., ARANA, I., AHRIZ, H. and HUI, K. 2009. Multi-HDCS: solving DisCSPs with complex local problems cooperatively. In Huang, X.J., Ghorbani, A.A., Hacid, M.-S. and Yamaguchi, T. (eds.) Proceedings of the 2010 IEEE/WIC/ACM international conference on intelligent agent technology (IAT 2010), co-located with the 2010 IEEE/WIC/ACM international conference on web intelligence (WI 2010), and the joint conference workshops (WI-IAT Workshops 2010), 31 August - 3 September 2010, Toronto, Canada. Los Alamitos: IEEE Computer Society [online], volume 2, article number 5614767, pages 295-302. Available from: https://doi.org/10.1109/WI-IAT.2010.141

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) participates in a distributed... Read More about Multi-HDCS: solving DisCSPs with complex local problems cooperatively..

Hybrid algorithms for distributed constraint satisfaction. (2010)
Thesis
LEE, D.A.J. 2010. Hybrid algorithms for distributed constraint satisfaction.. Robert Gordon University, PhD thesis.

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 corresponding domains of its l... Read More about Hybrid algorithms for distributed constraint satisfaction..

A hybrid approach to solving coarse-grained DisCSPs. (2009)
Conference Proceeding
LEE, D., ARANA, I., AHRIZ, H. and HUI, K.-Y. 2009. A hybrid approach to solving coarse-grained DisCSPs. In Proceedings of the 8th International conference on autonomous agents and multiagent systems (AAMAS 2009), 10-15 May 2009, Budapest, Hungary. Richland, South Carolina: International Foundation for Autonomous Agents and Multiagent Systems (IFAAMAS) [online], pages 1235-1236. Available from: http://www.aamas-conference.org/Proceedings/aamas09/pdf/02_Extended_Abstract/C_SP_0555.pdf

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 concurrent hybrid approach for so... Read More about A hybrid approach to solving coarse-grained DisCSPs..

Multi-Hyb: a hybrid algorithm for solving DisCSPs with complex local problems. (2009)
Conference Proceeding
LEE, D., ARANA, I., AHRIZ, H. and HUI, K.-Y. 2009. Multi-Hyb: a hybrid algorithm for solving DisCSPs with complex local problems. In Baeza-Yates, R., Lang, J., Mitra, S., Parsons, S. and Pasi, G. (eds.) Proceedings of the 2009 IEEE/WIC/ACM international conference on intelligent agent technology (IAT 2009), co-located with the 2009 IEEE/WIC/ACM international conference on web intelligence (WI 2009), and the joint conference workshops (WI-IAT Workshops 2009), 15-18 September 2009, Milan, Italy. Los Alamitos: IEEE Computer Society [online], volume 2, article number 5284811, pages 379-382. Available from: https://doi.org/10.1109/WI-IAT.2009.181

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. Thus, agents solve the ov... Read More about Multi-Hyb: a hybrid algorithm for solving DisCSPs with complex local problems..

DynABT: dynamic asynchronous backtracking for dynamic DisCSPs. (2008)
Conference Proceeding
OMOMOWO, B., ARANA, I. and AHRIZ, H. 2008. DynABT: dynamic asynchronous backtracking for dynamic DisCSPs. In Dochev, D., Pistore, M. and Traverso, P. (eds.) Proceedings of the 13th International conference on artificial intelligence: methodology, systems and applications (AIMSA 2008), 4-6 September 2008, Varna, Bulgaria. Lecture notes in computer science, 5253. Berlin: Springer [online], pages 285-296. Available from: https://doi.org/10.1007/978-3-540-85776-1_24

Constraint 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 of agents and change over time. Dy... Read More about DynABT: dynamic asynchronous backtracking for dynamic DisCSPs..

A hybrid approach to distributed constraint satisfaction. (2008)
Conference Proceeding
LEE, D., ARANA, I., AHRIZ, H. and HUI, K.-Y. 2008. A hybrid approach to distributed constraint satisfaction. In Dochev, D., Pistore, M. and Traverso, P. (eds.) Proceedings of the 13th International conference on artificial intelligence: methodology, systems and applications (AIMSA 2008), 4-6 September 2008, Varna, Bulgaria. Lecture notes in computer science, 5253. Berlin: Springer [online], pages 375-379. Available from: https://doi.org/10.1007/978-3-540-85776-1_33

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 where the distributed local search... Read More about A hybrid approach to distributed constraint satisfaction..

Escaping local optima: constraint weights vs value penalties. (2007)
Conference Proceeding
BASHARU, M., ARANA, I. and AHRIZ, H. 2008. Escaping local optima: constraint weights vs. value penalties. In Bramer, M., Coenen, F. and Petridis, M. (eds.) Research and development in intelligent systems XXIV: technical proceedings of the 27th Annual international conference of the British Computer Society's Specialist Group on Artificial Intelligence (SGAI) (AI-2007): innovative techniques and applications of artificial intelligence, 10-12 December 2007, Cambridge, UK. London: Springer [online], pages 51-64. Available from: https://doi.org/10.1007/978-1-84800-094-0_5

Constraint 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 problems, but they have a propensi... Read More about Escaping local optima: constraint weights vs value penalties..

DisBO-wd: a distributed constraint satisfaction algorithm for coarse-grained distributed problems. (2007)
Conference Proceeding
BASHARU, M., ARANA, I. and AHRIZ, H. 2008. DisBO-wd: a distributed constraint satisfaction algorithm for coarse-grained distributed problems. In Bramer, M., Coenen, F. and Petridis, M. (eds.) Research and development in intelligent systems XXIV: technical proceedings of the 27th Annual international conference of the British Computer Society's Specialist Group on Artificial Intelligence (SGAI) (AI-2007): innovative techniques and applications of artificial intelligence, 10-12 December 2007, Cambridge, UK. London: Springer [online], pages 23-36. Available from: https://doi.org/10.1007/978-1-84800-094-0_3

We present a distributed iterative improvement algorithm for solving coarse-grained distributed constraint satisfaction problems (DisCSPs). Our algorithm is inspired by the Distributed Breakout for coarse-grained DisCSPs where we introduce a constrai... Read More about DisBO-wd: a distributed constraint satisfaction algorithm for coarse-grained distributed problems..

Solving coarse-grained DisCSPs with Multi-DisPeL and DisBO-wd. (2007)
Conference Proceeding
BASHARU, M., ARANA, I. and AHRIZ, A. 2007. Solving coarse-grained DisCSPs with Multi-DisPeL and DisBO-wd. In Lin, T.Y., Bradshaw, J.M., Klusch, M., Zhang, C., Broder, A. and Ho, H. (eds.) Proceedings of the 2007 IEEE/WIC/ACM international conference on intelligent agent technology (IAT 2007), 2-5 November 2007, Silicon Valley, USA. Los Alamitos: IEEE Computer Society [online], article number 4407307, pages 335-341. Available from: https://doi.org/10.1109/IAT.2007.68

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 in order to escape local optim... Read More about Solving coarse-grained DisCSPs with Multi-DisPeL and DisBO-wd..

Stoch-DisPeL: exploiting randomisation in DisPeL. (2006)
Presentation / Conference
BASHARU, M., ARANA, I. and AHRIZ, H. 2006. Stoch-DisPeL: exploiting randomisation in DisPeL. Presented at the 7th International workshop on distributed constraint reasoning (DCR 2006), part of the 5th International joint conference on autonomous agents and multiagent systems (AAMAS 2006), 8-12 May 2006, Hakodate, Japan.

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 performance on random DisCSPs and on... Read More about Stoch-DisPeL: exploiting randomisation in DisPeL..

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..

Facilitating DL-based hybrid reasoning with inference fusion. (2003)
Conference Proceeding
HU, B., ARANA, I. and COMPATANGELO, E. 2003. Facilitating DL-based hybrid reasoning with inference fusion. 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 91-104. Available from: https://doi.org/10.1007/978-1-4471-0651-7_7

We present an extension to DL-based taxonomic reasoning by means of the proposed inference fusion, i.e. the dynamic combination of inferences from distributed heterogeneous reasoners. Our approach integrates results from a DL-based system with result... Read More about Facilitating DL-based hybrid reasoning with inference fusion..

Infusion: a hybrid reasoning system with description logics. (2003)
Conference Proceeding
HU, B., COMPATANGELO, E. and ARANA, I. 2003. Infusion: a hybrid reasoning system with description logics. In Hamza, M.H. (ed.) Proceedings of the 2003 International Association of Science and Technology for Development (IASTED) international conference on artificial intelligence and applications (AIA 2003), 8-10 September 2003, Benalmadena, Spain. Calgary: ACTA Press [online], pages 327-332. Available from: http://www.actapress.com/Content_of_Proceeding.aspx?proceedingID=237

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 systems. More specifically, ou... Read More about Infusion: a hybrid reasoning system with description logics..

Inference fusion: a hybrid approach to taxonomic reasoning. (2003)
Conference Proceeding
HU, B., COMPATANGELO, E. and ARANA, I. 2003. Inference fusion: a hybrid approach to taxonomic reasoning. In Russell, I. and Haller, S. (eds.) Proceedings of the 16th International conference of the Florida Artificial Intelligence Research Society (FLAIRS 2003), 12-14 May 2003, St. Augustine, USA. Palo Alto: AAAI Press [online], pages 103-107. Available from: https://aaai.org/Papers/FLAIRS/2003/Flairs03-021.pdf

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 DL-based taxonomic reasoner with results from a... Read More about Inference fusion: a hybrid approach to taxonomic reasoning..