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.
This thesis focuses on the decisional process of autonomous systems, and more particularly, on the way to take a decision when the time at disposal in order to assess the whole situation is shorter than necessary. Indeed, numerous systems propose solutions ...
This work proposes and analyzes a Smolyak-type sparse grid stochastic collocation method for the approximation of statistical quantities related to the solution of partial differential equations with random coeffcients and forcing terms ( input data of the ...
Society for Industrial and Applied Mathematics2008
We investigate the convergence rate of approximations by finite sums of rank-1 tensors of solutions of multiparametric elliptic PDEs. Such PDEs arise, for example, in the parametric, deterministic reformulation of elliptic PDEs with random field inputs, ba ...
Society for Industrial and Applied Mathematics2010
Randomized techniques play a fundamental role in theoretical computer science and discrete mathematics, in particular for the design of efficient algorithms and construction of combinatorial objects. The basic goal in derandomization theory is to eliminate ...
This work proposes and analyzes an anisotropic sparse grid stochastic collocation method for solving partial differential equations with random coefficients and forcing terms ( input data of the model). The method consists of a Galerkin approximation in th ...
Society for Industrial and Applied Mathematics2008
Peer-to-peer content dissemination applications suffer immensely from freeriders, i.e., nodes that do not provide their fair share. The Tit-for-Tat (TfT) incentives have received much attention as they help make such systems more robust against freeriding. ...
Presenting stimuli of two or more stimulus types randomly interleaved, so called roving, disrupts perceptual learning in many paradigms. Recently, it was shown that no disruption occurs when Gabor stimuli were presented interleaved in sequence, instead of ...
Peer-to-peer (P2P) architectures are popular for tasks such as collaborative download, VoIP telephony, and backup. To maximize performance in the face of widely variable storage capacities and bandwidths, such systems typically need to shift work from poor ...
We give a general proof of aging for trap models using the arcsine law for stable subordinators. This proof is based on abstract conditions on the potential theory of the underlying graph and on the randomness of the trapping landscape. We apply this proof ...
The bounded confidence model of opinion dynamics, introduced by Deffuant et al, is a stochastic model for the evolution of continuous-valued opinions within a finite group of peers. We prove that, as time goes to infinity, the opinions evolve globally into ...