Publication

Algorithms for Location-Independent Communication between Mobile Agents

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.

Learning collaborative manipulation tasks by demonstration using a haptic interface

Aude Billard, Sylvain Calinon, Elena Gribovskaya

This paper presents a method by which a robot can learn through observation to perform a collaborative manipulation task, namely lifting an object. The task is first demonstrated by a user controlling the robot's hand via a haptic interface. Learning extra ...

Ieee Service Center, 445 Hoes Lane, Po Box 1331, Piscataway, Nj 08855-1331 Usa2009

Latency-aware Leader Election

André Schiper, Martin Hutle, Nuno Filipe de Sousa Santos

Experimental studies have shown that electing a leader based on measurements of the underlying communication network can be beneficial. We use this approach to study the problem of electing a leader that is eventually not only correct (as aptured by the fa ...

ACM2009

Latency-aware leader election

André Schiper, Martin Hutle, Nuno Filipe de Sousa Santos

Experimental studies have shown that electing a leader based on measurements of the underlying communication network can be beneficial. We use this approach to study the prob- lem of electing a leader that is eventually not only correct (as captured by the ...

ACM Press2009

Annotations of maps in collaborative work at a distance

Mauro Cherubini

This thesis inquires how map annotations can be used to sustain remote collaboration. Maps condense the interplay of space and communication, solving linguistic references by linking conversational content to the actual places to which it refers. This is a ...

EPFL2008

On the Specification of Partitionable Group Membership

André Schiper, Stefan Pleisch, Olivier Rütti

Group communication in partitionable systems has been the focus of many research activities over the last decade. Fault-tolerant applications in a partitionable system model generally rely on two basic services: a group membership service and a reliable mu ...

IEEE Computer Society2008

Rethinking the Design of Distributed Stream Processing Systems

Karl Aberer, Ali Salehi

In this paper, we present a novel architecture to support large scale stream processing services in a widely distributed environment. The proposed system, COSMOS, distinguishes itself by its loose coupling and communication efficiency. To exploit the shari ...

IEEE Computer Society2008

Atomic broadcast

Nils Richard Ekwall

Within only a couple of generations, the so-called digital revolution has taken the world by storm: today, almost all human beings interact, directly or indirectly, at some point in their life, with a computer system. Computers are present on our desks, co ...

EPFL2007

Broadcast, relay and feedback in Gaussian channels

Sibi Raj Bhaskaran Pillai

Network information theory explores the fundamental data transport limits over communication networks. Broadcasting and relaying are two natural models arising in communication contexts where multiple users share a common communication medium. Number of re ...

EPFL2007

Apparatus for manipulating, modifying and characterizing particles in a micro channel

Philippe Renaud, Thomas Michael Braschler, Nicolas Demierre, Olof Pontus Linderholm, Urban Seger

Microfluidic system comprising a space (0207) for containing a liquid and at least one lateral chamber (0201) in communication with said space, said lateral chamber containing a metal electrode (0204). The lateral chamber and the space are designed to be f ...

2007

Brief Note on Secured P-Grid (Version-1)

This document talks briefly about making the current P- Grid implementation secure. We realize the following two requirements which we feel are essential for making communication on P-Grid the most secure one. ...

2007