mirage

# Parcourir LIP - Laboratoire de l'Informatique du Parallélisme par titre

Tri par : Ordre : Résultats :

• (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. ...
• (2004-11)
(eng) We prove the confluence of $\overline{\lambda}\mu\widetilde{\mu}_T$ and $\overline{\lambda}\mu\widetilde{\mu}_Q$, two well-behaved subcalculi of the $\overline{\lambda}\mu\widetilde{\mu}$ calculus, closed under ...
• (1996-07)
(eng) Neural networks are well known as universal approximators. But the performance of neural network depends on several parameters. Finding the best set of parameters has no theoretical answer. Neural network users are ...
• (1997-09)
(eng) We study a problem coming from the design of wireless cellular radiocommunication network. Frequency planning constraints are modelled in terms of graph theory. For each planning function $f$ let us call $sp(f)$ - ...
• (2005-06)
(eng) Solving systems of linear equations is one of the key operations in linear algebra. Many different algorithms are available in that purpose. These algorithms require a very accurate tuning to minimise runtime and ...
• (2002-04)
(eng) Current software and hardware systems, being parallel and reconfigurable, raise new safety and reliability problems, and the resolution of these problems requires new methods. Numerous proposals attempt at reducing ...
• (1999-09)
(eng) Fast networks have made it possible to aggregate distributed CPU, memory, and storage resources into Grids that can deliver considerable performance. However, achieving performance on such systems requires good ...
• (1996-04)
(eng) This paper studies the use of threads to support the execution of data-parallel programs. The overhead induced by the multithreaded environment is experimentally studied : global synchronization, thread creation, ...
• (2004-01)
(eng) Let tau(k) be the minimum number of arithmetic operations required to build the integer k from the constants 1 and 2. A sequence (x_k) is said to be easy to compute'' if tau(x_k) is bounded by a polynomial function ...
• (LIP, 2006-06)
(eng) We study the power of big products for computing multivariate polynomials in a Valiant-like framework. More precisely, we deﬁne a new class VΠP0 as the set of families of polynomials that are exponential products ...
• (1994-04-01)
(eng) This report focuses on the compilation of the while'' loops in data-parallel languages for MIMD Shared Memory architectures. An efficient compilation must decrease the number of global synchronizations'' due to ...
• (2002-09)
(eng) Let E be a vector space of dimension n over an infinite field K. We give polynomial time constructions of families of r-dimensional subspaces of E with the following transversality property: any linear subspace of E ...
• (2000-03)
(eng) Applications often have to chose between the slow TCP and the unreliable UDP. Robin Kravets from the GaTech has proposed an alternative: the Variable Reliability Protocol (VRP). The applications can specify what the ...
• (LIP, 2006-02)
(eng) In this paper, we propose the design of VoroNet, an object-based peer to peer overlay network relying on Voronoi tessellations, along with its theoretical analysis and experimental evaluation. VoroNet differs from ...
• (2004-11)
(eng) Double rounding consists in a first rounding in an intermediate extended precision and then a second rounding in the working precision. The natural question is then of the precision and correctness of the final result. ...
• (LIP, 2008-10)
This position paper advocates the need for scheduling. Even if resources at our disposal would become abundant and cheap, not to say unlimited and free (a~perspective that is not granted), we would still need to assign the ...
• (1995-04-05)
(eng) Consider shortest path interval routing, a popular memory-balanced method for solving the routing problem on arbitrary networks. Given a network G, let IRS(G) denote the maximum number of intervals necessary to encode ...
• (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 ...
• (LIP, 2006-06)
(eng) XCP is a transport protocol that uses the assistance of specialized routers to accurately determine the sender’s congestion window size. However, XCP requires the collaboration of all the routers on the data path ...
• (LIP, 2007-12)
(eng) eXplicit Control Protocol (XCP) is a transport protocol that efficiently controls the sender’s congestion window size thus avoiding the slow-start and congestion avoidance phase. XCP requires the collaboration of ...

# Recherche

Recherche avancée