Concept

Diviser pour régner (informatique)

Publications associées (346)

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

Sampling and Reconstruction of Time-Varying Atmospheric Emissions

Martin Vetterli, Ivan Dokmanic, Juri Ranieri, Amina Chebira

We study the spatio-temporal sampling of physical fields representing the dispersion of a substance in the atmosphere. We consider the following setup: N sensors are deployed at ground level and measure the concentration of a particular substance, while M ...

Ieee2012

Knowledge-based design space exploration of wireless sensor networks

David Atienza Alonso, Ivan Beretta

The complexity of Wireless Sensor Networks (WSNs) has been constantly increasing over the last decade, and the necessity of efficient CAD tools has been growing accordingly. In fact, the size of the design space of a WSN has become large, and an exploratio ...

ACM Press2012

Automatic Skill Acquisition in Reinforcement Learning Using Graph Centrality Measures

Martin Hasler, Ali Ajdari Rad, Alireza Khadivi

Mechanisms on automatic discovery of macro actions or skills in reinforcement learning methods are mainly focused on subgoal discovery methods. Among the proposed algorithms, those based on graph centrality measures demonstrate a high performance gain. In ...

2012

Detection and Recovery From Pollution Attacks in Coding Based Distributed Storage Schemes

László Czap, Levente Buttyan

We address the problem of pollution attacks in coding based distributed storage systems. In a pollution attack, the adversary maliciously alters some of the stored encoded packets, which results in the incorrect decoding of a large part of the original dat ...

Institute of Electrical and Electronics Engineers2011

On the Construction of Polar Codes

Emre Telatar, Seyed Hamed Hassani, Ramtin Pedarsani

We consider the problem of efficiently constructing polar codes over binary memoryless symmetric (BMS) channels. The complexity of designing polar codes via an exact evaluation of the polarized channels to find which ones are "good" appears to be exponenti ...

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

Cognitive Radio Through Primary Control Feedback

Michael Christoph Gastpar

A fundamental problem in dynamic frequency reuse is that the cognitive radio is ignorant of the amount of interference it inflicts on the primary license holder. Policies that attempt to limit interference without the active participation of the primary ar ...

2011

Exploring Spatial Characteristics of Urban Transportation Networks

Nikolaos Geroliminis, Yuxuan Ji

It has been shown recently that a Macroscopic Fundamental Diagram (MFD) exists in urban transportation networks under certain conditions. However, MFD is not universally expected. Previous research demonstrates the existence of MFDs in homogeneous networks ...

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

Verification of consensus algorithms using satisfiability solving

André Schiper

Consensus is at the heart of fault-tolerant distributed computing systems. Much research has been devoted to developing algorithms for this particular problem. This paper presents a semi-automatic verification approach for asynchronous consensus algorithms ...

Springer Verlag2011

An improved substructural identification strategy for large structural systems

Ngoc Thanh Trinh

To identify physical parameters of a large structural system, the computational challenges in dealing with a large number of unknowns are formidable. A divide-and-conquer approach is often required to partition the structural system into many substructures ...

Wiley-Blackwell2011

Introduction to Reliable and Secure Distributed Programming

Rachid Guerraoui, Christian Cachin

This book provides an introduction to distributed programming abstractions and presents the fundamental algorithms that implement them in several distributed en- vironments. The reader is given insight into the important problems of distributed computing a ...

Springer2011