In this paper, we analyze the efficiency of three local enumeration and three storage compression schemes for cyclic(m) data distributions in High Performance Fortran (HPF). We sh...
This paper gives a numerical algorithm able to compute the number of path-connected components of a set S defined by nonlinear inequalities. This algorithm uses interval analysis ...
An important problem in principal component analysis (PCA) is the estimation of the correct number of components to retain. PCA is most often used to reduce a set of observed vari...
This paper reports on the development of specific slicing techniques for functional programs and their use for the identification of possible coherent components from monolithic c...
: A local search algorithm operating on an instance of a Boolean constraint satisfaction problem (in particular, k-SAT) can be viewed as a stochastic process traversing successive ...