An exact Markov chain model of the B-cell algorithm (BCA) is constructed via a novel possible transit method. The model is used to formulate a proof that the BCA is convergent abso...
CBR is one of the techniques that can be applied to the task of approximating a function over high-dimensional, continuous spaces. In Reinforcement Learning systems a learning agen...
TIELT is a software testbed that facilitates the integration and testing of learning-embedded decision systems on user-selected tasks from virtual gaming simulators. A key componen...
This study deals with the topology discovery for the capacitated minimum spanning tree network. The problem is composed of finding the best way to link nodes to a source node and, ...
Abstract. The innovation of this work is a simple vectorizable algorithm for performing sparse matrix vector multiply in compressed sparse row (CSR) storage format. Unlike the vect...
Eduardo F. D'Azevedo, Mark R. Fahey, Richard Tran ...