Open Access. Powered by Scholars. Published by Universities.®

Artificial Intelligence and Robotics Commons

Open Access. Powered by Scholars. Published by Universities.®

11,133 Full-Text Articles 24,446 Authors 5,576,865 Downloads 273 Institutions

All Articles in Artificial Intelligence and Robotics

Faceted Search

11,133 full-text articles. Page 540 of 540.

Cognitive Effort For Multi Agent Systems, Luca Longo 2010 Technological University Dublin

Cognitive Effort For Multi Agent Systems, Luca Longo

Conference papers

Cognitive Effort is a multi-faceted phenomenon that has suffered from an imperfect understanding, an informal use in everyday life and numerous definitions. This paper attempts to clarify the concept, along with some of the main influencing factors, by presenting a possible heuristic formalism intended to be implemented as a computational concept, and therefore be embedded in an artificial agent capable of cognitive effort-based decision support. Its applicability in the domain of Artificial Intelligence and Multi-Agent Systems is discussed. The technical challenge of this contribution is to start an active discussion towards the formalisation of Cognitive Effort and its application in …


Motivated Learning As An Extension Of Reinforcement Learning, Janusz STARZYK, Pawel RAIF, Ah-hwee TAN 2010 Singapore Management University

Motivated Learning As An Extension Of Reinforcement Learning, Janusz Starzyk, Pawel Raif, Ah-Hwee Tan

Research Collection School Of Computing and Information Systems

We have developed a unified framework to conduct computational experiments with both learning systems: Motivated learning based on Goal Creation System, and reinforcedment learning using RL Q-Learning Algorithm. Future work includes combining motivated learning to set abstract motivations and manage goals with reinforcement learning to learn proper actions. This will allow testing of motivated learning on typical reinforcement learning benchmarks with large dimensionality of the state/action spaces.


A Boosting Framework For Visuality-Preserving Distance Metric Learning And Its Application To Medical Image Retrieval, Yang LIU, Rong JIN, Lily Mummert, Rahul Sukthankar, Adam Goode, Bin ZHENG, Steven C. H. HOI, Mahadev Satyanarayanan 2010 Carnegie Mellon University

A Boosting Framework For Visuality-Preserving Distance Metric Learning And Its Application To Medical Image Retrieval, Yang Liu, Rong Jin, Lily Mummert, Rahul Sukthankar, Adam Goode, Bin Zheng, Steven C. H. Hoi, Mahadev Satyanarayanan

Research Collection School Of Computing and Information Systems

Similarity measurement is a critical component in content-based image retrieval systems, and learning a good distance metric can significantly improve retrieval performance. However, despite extensive study, there are several major shortcomings with the existing approaches for distance metric learning that can significantly affect their application to medical image retrieval. In particular, "similarity" can mean very different things in image retrieval: resemblance in visual appearance (e.g., two images that look like one another) or similarity in semantic annotation (e.g., two images of tumors that look quite different yet are both malignant). Current approaches for distance metric learning typically address only one …


Periodic Resource Reallocation In Two-Echelon Repairable Item Inventory Systems, Hoong Chuin LAU, Jie Pan, Huawei SONG 2010 Singapore Management University

Periodic Resource Reallocation In Two-Echelon Repairable Item Inventory Systems, Hoong Chuin Lau, Jie Pan, Huawei Song

Research Collection School Of Computing and Information Systems

Given an existing stock allocation in an inventory system, it is often necessary to perform reallocation over multiple time points to address inventory imbalance and maximize availability. In this paper, we focus on the situation where there are two opportunities to perform reallocation within a replenishment cycle. We derive a mathematical model to determine when and how to perform reallocation. Furthermore, we consider the extension of this model to the situation allowing an arbitrary number of reallocations. Experimental results show that the two-reallocation approach achieves better performance compared with the single-reallocation approach found in the literature. We also illustrate how …


Prediction Of Brain Tumor Progression Using A Machine Learning Technique, Yuzhong Shen, Debrup Banerjee, Jiang Li, Adam Chandler, Yufei Shen, Frederic D. McKenzie, Jihong Wang, Nico Karssemeijer (Ed.), Ronald M. Summers (Ed.) 2010 Old Dominion University

Prediction Of Brain Tumor Progression Using A Machine Learning Technique, Yuzhong Shen, Debrup Banerjee, Jiang Li, Adam Chandler, Yufei Shen, Frederic D. Mckenzie, Jihong Wang, Nico Karssemeijer (Ed.), Ronald M. Summers (Ed.)

Electrical & Computer Engineering Faculty Publications

A machine learning technique is presented for assessing brain tumor progression by exploring six patients' complete MRI records scanned during their visits in the past two years. There are ten MRI series, including diffusion tensor image (DTI), for each visit. After registering all series to the corresponding DTI scan at the first visit, annotated normal and tumor regions were overlaid. Intensity value of each pixel inside the annotated regions were then extracted across all of the ten MRI series to compose a 10 dimensional vector. Each feature vector falls into one of three categories:normal, tumor, and normal but progressed to …


Introducing Communication In Dis-Pomdps With Locality Of Interaction, Makoto TASAKI, Yuichi Yabu, Yuki Iwanari, Makoto Yokoo, Janusz Marecki, Pradeep Reddy VARAKANTHAM, Milind Tambe 2010 Kyushu University

Introducing Communication In Dis-Pomdps With Locality Of Interaction, Makoto Tasaki, Yuichi Yabu, Yuki Iwanari, Makoto Yokoo, Janusz Marecki, Pradeep Reddy Varakantham, Milind Tambe

Research Collection School Of Computing and Information Systems

The Networked Distributed POMDPs (ND-POMDPs) can model multiagent systems in uncertain domains and has begun to scale-up the number of agents. However, prior work in ND-POMDPs has failed to address communication. Without communication, the size of a local policy at each agent within the ND-POMDPs grows exponentially in the time horizon. To overcome this problem, we extend existing algorithms so that agents periodically communicate their observation and action histories with each other. After communication, agents can start from new synchronized belief state. Thus, we can avoid the exponential growth in the size of local policies at agents. Furthermore, we introduce …


Digital Commons powered by bepress