In this paper, we propose a reconfigurable hardware accelerator for fixed-point-matrix-vector-multiply/add operations, capable to work on dense and sparse matrices formats. The pr...
The multi-objective covariance matrix adaptation evolution strategy (MO-CMA-ES) combines a mutation operator that adapts its search distribution to the underlying optimization prob...
We consider the computation of the Iwasawa decomposition of a symplectic matrix via the QR factorization. The algorithms presented improve on the method recently decribed in [8]. K...
In fuzzy clustering, the fuzzy c-means (FCM) algorithm is the best known and most used method. Although FCM is a very useful method, it is sensitive to noise and outliers so that W...
We examine the question of solving the extinction probability of a particular class of continuous-time multi-type branching processes, named Markovian binary trees (MBT). The exti...
Sophie Hautphenne, Guy Latouche, Marie-Ange Remich...