JavaScript is disabled for your browser. Some features of this site may not work without it.
- DSpace Home >
- →
- Sciences Exactes et Sciences Appliquées >
- →
- Sciences de l'Ingénieur / Engineering >
- →
- Informatique / Computer science >
- →
- Browsing Informatique / Computer science by Issue Date >
Browsing Informatique / Computer science by Issue Date
Now showing items 41-60 of 500
-
(1995-09)(eng) Best-fit is the best known algorithm for on-line bin-packing, in the sense that no algorithm is known to behave better both in the worst case (when Best-fit has performance ratio 1.7) and in the average uniform case, ...
-
(1995-09)(eng) The DNA model of computation, with test tubes of DNA molecules encoding bit sequences, is based on three primitives, extract-a-bit, merge-two-tubes and detect-emptiness. Perfect operations can test the satisfiability ...
-
(1995-09)(eng) We present a general model for differentiable feed-forward neural networks. Its general mathematical description includes the standard multi-layer perceptron as well as its common derivatives. These standard structures ...
-
(1995-09)(eng) We study some decision problems concerning the tiling of the plane with Wang tiles. We present a proof for the undecidability of the tiling problem for the whole plane, and also for the periodic tiling. In these ...
-
(1995-09)(eng) We study of the average case performance of the Best Fit algorithm for on-line bin packing under the distribution in which the item sizes are uniformly distributed in the discrete range{1/k,2/k,...,j/k}. Our main ...
-
(1995-09)(eng) Broadcasting and gossiping are known to be NP-hard problems. This paper deals with approximation algorithms for such problems. We consider both round-complexity and step-complexity in the telephone model. After an ...
-
(1995-09)(eng) This paper presents the proof of correctness of a multiplier circuit formalized in the calculus of inductive constructions. It uses a representation of the circuit as a function from the stream of inputs to the stream ...
-
(1995-10)(eng) Implementing linear algebra kernels on distributed memory parallel computers raises the problem of data distribution of matrices and vectors among the processors. Block-cyclic distribution seems to suit well for most ...
-
(1995-10)(eng) We explore the simulation and computational capabilities of dynamical systems. We first introduce and compare several notions of simulation between discrete systems. We give a general framework that allows dynamical ...
-
(1995-10)(eng) Minimizing communications when mapping affine loop nests onto distributed memory parallel computers has already drawn a lot of attention. This paper focuses on the next step : as it is generally impossible to obtain ...
-
(1995-11)(eng) In the data parallel programming style the user usually specifies the data parallelism explicitly so that the compiler can generate efficient code without enhanced analysis techniques. In some situations it is not ...
-
(1995-11)(eng) Bouclettes is a source to source loop nest parallelizer. It takes as input Fortran uniform, perfectly nested loops and gives as output a HPF (High Performance Fortran) program with data distribution and parallel ...
-
(1995-11)(eng) Several experiments have been performed in order to study the cognitive processes which are involved in odor recognition. The current report summarizes experimental protocol and analyzes collected data. The goal is ...
-
(1995-11)(eng) Bouclettes is a source to source loop nest parallelizer. It takes as input Fortran uniform, perfectly nested loops and gives as output an HPF (High Performance Fortran) program with data distribution and parallel ...
-
(1995-11)(eng) We present yet another heuristic for the software pipelining problem. We believe this heuristic to be of interest because it brings a new insight to the software pipelining problem by establishing its deep link with ...
-
(1995-12)(eng) We present here the use, the implementation and the performances, of the usual message-passing libraries NX, PVM and MPI on the Capitan machine. In particular, the implementation of a multi-user environment is described.
-
(1995-12)(eng) Constructive logic can be used to consider program specifications as logical formulas. The advantage of this approach is to generate programs which are certified with respect to some given specifications. The programs ...
-
(1996-01)(eng) In this paper, we deal with the compact routing problem, that is the problem of implementing routing schemes that use a minimum memory size on each router. A universal routing scheme is a scheme that applies to all ...
-
(1996-01)(eng) In this paper, we deal with the XRAM model introduced in [3]. We mainly show that the original definition of the XRAM model was not consistent, and must be slightly modified. Therefore, we modify the definition of ...
-
(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 ...
Now showing items 41-60 of 500
© INIST-CNRS Mentions légales | Protection des données personnelles | DSpace Software Copyright © 2002-2005 MIT |
