Vous pouvez consulter et rechercher ici l'ensemble des rapports de recherche et rapports techniques de l'Inria déposées sur HAL ou sur HAL-Inria.
Pour déposer sur Hal-Inria: http://hal.inria.fr
Dynamic epistemic logic (DEL) provides a very expressive framework for multi-agent planning that can deal with nondeterminism, partial observability, sensing actions, and arbitrary nesting of beliefs about other agents' beliefs. However, as we show in this paper, this expressiveness comes at a price. The planning framework is undecidable, even if we allow only purely epistemic actions (actions that change only beliefs, not ontic facts). Undecidability holds already in the S5 setting with at least 2 agents, and even with 1 agent in S4. It shows that multi-agent planning is robustly undecidable if we assume that agents can reason with an .....
Frederic Giroire; Modrzejewski Remigiusz ; Nicolas Nisse; Stéphane Pérennes
Détail
[Research Report], 2013. RR-8309
Début du résumé
In this paper, we propose and analyze a simple localized algorithm to balance a tree. The motivation comes from live distributed streaming systems in which a source diffuses a content to peers via a tree, a node forwarding the data to its children. Such systems are subject to a high churn, peers frequently joining and leaving the system. It is thus crucial to be able to repair the diffusion tree to allow an efficient data distribution. In particular, due to bandwidth limitations, an efficient diffusion tree must ensure that node degrees are bounded. Moreover, to minimize the delay of the .....
A large number of real-life systems can be viewed as instances of the classical M/G/c/N queue. The exact analytical solution of this queueing model is not known, and a frequently-used approach is to replace the general service time distribution by a phase-type distribution. The advantage of this approach is that the resulting M/Ph/c/N queue can be described by familiar balance equations. The downside is that the size of the resulting state space suffers from the "dimensionality curse", i.e., exhibits combinatorial growth as the number of servers and/or phases increases. To circumvent this complexity issue, we propose to use, instead of .....
Generoso Pagano; Damien Dosimont; Guillaume Huard; Vania Marangozova-Martin; Jean-Marc Vincent
Détail
[Research Report], 2013, pp. 21. RR-8304
Début du résumé
The growing complexity of embedded system hardware and software makes their behavior analysis a challenging task. In this context, tracing appears to be a promising solution as it provides relevant information about the system execution. However, trace management and analysis are hindered by several issues like the diversity of trace formats, the incompatibility of trace analysis methods, the problem of trace size and its storage as well as by the lack of visualization scalability. In this paper we present FrameSoC, a new trace management infrastructure that solves all the above issues together. It provides generic solutions for trace storage and .....
François Cuvelier ; Caroline Japhet ; Gilles Scarella
Détail
[Research Report], 2013, pp. 40. RR-8305
Début du résumé
We describe different optimization techniques to perform the assembly of finite element matrices in Matlab and Octave, from the standard approach to recent vectorized ones, without any low level language used. We finally obtain a simple and efficient vectorized algorithm able to compete in performance with dedicated software such as FreeFEM++. The principle of this assembly algorithm is general, we present it for different matrices in the P1 finite elements case and in linear elasticity. We present numerical results which illustrate the computational costs of the different approaches .....
; Thomas Bolander 
