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.
A community in a network is a subset of vertices densely connected to each other, but less connected to the vertices outside. Many different approaches have been developed to find such structures in a given network, but the main drawback of most of the ava ...
Analysis of the linear algorithm for consensus on complex networks shows the existence of two distinct phases, the asymptotic and the transient. The network reaches the asymptotic when the components corresponding to the spectral gap eigenvalue of the weig ...
Neighbor discovery is one of the first steps in the initialization of a wireless ad hoc network. In this paper, we design and analyze practical algorithms for neighbor discovery in wireless networks. We first consider an ALOHA-like neighbor discovery algor ...
A community in a network is a subset of vertices densely connected to each other, but less connected to the vertices outside. Many different approaches have been developed to find such structures in a given network, but the main drawback of most of the ava ...
Ieee Service Center, 445 Hoes Lane, Po Box 1331, Piscataway, Nj 08855-1331 Usa2010
In the origin detection problem an algorithm is given a set S of documents, ordered by creation time, and a query document D. It needs to output for every consecutive sequence of k alphanumeric terms in D the earliest document in S in which the sequence ap ...
A community in a network is a subset of vertices densely connected to each other, but less connected to the vertices outside. Many different approaches have been developed to find such structures in a given network, but the main drawback of most of the ava ...
Ieee Service Center, 445 Hoes Lane, Po Box 1331, Piscataway, Nj 08855-1331 Usa2010
This paper addresses the problem of distributed rate allocation for a class of multicast networks employing linear network coding. The goal is to minimize the cost (for example, the sum rates allocated to each link in the network) while satisfying a multic ...
We introduce the concept of deadlock immunity—a program's ability to avoid all deadlocks that match patterns of deadlocks experienced in the past. We present here an algorithm for enabling large software systems to automatically acquire such immunity witho ...
This paper addresses the problem of distributed rate allocation for a class of multicast networks employing linear network coding. The goal is to minimize the cost (for example, the sum rates allocated to each link in the network) while satisfying a multic ...
The results of a field experiment carried out to assess the accuracy and efficiency of a new in-vehicle navigation algorithm, whose aim is to incorporate and consider travel time reliability and route the guided vehicle along uncongested roads, in the abse ...