Concept

Message submission agent

Related publications (10)

As easy as ABC: Optimal (A)ccountable (B)yzantine (C)onsensus is easy!

Rachid Guerraoui, Jovan Komatovic, Pierre Philippe Civit, Vincent Gramoli, Seth Gilbert

It is known that the agreement property of the Byzantine consensus problem among n processes can be violated in a non-synchronous system if the number of faulty processes exceeds t0 = ┌n/3┐ − 1 [10], [19]. In this paper, we investigate the accountable Byza ...

IEEE2022

Environmental care and morality: An economic model with heterogeneous agents

Boris Thurm, Charles Chadi Ayoubi

Some individuals voluntarily engage in costly pro-environmental actions although their efforts have limited direct benefits. This paper proposes a novel economic model with heterogeneous agents explaining why. Each agent has a homo moralis type of preferen ...

2020

PriFi: A Low-Latency and Tracking-Resistant Protocol for Local-Area Anonymous Communication

Jean-Pierre Hubaux, Bryan Alexander Ford, Mahdi Zamani, Italo Ivan Dacosta Petrocelli, Ludovic Barman

Popular anonymity mechanisms such as Tor provide low communication latency but are vulnerable to traffic analysis attacks that can de-anonymize users. Moreover, known traffic-analysis-resistant techniques such as Dissent are impractical for use in latency- ...

ACM2016

Distributed Intelligent Modules System Using Power-line Communication for Electrical Appliance Automation

Maher Kayal, Laurent Fabre, Fabrizio Lo Conte, Thierry Barras

In a first aspect the invention provides a system that comprising a plurality of electronic modules, each one of the electronic modules configured for enabling automation of an electrical appliance to be connected to the electronic module. Each electronic ...

2016

A simple relaying strategy for diamond networks

Christina Fragouli, Siddhartha Brahma

We consider a Gaussian diamond network where a source communicates with the destination through n non-interfering half-duplex relays. Using simple approximations to the capacity of the network, we show that simple relaying strategies involving two relays a ...

Ieee2014

Decentralized Self-Selection of Swarm Trajectories: From Dynamical Systems to Robotic Implementation

Francesco Mondada, Max-Olivier Hongler, Guillaume Adrien Sartoretti, Marcelo Elias de Oliveira

In this paper, we present a distributed control strategy, enabling agents to converge onto and travel along a consensually selected curve among a class of closed planar curves. Individual agents identify the number of neighbors within a finite circular sen ...

Springer Verlag2014

Simple Relaying Strategies for Half-duplex Networks

Christina Fragouli, Ayfer Özgür Aydin, Siddhartha Brahma

We consider the diamond network where a source communicates with the destination through N non-interfering half-duplex relays. Using simple outer bounds on the capacity of the network, we show that simple relaying strategies having exactly two states and a ...

2012

User-Aided Data Authentication

Sylvain Pasini

All classical authentication protocols are based on pre-shared authentic information such as long-term secret keys or a public key infrastructure. However, there are many practical settings, where participants can additionally employ authentic Out-Of-Band ...

2009

Characterization of segregation in a tubular polymerization reactor by a new chemical method

Albert Renken, Thierry Meyer

Micromixing in a tubular polymn. reactor is characterized by the mol. wt. of polystyrene obtained in the presence of a chain transfer agent. Monomer and the transfer agent are fed sep. into the reactor. For const. overall inlet concns., the mean mol. wt. p ...

1990

The governing environment

Michael Ignaz Schumacher

Whenever a multiagent system is designed, many dependencies in the system are identified and must be solved in a correct way. Coordination deals with the management of such dependencies. For that, two complementary viewpoints can be distinguished: subjecti ...

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.