Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.
DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.
This document contains information about how to install Lightsolve, how to create a SketchUp model which is recognizable by Lightsolve, how to run the renderer and how to navigate the Lightsolve interface. It also contains tips for troubleshooting known pr ...
Recent work by Koblitz and Menezes has highlighted the existence, in some cases, of apparent separations between the hardness of breaking discrete logarithms in a particular group, and the hardness of solving in that group problems to which the security of ...
We discuss the basics of discontinuous Galerkin methods (DG) for CEM as an alternative of emerging importance to the widely used FDTD. The benefits of DG methods include geometric flexibility, high-order accuracy, explicit timeadvancement, and very high pa ...
Reduced Basis (RB) method has successfully been used in 2D to solve heat transfer parametrized problems. In this work, we present some 3D applications in the same field. We consider two problems, the steady Thermal Fin and the time dependent Graetz Flow, w ...
The design of 3-dimensional integrated circuits requires new specialized tools, methods and flows. Whereas some tools are on the market and some design flows for standard ICs are extended to handle die stacking and through-silicon vias, much R&D has still ...
We study f -resilient services, which are guaranteed to operate as long as no more than f of the associated processes fail. We prove three theorems asserting the impossibility of boosting the resilience of such services. Our first theorem allows any connect ...
The goal of this project is to develop a new heuristic for pseudo-tree regeneration in S-DPOP. S-DPOP is a version of DPOP which should show performance improvements when resolving problems after small changes. Examples of such problems are: tracking movin ...
The main goal in network information theory is to identify fundamental limits of communication over networks, and design solutions which perform close to such limits. After several decades of effort, many important problems still do not have a characteriza ...
In the solution of fluid-structure interaction (FSI) problems, partitioned procedures are modular algorithms that involve separate fluid and structure solvers that interact in an iterative framework through the exchange of suitable transmission conditions ...
Society for Industrial and Applied Mathematics2010
Limits on the storage space or the computation time restrict the applicability of model predictive controllers (MPC) in many real problems. Currently available methods either compute the optimal controller online or derive an explicit control law. In this ...
Institute of Electrical and Electronics Engineers2011
