Fast Byzantine Agreement

Related publications (28)

A mmWave Low Complexity and Low-Cost Super Wideband Dual-Polarized Aperture Coupled Antenna for 5G Applications

Advanced antenna system (AAS) is a viable option for 5G millimeter-wave (mmWave) applications. AAS single element is favored to be dual-polarized, wideband, high gain, and compact in order to be utilized for 5G antenna arrays. In this paper, a low complexi ...

Ieee-Inst Electrical Electronics Engineers Inc2024

Hypergraph-Based Fast Distributed AC Power Flow Optimization

Colin Neil Jones, Yuning Jiang, Yingzhao Lian, Xinliang Dai

This paper presents a novel distributed approach for solving AC power flow (PF) problems. The optimization problem is reformulated into a distributed form using a communication structure corresponding to a hypergraph, by which complex relationships between ...

IEEE2023

Page 3 of 3

About
Privacy
Disclaimer

Graph Chatbot

A mmWave Low Complexity and Low-Cost Super Wideband Dual-Polarized Aperture Coupled Antenna for 5G Applications

Anja Skrivervik, Abolfazl Azari

Ieee-Inst Electrical Electronics Engineers Inc2024

On the selection and effectiveness of pseudo-absences for species distribution modeling with deep learning

Devis Tuia, Nina Marion Aurélia Van Tiel, Benjamin Alexander Kellenberger, Robin Adrien Zbinden, Lloyd Haydn Hughes

Species distribution modeling is a highly versatile tool for understanding the intricate relationship between environmental conditions and species occurrences. However, the available data often lacks information on confirmed species absence and is limited ...

2024

Hypergraph-Based Fast Distributed AC Power Flow Optimization

Colin Neil Jones, Yuning Jiang, Yingzhao Lian, Xinliang Dai

IEEE2023

Byzantine consensus is Θ(n^2): the Dolev-Reischuk bound is tight even in partial synchrony!

Rachid Guerraoui, Jovan Komatovic, Manuel José Ribeiro Vidigueira, Pierre Philippe Civit, Vincent Gramoli, Seth Gilbert

The Dolev-Reischuk bound says that any deterministic Byzantine consensus protocol has (at least) quadratic (in the number of processes) communication complexity in the worst case: given a system with n processes and at most f < n/3 failures, any solution t ...

2023

Near-Optimal Communication Lower Bounds for Approximate Nash Equilibria

Mika Tapani Göös

We prove an N2-o(1) lower bound on the randomized communication complexity of finding an epsilon-approximate Nash equilibrium (for constant epsilon > 0) in a two-player N x N game. ...

Siam Publications2023

Why computational complexity may set impenetrable barriers for epistemic reductionism

Michael Herzog, Christian Sachse, Adrien Christophe Doerig

According to physicalism, everything is physical or metaphysically connected to the physical. If physicalism were true, it seems that we should - in principle - be able to reduce the descriptions and explanations of special sciences to physical ones, for e ...

Springer2023

Results on Sparse Integer Programming and Geometric Independent Sets

Jana Tabea Cslovjecsek

An integer linear program is a problem of the form max{c^T x : Ax=b, x >= 0, x integer}, where A is in Z^(n x m), b in Z^m, and c in Z^n. Solving an integer linear program is NP-hard in general, but there are several assumptions for which it becomes fixed ...

EPFL2023

Homothetic Tube Model Predictive Control With Multi-Step Predictors

Giancarlo Ferrari Trecate, Danilo Saccani, Melanie Nicole Zeilinger

We present a robust model predictive control (MPC) framework for linear systems facing bounded parametric uncertainty and bounded disturbances. Our approach deviates from standard MPC formulations by integrating multi-step predictors, which provide reduced ...

Ieee-Inst Electrical Electronics Engineers Inc2023