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.
In dynamical systems, the full stability of fixed point solutions is determined by their basins of attraction. Characterizing the structure of these basins is, in general, a complicated task, especially in high dimensionality. Recent works have advocated t ...
From basic science to translation, modern biomedical research demands computational models which integrate several interacting physical systems. This paper describes the infrastructural framework for generic multiphysics integration implemented in the soft ...
We present explicit sufficient conditions that guarantee the existence and uniqueness of the load-flow solution for distribution networks with a generic topology (radial or meshed) modeled with positive sequence equivalents. In the problem, we also account ...
We prove that one can run the log minimal model program for log canonical 3-fold pairs in characteristic p > 5. In particular, we prove the cone theorem, contraction theorem, the existence of flips and the existence of log minimal models for pairs with log ...
Motivated by common practices in the reinsurance industry and in insurance markets such as Lloyd's, we study the general problem of optimal insurance contracts design in the presence of multiple insurance providers. We show that the optimal risk allocation ...
LDPC codes are typically decoded by running a synchronous message passing algorithm over the corresponding bipartite factor graph (made of variable and check nodes). More specifically, each synchronous round consists of 1) updating all variable nodes based ...
This paper formulates a multitask optimization problem where agents in the network have individual objectives to meet, or individual parameter vectors to estimate, subject to a smoothness condition over the graph. The smoothness requirement softens the tra ...
This thesis consists of two parts. The first part is about a variant of Banach's fixed point theorem and its applications to several partial differential equations (PDE's), abstractly of the form [ \mathcal Lu + \mathcal Q(u) = f.] The main result of thi ...
In this paper we provide a complete analogy between the Cauchy-Lipschitz and the DiPerna-Lions theories for ODE's, by developing a local version of the DiPerna-Lions theory. More precisely, we prove the existence and uniqueness of a maximal regular flow fo ...
Real-time coordinated traffic management strategies that benefit from parsimonious models with aggregated network dynamics, provide a new generation of smart hierarchical strategies to improve network capacity and performance. However, this raises the ques ...