Publication

Extremum feedback with partial knowledge

Related publications (51)

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.

“Alice in London Architecture Festival.”

Jean-Denis Bourquin, Claire Hofmann Chalard

A group of 12 architecture students from EPFL returned from the London Festival of Architecture (19 June-19 July 08), where their contribution, "Overflow", a structure that reacts to tides in the Thames River, was chosen as the best overall project among a ...

EPFL2008

Cayley Graphs and growth of groups

Nathalie Pellet

One of the most fundamental objects in algebra is the group. There exist plenty of different groups. In the following article we consider some free abelian gorups, cyclic groups, free groups and fundamental groups as well as the products of groups and draw ...

2008

The Next 700 BFT Protocols

Rachid Guerraoui, Marko Vukolic, Nikola Knezevic

Modern Byzantine fault-tolerant state machine replication (BFT) protocols involve about 20.000 lines of challenging C++ code encompassing synchronization, networking and cryptography. They are notoriously difficult to develop, test and prove. We present a ...

2008

Malicious Users in Unstructured Networks

Georgios Theodorakopoulos

Unstructured networks (like ad-hoc or peer-to-peer networks) are networks without centralized control of their operation. Users make local decisions regarding whether to follow the network protocol or not. While providing scalability benefits, this degrade ...

2007

Gossip-Based Peer Sampling

Rachid Guerraoui, Anne-Marie Kermarrec

Gossip-based communication protocols are appealing in large-scale distributed applications such as information dissemination, aggregation, and overlay topology management. This paper factors out a fundamental mechanism at the heart of all these protocols: ...

2007

Advances in the Design and Implementation of Group Communication Middleware

André Schiper, Sergio Mena, Olivier Rütti, Rachele Fuzzati, Daniel Bünzli

Group communication is a programming abstraction that allows a distributed group of processes to provide a reliable service in spite of the possibility of failures within the group. The goal of the project was to improve the state of the art of group commu ...

Springer Berlin Heidelberg2006

Frugal Event Dissemination in a Mobile Environment

Rachid Guerraoui

This paper describes an event dissemination algorithm that implements a topic-based publish/subscribe interaction abstraction in mobile ad-hoc networks (MANETs). Our algorithm is frugal in two senses. First, it reduces the total number of duplicates and pa ...

2005

Towards Flexible Finite-State Machine Based Protocol Composition

André Schiper, Sergio Mena, Nils Richard Ekwall, Stefan Pleisch

Group communication provides primitives that ensure reliable and ordered delivery of messages to a group of destinations. It is an important building block for replicated fault-tolerant applications such as replicated databases. In the past, most group com ...

2004

The SWARM-BOTS project

Dario Floreano, Francesco Mondada, Roderich Gross, Jean-Louis Deneubourg, Luca Maria Gambardella

This paper provides an overview of the SWARM-BOTS project, a robotic project sponsored by the Future and Emerging Technologies program of the European Community (IST-2000-31010). The paper illustrates the robot hardware, and the results of experimental wor ...

Springer Verlag2004

Towards Flexible Finite-State-Machine-Based Protocol Composition

André Schiper, Sergio Mena, Nils Richard Ekwall, Stefan Pleisch

We propose a novel approach to the composition of group communication protocols. In this approach, components are modelled as finite state machines communicating via signals. We introduce two building blocks, called adaptor and adaplexor, that ease the dev ...

2004