automates des langages de mots habituels, aux langages d'ensembles par-tiellement ordonn es s erie-parall eles, ou sp-langages. Nous utilisons les pro-pri et es alg ebriques de l'ensemble des ensembles s erie-parall eles pour etudier une notion de reconnaissabilit e bas ee sur les congruences d'indice ni, et une notion de r egularit e bas ee sur une nouvelle classe d'automates, appel es automat...

Degradable performance of fault-tolerant computer systems has given rise to considerable interest in mathematical models for combined evaluation of performance and reliability. Most of these models are based upon Markov processes. Several methods have been proposed for the computation of the probability distribution of performability upon an interval of time 0; t]. In this paper, we present a n...

Programming irregular and dynamic data-parallel algorithms requires to take data distribution into account. The implementation of a load balancing algorithm is a quite diicult task for the programmer. However, a load balancing strategy may be developed independently of the application. The integration of such a strategy in the data-parallel algorithm may be relevant to a library or a data-paral...

Degradable performance of fault-tolerant computer systems has given rise to considerable interest in mathematical models for combined evaluation of performance and reliability. Most of these models are based upon Markov processes. Several methods have been proposed for the computation of the probability distribution of performability upon an interval of time 0; t]. In this paper, we present a n...

User modelling in Exploratory Learning Environments (ELEs) is an emerging field with several challenges to be addressed. Due to the freedom given to learners, the amount of information generated is very large, making the modelling process very challenging. Consequently, only relevant information should be used in the user modelling process. This, however, leads to other challenges such as ident...

In this paper a modiication of a standard parallel genetic algorithm (SPGA) is introduced which can be run eeciently on diierent types of parallel computers. The purpose of the algorithm is to nd optimal morphological lters for grey scale image processing tasks. The structure of the developed General Parallel Genetic Algorithm (GPGA) is based on a new subpopulation model which uses an integral ...

automates des langages de mots habituels, aux langages d'ensembles par-tiellement ordonn es s erie-parall eles, ou sp-langages. Nous utilisons les pro-pri et es alg ebriques de l'ensemble des ensembles s erie-parall eles pour etudier une notion de reconnaissabilit e bas ee sur les congruences d'indice ni, et une notion de r egularit e bas ee sur une nouvelle classe d'automates, appel es automat...

In this paper a modiication of a standard parallel genetic algorithm (SPGA) is introduced which can be run eeciently on diierent types of parallel computers. The purpose of the algorithm is to nd optimal morphological lters for grey scale image processing tasks. The structure of the developed General Parallel Genetic Algorithm (GPGA) is based on a new subpopulation model which uses an integral ...