Publications associées (56)

Minimum-Energy Broadcast in All-Wireless Networks: NP-Completeness and Distribution Issues

Jean-Pierre Hubaux, Christian Enz, Mario Cagalj

In all-wireless networks a crucial problem is to minimize energy consumption, as in most cases the nodes are battery-operated. We focus on the problem of power-optimal broadcast, for which it is well known that the broadcast nature of the radio transmissio ...
2002

Minimum-energy broadcast in all-wireless networks: NP-completeness and distribution issues

Jean-Pierre Hubaux, Christian Enz, Mario Cagalj

In all-wireless networks a crucial problem is to minimize energy consumption, as in most cases the nodes are battery-operated. We focus on the problem of power-optimal broadcast, for which it is well known that the broadcast nature of the radio transmissio ...
ACM2002

Minimum-energy broadcast in all-wireless networks: NP-Completeness and distribution issues

Jean-Pierre Hubaux, Christian Enz, Mario Cagalj

In all-wireless networks a crucial problem is to minimize energy consumption, as in most cases the nodes are battery-operated. We focus on the problem of power-optimal broadcast, for which it is well known that the broadcast nature of the radio transmissio ...
2002

Polarization-modulated FTIR spectroscopy of lipid/gramicidin monolayers at the air/water interface

Horst Vogel

Monolayers of gramicidin A, pure and in mixts. with dimyristoylphosphatidylcholine (DMPC), were studied in situ at the air/H2O and air/D2O interfaces by polarization-modulated IR reflection absorption spectroscopy (PM-IRRAS). Simulations of the entire set ...
1999

Improved Massively Parallel Computation Algorithms for MIS, Matching, and Vertex Cover

Slobodan Mitrovic, Mohsen Ghaffari

We present O(log log n)-round algorithms in the Massively Parallel Computation (MPC) model, with a(n) memory per machine, that compute a maximal independent set, a 1 + epsilon approximation of maximum matching, and a 2 + epsilon approximation of minimum ve ...
ASSOC COMPUTING MACHINERY0

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.