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.
The parallelized model is first presented and a scalability study is achieved. For computational time saving and memory requirement reasons, the implementation of a three dimensional SPH code implies the need for its parallelization, in order to make possi ...
We present the complete automation of the universal subtraction formalism proposed by Frixione, Kunszt, and Signer for the computation of any cross section at the next-to-leading order in QCD. Given a process, the only ingredient to be provided externally ...
A parallel algorithm for reordering the eigenvalues in the real Schur form of a matrix is presented and discussed. Our novel approach adopts computational windows and delays multiple outside-window updates until each window has been completely reordered lo ...
This report reviews recent developments in ethylbenzene (EB) manufacturing technologies and studies in detail the suggested process; Production of Ethylbenzene via Side Alkylation of Toluene by Methanol. The desired amount of ethylbenzene as the product is ...
Security protocols are essential to the proper functioning of any distributed system running over an insecure network but often have flaws that can be exploited even without breaking the cryptography. Formal cryptography, the assumption that the cryptograp ...
This paper focuses on distributed state estimation using a sensor network for monitoring a linear system. In order to account for physical constraints on process states and inputs, we propose a moving horizon approach where each sensor has to solve a quadr ...
One of the most celebrated results of the theory of distributed computing is the impossibility, in an asynchronous system of n processes that communicate through shared memory registers, to solve the set agreement problem where the processes need to deci ...
The paper considers the consensus problem in a partially synchronous system with Byzantine processes. In this context, the literature distinguishes (1) authenticated Byzantine faults, where messages can be signed by the sending process (with the assumption ...
We examine the long-range exclusion process introduced by Spitzer and studied by Liggett and answer some of the open questions raised by Liggett. In particular, we show the existence of equilibria corresponding to bounded dual harmonic functions and that t ...
The paper considers the consensus problem in a partially synchronous system with Byzantine processes. In this context, the literature distinguishes authenticated Byzantine faults, where messages can be signed by the sending process (with the assumption tha ...