Publication

Agent Communication Semantics for Open Environments: Issues and Challenges

Publications associées (36)

Graph Chatbot

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.

Connectez-vous pour utiliser Chat avec Graph Search

A General Characterization of Indulgence

Rachid Guerraoui

An indulgent algorithm is a distributed algorithm that, besides tolerating process failures, also tolerates unreliable information about the interleaving of the processes. This article presents a general characterization of indulgence in an abstract comput ...

2008

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

Evolutionary Conditions for the Emergence of Communication in Robots

Dario Floreano, Stéphane Magnenat, Laurent Keller, Sara Mitri

Information transfer plays a central role in the biology of most organisms, particularly social species [1, 2]. Although the neurophysiological processes by which signals are produced, conducted, perceived, and interpreted are well understood, the conditio ...

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

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

Securing Vehicular Communications - Assumptions, Requirements, and Principles

Jean-Pierre Hubaux, Panagiotis Papadimitratos

Among civilian communication systems, vehicular networks emerge as one of the most convincing and yet most challenging instantiations of the mobile ad hoc networking technology. Towards the deployment of vehicular communication systems, security and privac ...

2006

Dynamic group communication

André Schiper

Group communication is the basic infrastructure for implementing fault-tolerant replicated servers. While group communication is well understood in the context of static groups (in which the membership does not change), current specifications of dynamic ...

Springer Verlag2006

Language Support for Fast and Reliable Message Based Communication in Singularity OS

James Richard Larus

Message-based communication offers potential benefits of providing stronger specification and cleaner separation between components. Compared with shared-memory interactions, message passing has the potential disadvantages of being more expensive (no direc ...

2006

Effects of ‘Spatialized’ Communication in Tightly Coupled Work

Pierre Dillenbourg, Mauro Cherubini

This technical report describes the advancements on our research on collaborative annotations of maps. Particularly, we are trying to answer the following research question: does making explicit the location references of the elements of a discourse enhanc ...

2006

Multicoordinated Paxos

Rodrigo Malta Schmidt, Fernando Pedone

Classic Paxos is a round-based distributed consensus algorithm. Normally, proposals are sent to the round leader and decided in two communication steps more. Fast Paxos extends Classic Paxos by allowing also fast rounds, in which a decision can be learned ...

2006