Replication des données (2009)
Pascal Molli, Gérald Oster, Loria Inria Lorraine
1.1 les pannes............................. 7 1.2 Tolérance aux pannes....................... 8 1.2.1 Reliable/robuste..................... 8
The virtual mesh: A geometric abstraction for efficiently computing radiosity (2009)
L. Alonso, F. Cuny, S. Petitjean, S. Lazard, E. Wies, ...
In this paper, we introduce a general-purpose method for computing radiosity on scenes made of parametric surfaces with arbitrary trimming curves. By contrast with past approaches that require a...
Common tangents to spheres in R 3 (2009)
Ciprian Borcea, Xavier Goaoc, Sylvain Lazard, Sylvain Petitjean, Loria Inria Lorraine
Abstract. We prove that four spheres in R 3 have infinitely many real common tangents if and only if they have aligned centers and at least one real common tangent. 1
Humberto J. Abdelnur, Loria Inria Lorraine, Loria Inria Lorraine
With the recent evolution in the VoIP market, where more and more devices and services are being pushed on a very promising market, assuring their security becomes crucial. Among the most dangerous...
Alexander Wolff, Loria Inria Lorraine
Abstract. In John Tantalo’s on-line game Planarity the player is given a non-plane straight-line drawing of a planar graph. The aim is to make the drawing plane as quickly as possible by moving...
On the Connectedness of Rational Arithmetic Discrete Hyperplanes (2008)
Damien Jamet, Jean-luc Toutant, Loria Inria Lorraine
Abstract. While connected arithmetic discrete lines are entirely characterized by their arithmetic thickness, only partial results exist for arithmetic discrete hyperplanes in any dimension. In the...
Alexander Wolff, Loria Inria Lorraine
Abstract. In John Tantalo’s on-line game Planarity the player is given a non-plane straight-line drawing of a planar graph. The aim is to make the drawing plane as quickly as possible by moving...
Cuihtlauac Alvarado, Loria Inria Lorraine
We describe an interface between Coq, an interactive theorem-prover based on type theory and ELAN, an automated deduction system based on rewriting logic. Our objective is to provide ecient tools to...
Ordered resolution with selection for h (2005)
Carlos Areces, Loria Inria Lorraine
Abstract. The hybrid logic H(@) is obtained by adding nominals and the satisfaction operator @ to the basic modal logic. The resulting logic gains expressive power without increasing the complexity...
Ordered resolution with selection for h (2005)
Carlos Areces, Daniel Gorín, Loria Inria Lorraine
Abstract. The hybrid logic H(@) is obtained by adding nominals and the satisfaction operator @ to the basic modal logic. The resulting logic gains expressive power without increasing the complexity...
The ToxicFarm integrated cooperation framework for virtual teams (2004)
Claude Godart, Olivier Perrin, Hala Skaf-molli, Loria Inria Lorraine, Pradeep Ray, ...
Abstract. Developing a collaboration solution, that scales to an entire organization, that offers an integrated collection of cooperation tools, that is general enough to address a large range of...
Type-safe covariance: Competent compilers can catch all catcalls (2003)
Mark Howard, Éric Bezault, Dominique Colnet, Emmanuel Stapf, Karine Arnout, ...
Goals of expressiveness and flexibility in typed object-oriented programming suggest a “covariant ” type policy, where routine redefinitions can change the types of both arguments and results in...
Learning of Mediation Strategies for Heterogeneous Agents Cooperation (2003)
Romaric Charton Charton, Anne Boyer, Franois Charpillet, Loria Inria Lorraine
state Updates User Profile Manager Rewards select, store and retreive Figure 3. Mediator agent structure The diagram [Figure 3] shows the different elements that compose the mediator and their...
Yeqiong Song, Anis Koubaa, Loria Inria Lorraine
Switched Ethernet is now considered as an attractive enabling technology for supporting factory communication needs. This paper deals with the modelling of an Ethernet switch and the performance...
Yeqiong Song, Anis Koubaa, Loria Inria Lorraine
Switched Ethernet is now considered as an attractive enabling technology for supporting factory communication needs. This paper deals with the modelling of an Ethernet switch and the performance...
Cooperative Co-learning: (2002)
Bruno Scherrer, Loria Inria Lorraine
Solving Multi-Agent Reinforcement Learning Problems is a key issue. Indeed, the complexity of deriving multi-agent plans, especially when one uses an explicit model of the problem, is dramatically...
State Treemap: an Awareness Widget for Multi-Synchronous Groupware (2001)
Pascal Molli, Hala Skaf-molli, Christophe Bouthier, Loria Inria Lorraine
Awareness widgets facilitate coordination for both synchronous and asynchronous groupware systems. Unfortunately, they cannot be used for multi-synchronous groupware systems. With a group of...
State Treemap: an Awareness Widget for Multi-Synchronous Groupware (2001)
Pascal Molli, Hala Skaf-molli, Christophe Bouthier, Loria Inria Lorraine
Awareness widgets facilitate coordination for both synchronous and asynchronous groupware systems. Unfortunately, they cannot be used for multi-synchronous groupware systems, where people work...
ELAN for Equational Reasoning in Coq (2000)
Cuihtlauac Alvarado, Quang-Huy Nguyen, Loria Inria Lorraine
We describe an interface between Coq, an interactive theorem-prover based on type theory and ELAN, an automated deduction system based on rewriting logic. Our objective is to provide efficient tools...
Compact DAG Representation and Its Dynamic Scheduling (1999)
Michel Cosnard, Emmanuel Jeannot, Loria Inria Lorraine
Abstract Scheduling large task graphs is an important issue in parallel computing. In this paper we tackle the two following problems: (1) how to schedule a task graph, when it is too large to t into...
SLC: Symbolic Scheduling for Executing Parameterized Task Graphs on Multiprocessors (1999)
Michel Cosnard, Loria Inria Lorraine, Emmanuel Jeannot, Tao Yang
Task graph scheduling has been found effective in performance prediction and optimization of parallel applications. A number of static scheduling algorithms have been proposed for task graph...
SLC: Symbolic Scheduling for Executing Parameterized Task Graphs on Multiprocessors (1999)
Michel Cosnard, Loria Inria Lorraine, Emmanuel Jeannot, Tao Yang
Task graph scheduling has been found effective in performance prediction and optimization of parallel applications. A number of static scheduling algorithms have been proposed for task graph...
SLC: Symbolic Scheduling for Executing Parameterized Task Graphs on Multiprocessors (1999)
Michel Cosnard, Loria Inria Lorraine, Emmanuel Jeannot, Tao Yang
Task graph scheduling has been found effective in performance prediction and optimization of parallel applications. A number of static scheduling algorithms have been proposed for task graph...
Symbolic Partitionning and Scheduling of Parameterized Task Graphs (1998)
Michel Cosnard, Loria Inria Lorraine, Emmanuel Jeannot, Tao Yang
The DAG-based task graph model has been found effective in scheduling for performance prediction and optimization of parallel applications. However the scheduling complexity and solution normally...
Low Memory Cost Dynamic Scheduling of Large Coarse Grain Task Graphs (1998)
Michel Cosnard, Loria Inria Lorraine, Emmanuel Jeannot, Laurence Rougeot
Scheduling large task graphs is an important issue in parallel computingsince it allows the treatment of big size problems. In this paper we tackle the following problem: how to schedule a task...
Low Memory Cost Dynamic Scheduling of Large Coarse Grain Task Graphs (1998)
Michel Cosnard, Loria Inria Lorraine, Villiers Les Nancy, Emmanuel Jeannot, Laurence Rougeot
Scheduling large task graphs is an important issue in parallel computing since it allows to treat big size problems. In this paper we address the following problem: how to schedule a task graph, when...
Low Memory Cost Dynamic Scheduling of Large Coarse Grain Task Graphs (1998)
Michel Cosnard, Emmanuel Jeannot, Laurence Rougeot, Loria Inria Lorraine
Scheduling large task graphs is animportant issue in parallel computingsince it allows the treatment of big size problems. In this paper we tackle the following problem: how to schedule a task graph,...
Symbolic Partitionning and Scheduling of Parameterized Task Graphs (1998)
Michel Cosnard, Loria Inria Lorraine, Emmanuel Jeannot, Tao Yang
The DAG-based task graph model has been found effective in scheduling for performance prediction and optimization of parallel applications. However the scheduling complexity and solution normally...
Low Memory Cost Dynamic Scheduling of Large Coarse Grain Task Graphs (1998)
Michel Cosnard, Loria Inria Lorraine, Emmanuel Jeannot, Laurence Rougeot
Scheduling large task graphs is an important issue in parallel computing since it allows the treatment of big size problems. In this paper we tackle the following problem: how to schedule a task...