(eng) The purpose of this paper is to give an overview on pebble automata, which can be encountered in different domains, as figures (families) recognition, complexity theory and labyrinths theory . It gives definitions, ...

(eng) A grouped instance of a cellular automaton (CA) is another one obtained by grouping several states into blocks and by letting interact neighbor blocks. Based on this operation (and on the subautomaton notion), a ...

(eng) A great amount of work has been devoted to the understanding of the long-time behavior of cellular automata (CA). As for any other kind of dynamical system, the long-time behavior of a CA is described by its attractors. ...

(eng) In this paper, we address the issue of implementing matrix-matrix multiplication on heterogeneous platforms. We target two different classes of heterogeneous computing resources: heterogeneous networks of workstations, ...

(eng) In this paper, we present LinuxActivation, an efficient system support for user level thread scheduling implemented within Linux. This work is an extension to the ``Scheduler Activations'' model (proposed by Anderson ...

(eng) Redundant notations are used implicitly or explicitly in many digital designs. They have been studied in details and a general framework is known to reduce the redundancy of a notation down to the minimally redundant ...

(eng) An analog of Mahaney's Theorem was shown, stating that there is no sparse NP-complete problem over the reals with addition and equality - here sparse is defined in terms of dimension. We extend this to the case of ...

(eng) The automatic detection of parallel loops is a well-known problem. Sophisticated polynomial algorithms have been proposed to produce code transformations that reveal parallel loops, in an optimal way as long as the ...

(eng) Higher order abstract syntax is a natural way to formalize programming languages with binders, like the pi-calculus, because alpha-conversion and beta-reduction are delegated to the meta level of the provers, making ...

(eng) This report introduces a version of MPICH handling efficiently different networks simultaneously. The core of the implementation relies on a device called ch_mad which is based on a generic multiprotocol communication ...

(eng) DSM-PM2 is a platform for designing, implementing and experimenting multithreaded DSM consistency protocols. It provides a generic toolbox which facilitates protocol design and allows for easy experimentation with ...

(eng) In several cases, the input argument of an elementary function evaluation is given bit-serially, most significant bit first. We suggest a solution for performing the first step of the evaluation (namely, the range ...

(eng) We give here the results of a four-year search for the worst cases for correct rounding of the major elementary functions in double precision. These results allow the design of reasonably fast routines that will ...

(eng) We show that it is impossible to compute (or even to approximate) the topological entropy of a continuous piecewise affine function in dimension 4. The same result holds for saturated linear functions in unbounded ...

(eng) This paper presents a survey of the state-of-the-art techniques and prototypes for compressing videos. A particular interest is devoted to compression for streaming over the Internet. The basic principles are presented, ...

(eng) Scheduling the tasks of a distributed application has been an active field of research for several decades. The classic scheduling problem is to find a assignment of application tasks onto a set of distributed resources ...