State Machine Replication is More Expensive than Consensus
Related publications (32)
Graph Chatbot
Chat with Graph Search
Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.
DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.
By the addition of entropic regularization, multimarginal optimal transport problems can be trans-formed into tensor scaling problems, which can be solved numerically using the multimarginal Sinkhorn algorithm. The main computational bottleneck of this alg ...
Modern machine learning architectures distinguish servers and workers. Typically, a d-dimensional model is hosted by a server and trained by n workers, using a distributed stochastic gradient descent (SGD) optimization scheme. At each SGD step, the goal is ...
Schloss Dagstuhl--Leibniz-Zentrum f{\"u}r Informatik2021
This paper presents a new All-In-One (AIO) implementation of an existing formulation to design adaptive structures through Total Energy Optimization (TEO). The method implemented in previous work is a nested optimization process, here named TEO-Nested. Num ...
Projects such as "The Dark Energy Spectroscopic Instrument" (DESI) [1] or "The Multi Object Optical and Near-infrared Spectrograph" (MOONS) [5] are developing spectrographs, composed of more than thousand of optical fibers in a confined hexagonal focal pla ...
SPIE-INT SOC OPTICAL ENGINEERING2018
Many modern services need to routinely perform tasks on a large scale. This prompts us to consider the following question:How can we design efficient algorithms for large-scale computation?In this thesis, we focus on devising a general strategy to addr ...
EPFL2018
,
The computation of the matrix exponential is a ubiquitous operation in numerical mathematics, and for a general, unstructured n×n matrix it can be computed in O(n3) operations. An interesting problem arises if the input matrix is a Toeplitz matrix, for exa ...
MATHICSE2016
We apply diffusion strategies to develop a fully-distributed cooperative reinforcement learning algorithm in which agents in a network communicate only with their immediate neighbors to improve predictions about their environment. The algorithm can also be ...
IEEE2015
,
Over-the-air computation (AirComp) is a disruptive technique for fast wireless data aggregation in Internet of Things (IoT) networks via exploiting the waveform superposition property of multiple-access channels. However, the performance of AirComp is bott ...
For studying spectral properties of a nonnormal matrix A is an element of Cnxn, information about its spectrum sigma(A) alone is usually not enough. Effects of perturbations on sigma(A) can be studied by computing epsilon-pseudospectra, i.e. the level sets ...
WILEY2019
,
This paper reports on the number field sieve computation of a 768-bit prime field discrete logarithm, describes the different parameter optimizations and resulting algorithmic changes compared to the factorization of a 768-bit RSA modulus, and briefly disc ...