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 this paper we demonstrate how agent-based modelling can be used to understand the emergence of a new infrastructure system, more specifically, a biogas infrastructure in the Netherlands. The innovative element in our modelling approach is the use of MAI ...
By focusing on the construction of thermodynamically stable structures, the self-assembly of mesoscopic systems has proven capable of formidable achievements in the bottom-up engineering of micro- and nanosystems. Yet, inspired by an analogous evolution in ...
Network visualizations are the most complex visualizations possible, but sometimes they are not capable of describing system-complexity. Even if they are the most widely employed visualization techniques, they still have limitations. Indeed a) their relati ...
In this paper, we propose a secondary consensus-based control layer for current sharing and voltage balancing in DC microGrids (mGs). Differently from existing approaches based on droop control, we assume decentralized Plug-and-Play (PnP) controllers at th ...
With technological progress, humans tend to create engineering systems with constantly increasing complexity and higher operational requirements. Many complex systems require the use of a Health Management (HM) solution to ensure safety and enable lifecycl ...
A computation scheme among n parties is fair if no party obtains the computation result unless all other n-1 parties obtain the same result. A fair computation scheme is optimistic if n honest parties can obtain the computation result without resorting to ...
Network visualizations are the most complex visualizations possible, but sometimes they are not capable of describing system-complexity. Even if they are the most widely employed visualization techniques, they still have limitations. Indeed a) their relati ...
Ten years ago, at 90 nanometers, EDA was challenged and deemed inadequate in dealing with increasing complexity, power consumption, and sub-wavelength lithography, thus harming the progress of mobile phones. Today, at 10 nanometers, integration capacity ha ...
Multidimensional linear attacks are one of the most powerful variants of linear cryptanalytic techniques now. However, there is no knowledge on the key-dependent capacity and data complexity so far. Their values were assumed to be close to the average valu ...
The simulation of Phasor Measurement Units (PMUs) into real-time simulators (RTSs) is typically limited by the complexity of the synchrophasor estimation (SE) algorithm. This is especially true when dealing with distribution network PMUs due to the more de ...
