Approximate symbolic computation problems can be formulated as constrained or unconstrained optimization problems, for example: GCD [3, 8, 12, 13, 23], factorization [5, 10], and ...
Abstract. This paper presents a hybrid agents based architecture that uses casebased reasoning and case-based planning systems as reasoning mechanism in deliberative BDI agents to ...
Dante I. Tapia, Javier Bajo, Juan M. Corchado, Sar...
—One of the biggest bottlenecks in desktop-based computing is the hard disk with I/O write latency being a key contributor. I/O write latency stems from the mechanical nature of ...
- Clustering plays an indispensable role for data analysis. Many clustering algorithms have been developed. However, most of them suffer either poor performance of unsupervised lea...
- Functional testing of software dedicated for hybrid embedded systems should start at the early development phase and requires analysis of discrete and continuous signals, where t...