Multicore thermal management using approximate explicit Model Predictive Control
Graph Chatbot
Chat with Graph Search
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.
Two-dimensional (2D) flows can be controlled efficiently using spanwise "waviness," i.e., a control (e.g., wall blowing and suction or wall deformation) that is periodic in the spanwise direction. This study tackles the global linear stability of 2D flows ...
We study a generalization of the classical stable matching problem that allows for cardinal preferences (as opposed to ordinal) and fractional matchings (as opposed to integral). After observing that, in this cardinal setting, stable fractional matchings c ...
It was previously shown that the problem of verifying whether a finite concurrent system is linearizable can be done with an EXPSPACE complexity. However, the best known lower bound is PSPACE-hardness, and can be obtained using a reduction from control-sta ...
We study a generalization of the classical stable matching problem that allows for cardinal preferences (as opposed to ordinal) and fractional matchings (as opposed to integral). After observing that, in this cardinal setting, stable fractional matchings c ...
In recent years, extensive research is conducted on the coordination and cooperation strategies of multirotor Micro Aerial Vehicles (MAVs) to perform high-level missions such as scientific exploration, search and rescue, intelligence gathering etc. [1], [2 ...
We resolve the computational complexity of two problems known as NECKLACE-SPLITTING and DISCRETE HAM SANDWICH, showing that they are PPA-complete. For NECKLACE SPLITTING, this result is specific to the important special case in which two thieves share the ...
We consider an optimal control problem for an elliptic partial differential equation (PDE) with random coefficients. The control function is a deterministic, distributed forcing term that minimizes an expected quadratic regularized loss functional. We cons ...
This work presents a novel methodology for speeding up the assembly of stiffness matrices for laminate composite 3D structures in the context of isogeometric and finite element discretizations. By splitting the involved terms into their in-plane and out-of ...
This thesis develops optimization-based techniques for the control of distributed energy resources to provide multiple services to the power network. It is divided into three parts.The first part of this thesis focuses on the development of a framework f ...
A novel manifold learning approach is presented to incorporate computationally efficient obstacle avoidance constraints in optimal control algorithms. The method presented provides a significant computational benefit by reducing the number of constraints r ...
