Zobrazeno 1 - 10
of 315
pro vyhledávání: '"Bertrand Nathalie"'
DAG-based consensus protocols are being adoption by blockchain companies to decrease energy footprints and improve security. A DAG-based consensus protocol collaboratively constructs a partial order of blocks of transactions and produces linearly ord
Externí odkaz:
http://arxiv.org/abs/2407.02167
Autor:
Abily Morgan, Delestre Olivier, Amossé Laura, Bertrand Nathalie, Richet Yann, Duluc Claire-Marie, Gourbesville Philippe, Navaro Pierre
Publikováno v:
ESAIM: Proceedings and Surveys, Vol 48, Pp 385-399 (2015)
2D Free-surface hydraulic modeling tools are commonly used to assess flood hazard for production of maximal water depth (hmax) maps, as support for flood risk assessment. High Resolution (HR) topographic data are big data getting commonly availabl
Externí odkaz:
https://doaj.org/article/a6179324a06845efb5cb97bfa7f542be
Autor:
Fijalkow, Nathanaël, Bertrand, Nathalie, Bouyer-Decitre, Patricia, Brenguier, Romain, Carayol, Arnaud, Fearnley, John, Gimbert, Hugo, Horn, Florian, Ibsen-Jensen, Rasmus, Markey, Nicolas, Monmege, Benjamin, Novotný, Petr, Randour, Mickael, Sankur, Ocan, Schmitz, Sylvain, Serre, Olivier, Skomra, Mateusz
The objective of this collaborative textbook is to present the state of the art on games on graphs, which is part of a larger research topic called game theory. Games on graphs is the field concerned with games whose rules and evolution are represent
Externí odkaz:
http://arxiv.org/abs/2305.10546
Autor:
Bertrand, Nathalie, Gramoli, Vincent, Konnov, Igor, Lazić, Marijana, Tholoniat, Pierre, Widder, Josef
Blockchain has recently attracted the attention of the industry due, in part, to its ability to automate asset transfers. It requires distributed participants to reach a consensus on a block despite the presence of malicious (a.k.a. Byzantine) partic
Externí odkaz:
http://arxiv.org/abs/2206.04489
We consider the parameterized verification problem for distributed algorithms where the goal is to develop techniques to prove the correctness of a given algorithm regardless of the number of participating processes. Motivated by an asynchronous bina
Externí odkaz:
http://arxiv.org/abs/2204.11670
Congestion games are a classical type of games studied in game theory, in which n players choose a resource, and their individual cost increases with the number of other players choosing the same resource. In network congestion games (NCGs), the reso
Externí odkaz:
http://arxiv.org/abs/2009.13632
Decisiveness has proven to be an elegant concept for denumerable Markov chains: it is general enough to encompass several natural classes of denumerable Markov chains, and is a sufficient condition for simple qualitative and approximate quantitative
Externí odkaz:
http://arxiv.org/abs/2008.10426