460 citations
- Institut national de recherche en sciences et technologies du numériqueFR2 papers
- Centre National de la Recherche ScientifiqueFR1 paper
- Données et algorithmes pour une ville intelligente et durableFR1 paper
- École Polytechnique Fédérale de LausanneCH1 paper
- Laboratoire d’Analyse et de Mathématiques AppliquéesFR1 paper
- Laboratoire d'Informatique Algorithmique: Fondements et ApplicationsFR1 paper
- Laboratoire en ingénierie cognitive et sémantique1 paper
- Meta (United States)US1 paper
- TU WienAT1 paper
- Université de Versailles Saint-Quentin-en-YvelinesFR1 paper
- Université Paris DiderotFR1 paper
- Université Paris-Est CréteilFR1 paper
8 papers
Supply-Power-Constrained Cable Capacity Maximization Using Multi-Layer Neural Networks
Junho Cho, Sethumadhavan Chandrasekhar, Erixhen Sula +9
We experimentally solve the problem of maximizing capacity under a total supply power constraint in a massively parallel submarine cable context, i.e., for a spatially uncoupled sy…
Forwarding Tables Verification through Representative Header Sets
Yacine Boufkhad, Ricardo De La Paz, Leonardo Linguaglossa +3
Forwarding table verification consists in checking the distributed data-structure resulting from the forwarding tables of a network. A classical concern is the detection of loops.…
LiveRank: How to Refresh Old Datasets
The Dang Huynh, Fabien Mathieu, Laurent Viennot
This paper considers the problem of refreshing a dataset. More precisely , given a collection of nodes gathered at some time (Web pages, users from an online social network) along…
Path computation in multi-layer multi-domain networks: A language theoretic approach
Mohamed Lamine Lamali, Hélia Pouyllau, Dominique Barth
Multi-layer networks are networks in which several protocols may coexist at different layers. The Pseudo-Wire architecture provides encapsulation and de-capsulation functions of pr…
2-Xor revisited: satisfiability and probabilities of functions
Élie de Panafieu, Danièle Gardy, Bernhard Gittenberger +1
The problem 2-Xor-Sat asks for the probability that a random expression, built as a conjunction of clauses , is satisfiable. We revisit this classical problem by giving…
Geometry on the Utility Space
François Durand, Benoît Kloeckner, Fabien Mathieu +1
We study the geometrical properties of the utility space (the space of expected utilities over a finite set of options), which is commonly used to model the preferences of an agent…