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.
To aid assessments of climate change impacts on water related activities in the case study regions (CSRs) of the EC funded project SWURVE, estimates of uncertainty in climate model data need to be developed. In this paper, two methods to estimate uncertain ...
Advanced fenestration systems are increasingly being used to distribute solar radiation purposefully in buildings. Distribution of visible light and near infrared radiation can be optimized for daylighting and to reduce thermal loads. This can be achieved ...
We define "random trip", a generic mobility model for random, independent node motions, which contains as special cases: the random waypoint on convex or nonconvex domains, random walk on torus, billiards, city section, space graph, intercity and other mod ...
Distributed processing algorithms are attractive alternatives to centralized algorithms for target tracking applications in sensor networks. In this paper, we determine an initial probability distribution of multiple target states in a distributed manner t ...
We present experimental results on the velocity statistics of a granular fluid with an effective stochastic thermostat, in a quasi-two-dimensional configuration. We find the base state, as measured by the single particle velocity distribution P(c) in the c ...
We examine the fundamental properties that determine the basic performance metrics for opportunistic communications. We first consider the distribution of intercontact times between mobile devices. Using a diverse set of measured mobility traces, we find a ...
The very existence of urban formations on all inhabited continents and throughout the history of mankind since the 3rd millennium B.C. leads to suppose a tendency of some structured societies to maximize interaction by minimizing physical distance. Were th ...
Decentralized processing algorithms are attractive alternatives to centralized algorithms for target tracking applications in smart sensor networks since they provide the ability to scale, reduce vulnerability, reduce communication and share processing res ...
We define ``random trip", a generic mobility model for random, independent node motions, which contains as special cases: the random waypoint on convex or non convex domains, random walk on torus, billiards, city section, space graph, intercity and other m ...
We analyze the distribution of the distances between tributaries of a given size (or of sizes larger than a given area) draining along either an open boundary or the mainstream of a river network. By proposing a description of the distance separating presc ...