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 consider two capacity problems in P2P networks. In the first one, the nodes have an infinite amount of data to send and the goal is to optimally allocate their uplink bandwidths such that the demands of every peer in terms of receiving data rate are met ...
Events occurring in a city, such as car accidents, attacks on the security or activities locations are channelled in the urban network. The goal of this report is to provide a GIS tool able to compute densities and diversities in a network space rather tha ...
We consider the binary consensus problem where each node in the network initially observes one of two states and the goal for each node is to eventually decide which one of the two states was initially held by the majority of the nodes. Each node contacts ...
Ieee Service Center, 445 Hoes Lane, Po Box 1331, Piscataway, Nj 08855-1331 Usa2009
In this paper, we list four different interpretations of synchronizability, study their profile in different network structures and give evidence that they do not coincide, in general. By changing the network topological properties, their behavior is track ...
Mobile wireless networks frequently possess, at the same time, both dense and sparse regions of connectivity; for example, due to a heterogeneous node distribution or radio propagation environment. This paper is about modeling both the mobility and the for ...
Our main theorem identifies a class of totally geodesic subgraphs of the 1-skeleton of the pants complex, referred to as the pants graph, each isomorphic to the product of two Farey graphs. We deduce the existence of many convex planes in the pants graph o ...
In this paper, we propose a personalized and contextual ranking algorithm implemented on top of the 3A interaction model. The latter is a generic model intended for designing and describing social and collaborative learning platforms integrating Actors, As ...
Wireless sensor networks have emerged a few years ago, enabling large scale sensing at low cost. There are many interesting problems related to this new sensing tool: designing robust and small hardware, defining adapted routing protocols, minimizing the e ...
Functionally relevant large scale brain dynamics operates within the framework imposed by anatomical connectivity and time delays due to finite transmission speeds. To gain insight on the reliability and comparability of large scale brain network simulatio ...
Gossip-based information dissemination protocols are considered easy to deploy, scalable and resilient to network dynamics. They are also considered highly flexible, namely tunable at will to increase their robustness and adapt to churn. So far however, the ...
