mirage

# Browsing by Title

Sort by: Order: Results:

• (IME, 1978-04)
Faced with a set of needs of different intensities and which he perceives more or less indistinctly, a consumer is not normally capable of selecting among the elements belonging to his set of possible consumptions, those ...
• (2002-11)
(eng) We are interested in the memory usage of sparse direct solvers. We particularly focus on the parallel multifrontal scheme. In the multifrontal approach two kinds of memory can be distinguished: a static one which ...
• (1999-03)
(eng) In this paper, we discuss the existence of an algorithm to decide if a given set of 2 \times 2 matrices is mortal: a set F=\{A_1,\dots,A_m\} of 2 \times 2 matrices is said to be \motnouv{mortal} if there exist an ...
• (IME, 1981-05)
One of the advantages of larger towns with a diversified industrial structure compared to smaller towns with less diversified industries, is that larger towns may utilize more efficiently production factors which are ...
• (1996-02)
(eng) We explore the link between dependence abstractions and maximal parallelism extraction in nested loops. Our goal is to find, for each dependence abstraction, the minimal transformations needed for maximal parallelism ...
• (LIP, 2006-08-30)
(eng) We obtain optimal lower bounds on the nonadaptive probabilistic query complexity of a class of problems deﬁned by a rather weak symmetry condition. In fact, for each problem in this class, given a number T of queries ...
• (1993-05-18)
(eng) In this paper, a set of definitions describing general real number representation systems is presented. Our purpose is to find a sufficiently wide model definition including classical systems (signed-digit notation,linear ...
• (1992-12-21)
(eng) We study the computational capabilities of dynamical systems defined by iterated functions on [0,1]^n. The computations are performed with infinite precision on arbitrary real numbers, like in the model of analog ...
• (1996-02)
(eng) In this paper we build upon results of Padua and Wolfe, who introduce two graph transformations to eliminate anti and output dependences. We first give a unified framework for such transformations. Then, given a loop ...
• (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 ...
• (2003-08)
(eng) Cet article présente tout d'abord diverses améliorations d'un algorithme itératif de multiplication modulaire proposé en 1997 par Jeong et Burleson. Une simple modification de la récurrence permet l'implantation d'une ...
• (INRS, 2011)
Ce document décrit la conception et la caractérisation d'un banc d’essais versatile (CAIMAN). Ce dispositif est capable de produire des nanoaérosols polydispersés ou monodispersés (1) de différentes natures chimiques (2) ...
• (CNRS, 1989-03)
Le Programme Flux Océaniques (PFO) a l'ambition de déterminer, à l'échelle de l'océan global, le flux de matière, essentiellement biogénique, qui disparaît de la couche superficielle, se dépose sur les fonds océaniques et, ...
• (CNRS, 1989-05)
L'objectif majeur du Programme Flux Océaniques (PFO) est de déterminer, à une échelle globale, les flux depuis la surface jusqu'au fond de l'océan. Les particules, qui prennent naissance dans la couche superficielle éclairée, ...
• (CNRS, 1989-05)
Dans le continuum des échelles spatio-temporelles de l'océan, les fronts constituent des "singularités" et posent, à la fois, des problèmes de processus et des problèmes de bilan. Les gradients très accusés qui caractérisent ...
• (CERTU, 2001-11)
L'importance de l'information multimodale aux usagers des transports, notamment pour favoriser l'usage des TC et des modes doux vis-à-vis de la VP, a été maintes fois soulignée et se concrétise par le lancement prévu fin ...
• (2002-10)
(eng) In this paper, we discuss several algorithms for scheduling divisible loads on heterogeneous systems. Our main contributions are (i) new optimality results for single-round algorithms and (ii) the design of an ...
• (2007-03)
(eng) This paper deals with the replica placement problem on fully homogeneous tree networks known as the \REP optimization problem. The client requests are known beforehand, while the number and location of the servers ...
• (1997-09)
(eng) Multicasting is an information dissemination problem which consists, for a node of a distributed memory parallel computer, of sending the same message to an arbitrary subset of nodes. The two major criteria to be ...
• (2004-04)
(eng) We are interested in the active and total memory usage of the multifrontal method. Starting from the algorithms proposed by Liu, we suggest a new scheme together with a tree traversal that give an optimal peak of ...