From the 1 of 988 papers with an AI index.
29.3k citations
- F. Rossi2 profiles18 · h 27
- S. Tixeuil2 profiles16 · h 35
- Laurent Romary3 profiles15 · h 26
- F. Bach14 · h 108
- Marc Schoenauer2 profiles13 · h 49
- M. Fliess2 profiles10 · h 51
- Fabien Mathieu9 · h 15
- Gaël Varoquaux9
- Konstantin Avrachenkov2 profiles9 · h 41
- M. Potop-Butucaru2 profiles9 · h 31
- N. Carbonell2 profiles9 · h 14
- P. Robert9 · h 20
- Laboratoire Lorrain de Recherche en Informatique et ses ApplicationsFR116 papers
- Centre National de la Recherche ScientifiqueFR109 papers
- Centre Inria de SaclayFR97 papers
- Centre Inria de l'Université de LilleFR50 papers
- Institut de Recherche en Informatique et Systèmes AléatoiresFR38 papers
- Université Grenoble AlpesFR32 papers
- Centre Inria de l'université de BordeauxFR30 papers
- Institut Élie Cartan de LorraineFR28 papers
- Sorbonne UniversitéFR28 papers
- Laboratoire de l'Informatique du ParallélismeFR27 papers
- LIP6FR25 papers
- Centre Inria de l'Université de LorraineFR24 papers
9 papers · 2 filters
Self-Stabilizing Balancing Algorithm for Containment-Based Trees
Evangelos Bampas, Anissa Lamani, Franck Petit +1
Containment-based trees encompass various handy structures such as B+-trees, R-trees and M-trees. They are widely used to build data indexes, range-queryable overlays, publish/subs…
Non regression testing for the JOREK code
Guillaume Latu, Marina Becoulet, Guilhem Dif-Pradalier +9
Non Regression Testing (NRT) aims to check if software modifications result in undesired behaviour. Suppose the behaviour of the application previously known, this kind of test mak…
An optimized conflict-free replicated set
Annette Bieniusa, Marek Zawirski, Nuno Preguiça +4
Eventual consistency of replicated data supports concurrent updates, reduces latency and improves fault tolerance, but forgoes strong consistency. Accordingly, several cloud comput…
Scheduling tree-shaped task graphs to minimize memory and makespan
Loris Marchal, Oliver Sinnen, Frédéric Vivien
This paper investigates the execution of tree-shaped task graphs using multiple processors. Each edge of such a tree represents a large IO file. A task can only be executed if all…
A GPU-accelerated Branch-and-Bound Algorithm for the Flow-Shop Scheduling Problem
Melab Nouredine, Imen Chakroun, Mezmaz Mohand +1
Branch-and-Bound (B&B) algorithms are time intensive tree-based exploration methods for solving to optimality combinatorial optimization problems. In this paper, we investigate the…
File system on CRDT
Mehdi Ahmed-Nacer, Stéphane Martin, Pascal Urso
In this report we show how to manage a distributed hierarchical structure representing a file system. This structure is optimistically replicated, each user work on his local repli…