mirage

Browsing Mathématiques / Mathematics by Title

DSpace/Manakin Repository

Browsing Mathématiques / Mathematics by Title

Sort by: Order: Results:

  • Laboratoire de l'informatique du parallélisme; Koiran, Pascal; Fournier, Hervé (1997-10)
    (eng) We show that proving lower bounds in algebraic models of computation may not be easier than in the standard Turing machine model. For instance, a superpolynomial lower bound on the size of an algebraic circuit solving ...
  • Laboratoire de l'informatique du parallélisme; Lang, Tomas; Muller, Jean-Michel (2000-11)
    (eng) This paper presents upper bounds on the number of zeros and ones after the rounding bit for algebraic functions. These functions include reciprocal, division, square root, and inverse square root, which have been ...
  • Charnay, Roland; Douaire, Jacques; Guillaume, Jean-Claude; Valentin, Dominique; Hubert, Christiane; Nonnon, Elisabeth; Institut national de recherche pédagogique (INRP, 1995)
    La Boîte noire, le Nombre-cible, Maisons à construire, Monnaie, le Jeu du banquier, Partages... : autant d'activités proposées pour les premiers apprentissages mathématiques, en grande section, au CP et au CE1. Des ...
  • Laboratoire de l'informatique du parallélisme; Storjohann, Arne; Villard, Gilles (2005-01)
    (eng) We reduce the problem of computing the rank and a nullspace basis of a univariate polynomial matrix to polynomial matrix multiplication. For an input n x n matrix of degree d over a field K we give a rank and nullspace ...
  • Dugast, F.; Chapelain, B.; Colomb, J.; Cullier, F.; Lantier, N.; Institut national de recherche pédagogique (INRP, 1991)
    CONSTRUCTION DE SAVOIRS MATHÉMATIQUES AU COLLÈGE « Il est indispensable que les connaissances aient pris un sens pour (l'élève) à partir de questions qu'il s'est posées et qu'il sache les mobiliser pour résoudre des ...
  • 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 ...
  • Laboratoire de l'informatique du parallélisme; Beaumont, Olivier; Legrand, Arnaud; Rastello, Fabrice; Robert, Yves (2000-12)
    (eng) In this paper, we deal with redistribution issues for dense linear algebra kernels on heterogeneous platforms. In this context, processors speeds may well vary during the execution of a large kernel, which requires ...
  • Laboratoire de l'informatique du parallélisme; Dougherty, Daniel; Lescanne, Pierre (2000-02)
    (eng) This paper is part of a general programme of treating explicit substitutions as the primary $\lambda$-calculi from the point of view of foundations as well as applications. Here we investigate the property of strong ...
  • Laboratoire de l'informatique du parallélisme; Mignot, Jean-Christophe (2000-11)
    (eng) This paper presents a survey of the state-of-the-art techniques and prototypes for streaming over the Internet. The basic principles are presented, the most important approaches (RTP, RTSP) are described.
  • Robin, Daniel; Barrier, Emilie; Institut national de recherche pédagogique, Département évaluation et fonctionnement des systèmes d'éducation (INRP, 1985)
    Cet ouvrage présente les résultats français de l'enquête internationale sur l'enseignement des mathématiques qui s'est déroulée durant l'année scolaire 1981-1982. Décrire les résultats d'une enquête qui porte sur plus de ...
  • 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; Lafitte, Grégory; Mazoyer, Jacques (2000-02)
    (eng) We consider the infinite versions of the usual computational complexity questions LogSpace?=P, NLogSpace?=P by studying the comparison of their descriptive logics on infinite partially ordered structures rather than ...
  • 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; 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 ...
  • Colomb, J.; Institut national de recherche pédagogique (INRP, 1976)
    On trouvera dans ce volume de la Collection « Recherches Pédagogiques » : — Une présentation de la méthodologie employée dans la recherche I.N.R.D.P. Mathématique à l'école élémentaire : «ETUDE DU ROLE DES MOYENS ...
  • 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; Beuchat, Jean-Luc; Muller, Jean-Michel (2005-02)
    (eng) The RN-codings are particular cases of signed-digit representations, for which rounding to the nearest is always identical to truncation. In radix $2$, Booth recoding is an RN-coding. In this paper, we suggest several ...
  • Laboratoire de l'informatique du parallélisme; Muller, Jean-Michel (2005-02)
    (eng) Function ulp (acronym for unit in the last place) is frequently used for expressing errors in floating-point computations. We present several previously suggested definitions of that function, and analyse some of ...
  • 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; Rémila, Eric (2000-04)
    (eng) We study the structure of the set of tilings of a polygon $P$ with bars of fixed length. We obtain a undirected graph connecting two tilings if one can pass from one tile to the other one by a flip (i. e a local ...

Search DSpace


Advanced Search

Browse

My Account

Bookmark and Share