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 have monitored and analyzed, through remote sensing and ancillary field surveys, the rapid (O(1) year) development of a tidal network within a newly established artificial salt marsh in the Venice Lagoon. After the construction of the salt marsh, a netw ...
The Atlas TDAQ network consists of four separate networks which together total over 8000 ports at 1 Gbit/s, 60 ports at 10 Gbit/s, 200 Ethernet switches at the edge of the network, 6 multi-blade chassis switches at the core and over 20 km of copper and fib ...
Ieee Service Center, 445 Hoes Lane, Po Box 1331, Piscataway, Nj 08855-1331 Usa2007
We consider networks of FIFO aggregate schedulers. Quite surprisingly, the natural condition (node utilization inferior to one) in general is not sufficient in these networks to ensure stability (boundedness of delay and backlog at each node). Deriving goo ...
A method for the genetic representation of a network (100), the network having one or more devices (20, 30, 70, 80), each device comprising at least one terminal (21, 22, 23; 71, 72) connected to at least one other terminal (21, 22, 23; 71, 72, 61) by a li ...
Reducing the complexity of large systems described as complex networks is key to understanding them and a crucial issue is to know which properties of the initial system are preserved in the reduced one. Here we use random walks to design a coarse graining ...
Analytic queueing network models often assume infinite capacity for all queues. For real systems this infinite capacity assumption does not hold, but is often maintained due to the difficulty of grasping the between-queue correlation structure present in f ...
We study adaptive route choice models that explicitly capture travelers' route choice adjustments according to information on realized network conditions in stochastic time-dependent networks. Two types of adaptive route choice models are explored: an adap ...
The framework of complex networks has been shown to describe adequately a wide class of complex systems made up of a large number of interacting units. In this framework, a node is associated to each unit and two nodes are connected by an edge if the two u ...
We consider networks of FIFO aggregate schedulers. Quite surprisingly, the natural condition (node utilization inferior to one) in general is not sufficient in these networks to ensure stability (boundedness of delay and backlog at each node). Deriving goo ...
We consider networks of FIFO aggregate schedulers. Quite surprisingly, the natural condition (node utilization inferior to one) in general is not sufficient in these networks to ensure stability (boundedness of delay and backlog at each node). Deriving goo ...
Ieee Service Center, 445 Hoes Lane, Po Box 1331, Piscataway, Nj 08855-1331 Usa2007