Concept

Nonviolent Communication

Related publications (53)

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.

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

Adaptive Distributed Algorithms for Power-Efficient Data Gathering in Sensor Networks

Razvan Cristescu, Jugoslava Acimovic

In this work, we consider the problem of designing adaptive distributed processing algorithms in large sensor networks that are efficient in terms of minimizing the total power spent for gathering the spatially correlated data from the sensor nodes to a si ...

2005

Efficient Distributed Multiresolution Processing for Data Gathering in Sensor Networks

Razvan Cristescu, Jugoslava Acimovic

We consider large sensor networks where the cost of collecting data from the network nodes to the data gathering sink is critical.~We propose several algorithms that use limited local communication and distributed signal processing to make communication mo ...

2005

Methods of multicriteria decision analysis within the road projects like an element of the sustainability

André-Gilles Dumont, Micaël Tille

The present communication is based on the research undertaken by the author and whose principal results are detailed in its thesis entitled « Choice of alternatives of road infrastructures : multicriteria methods » like on the prospects offered by this one ...

2003

The VidTIMIT Database

This communication describes the multi-modal VidTIMIT database, which can be useful for research involving mono- or multi-modal speech recognition or person authentication. It is comprised of video and corresponding audio recordings of 43 volunteers, recit ...

IDIAP2002

Fast Indulgent Consensus with Zero Degradation

Rachid Guerraoui, Partha Dutta

This paper describes a new consensus algorithm for the asynchronous message passing system model augmented with an unreliable failure detector abstraction: channels are reliable, processes can fail by crashing, and the detection of crashes are not reliable ...

2002

Deconstructing Paxos

Rachid Guerraoui, Partha Dutta, Romain Boichat

The Paxos part-time parliament protocol of Lamport provides a non trivial but very practical way to implement fault-tolerant deterministic services over a distributed message passing system. This paper deconstructs Paxos and modularly reconstructs more res ...

2001

IconoNET: a tool for automated bandwidth allocation planning

Christoph Frei, Boi Faltings, Pearl Pu Faltings

Communication networks are expected to offer a wide range of services to an increasingly large number of users, with a diverse range of quality of service. This calls for efficient control and management of these networks. In this paper, we address the pro ...

Institute of Electrical and Electronics Engineers Inc., Piscataway, NJ, USA2000

Phonons and holes in magnesium doped GaN

Nicolas Grandjean

P doping of gallium nitride by incorporation of magnesium in the layers was controlled recently. Only Popovici et al. [1] have published the results of a Raman study on p type GaN. In the present communication, we report on the interaction of the free hole ...

Materials Research Society1998

Early Consensus in an Asynchronous System with a Weak Failure Detector

André Schiper

Consensus is one of the most fundamental problems in the context of fault-tolerant distributed computing. The problem consists, given a set P of processes having each an initial value vi, in deciding among P on a common value v. In 1985, Fischer, Lynch and ...

1997