Zobrazeno 1 - 10
of 29
pro vyhledávání: '"Duvignau, Romaric"'
Finding a maximum-weight matching is a classical and well-studied problem in computer science, solvable in cubic time in general graphs. We consider the specialization called assignment problem where the input is a bipartite graph, and introduce in t
Externí odkaz:
http://arxiv.org/abs/2410.09434
Consensus, abstracting a myriad of problems in which processes have to agree on a single value, is one of the most celebrated problems of fault-tolerant distributed computing. Consensus applications include fundamental services for the environments o
Externí odkaz:
http://arxiv.org/abs/2311.09075
We study a well-known communication abstraction called Byzantine Reliable Broadcast (BRB). This abstraction is central in the design and implementation of fault-tolerant distributed systems, as many fault-tolerant distributed applications require com
Externí odkaz:
http://arxiv.org/abs/2201.12880
Significant cost reductions attract ever more households to invest in small-scale renewable electricity generation and storage. Such distributed resources are not used in the most effective way when only used individually, as sharing them provides ev
Externí odkaz:
http://arxiv.org/abs/2112.11286
One of the most celebrated problems of fault-tolerant distributed computing is the consensus problem. It was shown to abstract a myriad of problems in which processes have to agree on a single value. Consensus applications include fundamental service
Externí odkaz:
http://arxiv.org/abs/2110.08592
Publikováno v:
In Theoretical Computer Science 13 September 2023 972
Piecewise Linear Approximation (PLA) is a well-established tool to reduce the size of the representation of time series by approximating the series by a sequence of line segments while keeping the error introduced by the approximation within some pre
Externí odkaz:
http://arxiv.org/abs/1808.08877
Autor:
Duvignau, Romaric
Nous étudions le problème de maintenir une distribution donnée de graphes aléatoires après une séquence arbitraire d’insertions et de suppressions de sommets. Dans l’objectif de modéliser l’évolution de réseaux logiques dynamiques,nous
Externí odkaz:
http://www.theses.fr/2015BORD0177/document
Autor:
Duvignau, Romaric, Heinisch, Verena, Göransson, Lisa, Gulisano, Vincenzo, Papatriantafilou, Marina
Publikováno v:
In Applied Energy 1 November 2021 301