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 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
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
The economic environment in the specialty chemicals industry requires short times to market and thus the ability to develop new products and processes very rapidly. This, in turn, calls for large scale-ups from laboratory to production. Due to scale-relate ...
Modern Byzantine fault-tolerant state machine replication (BFT) protocols involve about 20.000 lines of challenging C++ code encompassing synchronization, networking and cryptography. They are notoriously difficult to develop, test and prove. We present a ...
Structural investigations of several minerals belonging to the calaverite group with composition Au1–xAgxTe2 (x = 0.00, 0.02, 0.05, 0.09, 0.19, and 0.33) indicate that Ag is randomly distributed on the Au sites. This suppresses the valence fluctuation of A ...
It is noticeable that our society is increasingly relying on computer systems. Nowadays, computer networks can be found at places where it would have been unthinkable a few decades ago, supporting in some cases critical applications on which human lives ma ...
Comparing the Performance of Two Consensus Algorithms with Centralized and Decentralized Communication Schemes Peter Urban and Andre Schiper Protocols that solve agreement problems are essential building blocks for fault tolerant distributed systems. While ...
In this paper we propose an optimistic two-party fair exchange protocol which does not rely on a centralized trusted third party. Instead, the fairness of the protocol relies on the honesty of part of the neighbor participants. This new concept, which is b ...
Peter Urban and Andre Schiper Comparing Distributed Consensus Algorithms Protocols that solve agreement problems are essential building blocks for fault tolerant distributed systems. While many protocols have been published, little has been done to analyze ...
One of the fundamental differences between a centralized system and a distributed one is the notion of partial failures. The ability to efficiently and accurately detect failures is a key element underlying reliable distributed computing. In current distri ...
