mirage

Browsing Mathématiques / Mathematics by Issue Date

DSpace/Manakin Repository

Browsing Mathématiques / Mathematics by Issue Date

Sort by: Order: Results:

  • 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 ...
  • 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 ...
  • Institut national de recherche pédagogique (INRP, 1988)
    Comment conduire les premiers apprentissages numériques de la Maternelle au début de l'École primaire ? Un, deux... beaucoup, passionnément propose une approche de ces apprentissages en liaison étroite avec les activités ...
  • 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 ...
  • 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; 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; Koiran, Pascal (1997-10)
    (eng) We show that computing the dimension of a semi-algebraic set of R^n is an NP-complete problem in the Blum-Shub-Smale model of computation over the reals. Since this problem is easily seen to be NPR-hard, the main ...
  • Laboratoire de l'informatique du parallélisme; Ercegovac, Milos; Lang, Tomas; Muller, Jean-Michel; Tisserand, Arnaud (1997-11)
    (eng) This paper deals with the computation of reciprocals, square roots, inverse square roots, and some elementary functions using small tables, small multipliers, and for some functions, a final ``large'' (almost ...
  • Laboratoire de l'informatique du parallélisme; Mignotte, Anne; Muller, Jean-Michel; Peyran, Olivier (1997-11)
    (eng) This article presents a methodology to use a powerful arithmetic (redundant arithmetic) in some parts of designs in order to fasten them without a large increase in area, thanks to the use of both conventional and ...
  • Laboratoire de l'informatique du parallélisme; Cucker, Felipe; Koiran, Pascal; Smale, Steve (1997-11)
    (eng) We show that the integer roots of of a univariate polynomial with integer coefficients can be computed in polynomial time. This result holds for the classical (i.e. Turing) model of computation and a sparse representation ...
  • 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; 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; 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; Beaumont, Olivier; Boudet, Vincent; Rastello, Fabrice; Robert, Yves (2000-03)
    (eng) In this paper, we deal with two geometric problems arising from heterogeneous parallel computing: how to partition the unit square into p rectangles of given area s_1, s_2,..., s_p (such that the sum of the s_i is ...
  • Laboratoire de l'informatique du parallélisme; Koiran, Pascal (2000-03)
    (eng) We show that P = PSPACE implies the collapse of the boolean polynomial hierarchy over any structure which admits ``efficient enumeration of sign conditions''. This fairly rich class of structures contains in particular ...
  • 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; 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 ...
  • 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 ...

Search DSpace


Advanced Search

Browse

My Account

Bookmark and Share