Publication

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.

Image Reconstruction in the Gigavision Camera

Martin Vetterli, Edoardo Charbon, Sabine Süsstrunk, Luciano Sbaiz, Feng Yang

Recently we have proposed a new image device called the gigavision camera. The main feature of this camera is that the pixels have a binary response. The response function of a gigavision sensor is non-linear and similar to a logarithmic function, which ma ...

2009

M-DPOP: Faithful distributed implementation of efficient social choice problems

Boi Faltings, Adrian Petcu, David C. Parkes

In the efficient social choice problem, the goal is to assign values, subject to side constraints, to a set of variables to maximize the total utility across a population of agents, where each agent has private information about its utility function. In th ...

2008

Primal-Dual Enumeration for Multiparametric Linear Programming

Colin Neil Jones

Optimal control problems for constrained linear systems with a linear cost can be posed as multiparametric linear programs (pLPs) and solved explicitly offline. Several algorithms have recently been proposed in the literature that solve these pLPs in a fai ...

Springer Berlin Heidelberg2006

Disassembly scheduling

Hwa-Joong Kim

This dissertation focuses on disassembly scheduling, which is the problem of determining the quantity and timing of disassembling used or end-of-life products while satisfying the demand of their parts/components over a given planning horizon. The objectiv ...

EPFL2005

Sur quelques inclusions différentielles de premier et de deuxième ordre

Gisella Croce

The principal subject of this thesis is the study of some Dirichlet problems related to differential inclusions of first and second order. We have studied the two following problems : where E ⊂ R2×2 is a compact isotropic set and where We show some existen ...

EPFL2004

Optimal volume subintervals with k points and star discrepancy via integer programming

Eric Thiémard

Given n points in the s-dimensional unit cube, we consider the problem of finding a subinterval of minimum or maximum volume that contains exactly k of the n points. We give integer programming formulations of these problems and techniques to tackle their ...

2001

A Kalman filtering algorithm for regularization networks

Giancarlo Ferrari Trecate

Regularization networks are nonparametric estimators obtained from the application of Tychonov regularization or Bayes estimation to the hypersurface reconstruction problem. With the usual algorithm, the computation of the weights scales as

O(n^3)

where ...

2000

Exact Computation of Area Moments for Spline and Wavelet Curves

Michaël Unser, Thierry Blu, Mathews Jacob

We present an exact algorithm for the computation of the moments of a region bounded by a curve represented in a scaling function or wavelet basis. Using Green's theorem, we show that the computation of the area moments is equivalent to applying a suitable ...

IEEE2000

Key improvements to XTR

Arjen Lenstra

This paper describes improved methods for XTR key representation and parameter generation (Lenstra et al., 2000). If the field characteristic is properly chosen, the size of the XTR public key for signature applications can be reduced by a factor of three ...

2000

Approaches for analog VLSI simulation of the transient stability of large power networks

Christian Enz

This paper suggests several approaches for determining the transient stability of a power network by using an analog VLSI chip for simulating the system behavior. The main advantages of using this method are the much shorter computation time and lower comp ...

1999

A Kalman filtering algorithm for regularization networks

Giancarlo Ferrari Trecate

O(n^3)

where ...

2000