mirage

Browsing Automatique, recherche opérationnelle / Control theory, operational research by Issue Date

DSpace/Manakin Repository

Browsing Automatique, recherche opérationnelle / Control theory, operational research by Issue Date

Sort by: Order: Results:

  • Laboratoire de l'informatique du parallélisme; Delorme, Marianne (1997-08)
    (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, ...
  • Laboratoire de l'informatique du parallélisme; Mazoyer, Jacques; Rapaport, Ivan (1997-09)
    (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 ...
  • Laboratoire de l'informatique du parallélisme; Mazoyer, Jacques; Rapaport, Ivan (1997-09)
    (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. ...
  • Laboratoire de l'informatique du parallélisme; Beaumont, Olivier; Boudet, Vincent; Rastello, Fabrice; Robert, Yves (2000-01)
    (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, ...
  • Laboratoire de l'informatique du parallélisme; Danjean, Vincent (2000-03)
    (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 ...
  • Laboratoire de l'informatique du parallélisme; Daumas, Marc; Matula, David W. (2000-03)
    (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 ...
  • Laboratoire de l'informatique du parallélisme; Fournier, Hervé (2000-03)
    (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 ...
  • Laboratoire de l'informatique du parallélisme; Aumage, Olivier; Bougé, Luc; Namyst, Raymond (2000-04)
    (eng) This paper introduces Madeleine II, an adaptive multi-protocol extension of the Madeleine portable communication interface. Madeleine II provides facilities to use multiple network protocols (VIA, SCI, TCP, MPI) and ...
  • Laboratoire de l'informatique du parallélisme; Darte, Alain; Huard, Guillaume (2000-05)
    (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 ...
  • Laboratoire de l'informatique du parallélisme; Antoniu, Gabriel; Bougé, Luc; Namyst, Raymond (2000-05)
    (eng) This paper describes DSM-PM2, a generic, multi-protocol distributed shared memory library built for PM2, a multithreaded runtime system with preemptive thread migration. DSM-PM2 allows threads running on different ...
  • Laboratoire de l'informatique du parallélisme; Roeckl, Christine; Hirschkoff, Daniel; Berghofer, Stefan (2000-06)
    (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 ...
  • Laboratoire de l'informatique du parallélisme; Aumage, Olivier; Bougé, Luc; Denis, Alexandre; Méhaut, Jean-Francois; Mercier, Guillaume; Namyst, Raymond; Prylli, Loïc (2000-07)
    (eng) This paper introduces Madeleine II, a new adaptive and portable multi-protocol communication library. Madeleine II has the ability to control multiple network protocols (BIP, SISCI, VIA) and multiple network adapters ...
  • Laboratoire de l'informatique du parallélisme; Aumage, Olivier; Mercier, Guillaume; Namyst, Raymond (2000-10)
    (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 ...
  • Laboratoire de l'informatique du parallélisme; Antoniu, Gabriel; Bougé, Luc (2000-11)
    (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 ...
  • Laboratoire de l'informatique du parallélisme; Lefevre, Vincent; Muller, Jean-Michel (2000-11)
    (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 ...
  • Laboratoire de l'informatique du parallélisme; Lefevre, Vincent; Muller, Jean-Michel (2000-11)
    (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 ...
  • Laboratoire de l'informatique du parallélisme; Koiran, Pascal (2000-11)
    (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 ...
  • Laboratoire de l'informatique du parallélisme; Mignot, Jean-Christophe (2000-12)
    (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, ...
  • Laboratoire de l'informatique du parallélisme; Jarry, Aubin; Casanova, Henri; Berman, Francine (2000-12)
    (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 ...
  • LAMY P.; Institut National de Recherche et de Sécurité pour la prévention des accidents du travail et des maladies professionnelles (INRS, 2002)
    Dans le domaine de la sécurité des machines, de nouvelles normes (CEI 61508 et CD CEI 62061) visent à quantifier la probabilité de défaillance dangereuse, nommée PFD, des pannes matérielles d'un système. Cette quantification ...

Search DSpace


Advanced Search

Browse

My Account

Bookmark and Share