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.
We define the distributed, real-time combinatorial optimization problem. We propose a general, semantically well-defined notion of solution stability in such systems, based on the cost of change from an already implemented solution to the new one. This app ...
The need to distribute large files across multiple wide-area sites is becoming increasingly common, for instance, in support of scientific computing, configuring distributed systems, distributing software updates such as open source ISOs or Windows patches ...
We provide an overview of adaptive estimation algorithms over
distributed networks. The algorithms rely on local collaborations and exploit the space-time structure of the data. Each node is allowed to communicate with its neighbors in order to exploit th ...
We present in this paper an approximative method for distributed combinatorial optimization problems based on dynamic programming. The algorithm is a utility propagation method and requires a linear number of messages. The largest message is in the worst c ...
The lack of standardization and the continuous inflow of novel sensor network technologies have made their deployment the main factor of manpower consumption, considerably complicate the interconnection of heterogeneous sensor networks, and make portable a ...
This paper presents a multiagent-system for integrating AL-ICE: a real-life, distributed, large-scale particle physics experiment of the LHC project at CERN. The work is concerned with solving the large-scale coordination problem using a distributed constr ...
In this paper, we argue that a broad range of large-scale network services would benefit from a scalable mechanism for delivering state about a random subset of global participants. Key to this approach is ensuring that membership in the subset changes per ...
This paper provides a quantative comparison of the efficiency of the self-organized construction processes of the P-Grid and FreeNet peer-to-peer systems. Starting from a defined, realistic network topology we simulate the construction of their access stru ...
We consider the problem of bootstrapping self-organized mobile ad hoc networks (MANET), i.e. reliably determining in a distributed and self- organized manner the services to be offered by each node when neither the identity nor the number of the nodes in t ...
P-Grid is a decentralized DHT-based peer-to-peer system with logarithmic search complexity. As it is intended to provide a platform for distributed information management beyond mere file-sharing it supports an update functionality with lazy consistency gu ...