Open Access. Powered by Scholars. Published by Universities.®
- Discipline
-
- Computer Sciences (31)
- Physical Sciences and Mathematics (31)
- Operations Research, Systems Engineering and Industrial Engineering (18)
- Computer Engineering (15)
- Artificial Intelligence and Robotics (14)
-
- Data Storage Systems (8)
- Business (6)
- Databases and Information Systems (6)
- Numerical Analysis and Scientific Computing (6)
- Computer and Systems Architecture (4)
- Graphics and Human Computer Interfaces (4)
- Digital Communications and Networking (3)
- Theory and Algorithms (2)
- Finance and Financial Management (1)
- Medicine and Health Sciences (1)
- OS and Networks (1)
- Public Affairs, Public Policy and Public Administration (1)
- Social and Behavioral Sciences (1)
- Software Engineering (1)
- Technology and Innovation (1)
- Transportation (1)
- Keyword
-
- Analytical models (1)
- Annotation (1)
- Assignment problems (1)
- Audio words (1)
- Automobile exhaust gas (1)
-
- Average Distance (1)
- BDI (1)
- Bi-objective optimization (1)
- Biological system modeling (1)
- Candle-lighting analysis (1)
- Capacity constraints (1)
- Categorization (1)
- Co-reranking (1)
- Coalition formation (1)
- Coherency vocabulary (1)
- Communication (1)
- Computational modeling (1)
- Concept detection (1)
- Conflict resolution (1)
- Constrained optimization (1)
- Continuous queries (1)
- Copy detection (1)
- Crisp set (1)
- Curve fitting (1)
- Data Driven (1)
- Data leakage prevention (1)
- Data-driven (1)
- Decentralized resource allocation (1)
- Deliberation support (1)
- Digital watermarking (1)
Articles 31 - 33 of 33
Full-Text Articles in Engineering
When Discrete Meets Differential: Assessing The Stability Of Structure From Small Motion, Wen-Yan Lin, Geok-Choo Tan, Loong-Fah Cheong
When Discrete Meets Differential: Assessing The Stability Of Structure From Small Motion, Wen-Yan Lin, Geok-Choo Tan, Loong-Fah Cheong
Research Collection School Of Computing and Information Systems
We provide a theoretical proof showing that under a proportional noise model, the discrete eight point algorithm behaves similarly to the differential eight point algorithm when the motion is small. This implies that the discrete algorithm can handle arbitrarily small motion for a general scene, as long as the noise decreases proportionally with the amount of image motion and the proportionality constant is small enough. This stability result extends to all normalized variants of the eight point algorithm. Using simulations, we show that given arbitrarily small motions and proportional noise regime, the normalized eight point algorithms outperform their differential counterparts …
Periodic Resource Reallocation In Two-Echelon Repairable Item Inventory Systems, Hoong Chuin Lau, Jie Pan, Huawei Song
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 …
Introducing Communication In Dis-Pomdps With Locality Of Interaction, Makoto Tasaki, Yuichi Yabu, Yuki Iwanari, Makoto Yokoo, Janusz Marecki, Pradeep Reddy Varakantham, Milind Tambe
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 …