Publications related to Complexity class

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.

A Streamline Upwind Petrov-Galerkin Reduced Order Method for Advection-Dominated Partial Differential Equations Under Optimal Control

Fabio Zoccolan, Gianluigi Rozza

In this paper we will consider distributed Linear-Quadratic Optimal Control Problems dealing with Advection-Diffusion PDEs for high values of the Peclet number. In this situation, computational instabilities occur, both for steady and unsteady cases. A Str ...

Walter De Gruyter Gmbh2024

Hybrid ground-state quantum algorithms based on neural Schrödinger forging

Giuseppe Carleo, Sofia Vallecorsa

Entanglement forging based variational algorithms leverage the bipartition of quantum systems for addressing ground-state problems. The primary limitation of these approaches lies in the exponential summation required over the numerous potential basis stat ...

Amer Physical Soc2024

Inhalation of Microplastics—A Toxicological Complexity

Florian Frédéric Vincent Breider, Myriam Borgatta

Humans are chronically exposed to airborne microplastics (MPs) by inhalation. Various types of polymer particles have been detected in lung samples, which could pose a threat to human health. Inhalation toxicological studies are crucial for assessing the e ...

2024

High-Resolution Modeling Without Computation Slowdown for PETALE in CROCUS

Andreas Pautz, Vincent Pierre Lamirand, Thomas Jean-François Ligonnet, Axel Guy Marie Laureau

In a collaboration between Ecole Polytechnique Fédérale de Lausanne (EPFL) and CEA, in the fall of 2020, the experimental Programme d’Étude en Transmission de l’Acier Lourd et ses Eléments (PETALE) was successfully carried out in the CROCUS reactor of EPFL ...

2024

A Comparative Analysis of Tools & Task Types for Measuring Computational Problem-Solving

Richard Lee Davis, Engin Walter Bumbacher, Jérôme Guillaume Brender

How to measure students' Computational Problem-Solving (CPS) competencies is an ongoing research topic. Prevalent approaches vary by measurement tools (e.g., interactive programming, multiple-choice tests, or programming-independent tests) and task types ( ...

Association for Computing Machinery2024

Efficient Continual Finite-Sum Minimization

Volkan Cevher, Efstratios Panteleimon Skoulakis, Leello Tadesse Dadi

Given a sequence of functions

f_1,\ldots,f_n

with

f_i:\mathcal{D}\mapsto \mathbb{R}

, finite-sum minimization seeks a point

{x}^\star \in \mathcal{D}

minimizing

\sum_{j=1}^nf_j(x)/n

. In this work, we propose a key twist into the finite-sum minimizat ...

2024

Reactive collision-free motion generation in joint space via dynamical systems and sampling-based MPC

Aude Billard, Mikhail Koptev, Nadia Barbara Figueroa Fernandez

Dynamical system (DS) based motion planning offers collision-free motion, with closed-loop reactivity thanks to their analytical expression. It ensures that obstacles are not penetrated by reshaping a nominal DS through matrix modulation, which is construc ...

Sage Publications Ltd2024

Identification of typical district configurations: A two-step global sensitivity analysis framework

François Maréchal, Jonas Schnidrig, Cédric Terrier

The recent geopolitical conflicts in Europe have underscored the vulnerability of the current energy system to the volatility of energy carrier prices. In the prospect of defining robust energy systems ensuring sustainable energy supply in the future, the ...

Pergamon-Elsevier Science Ltd2024

Efficient Continual Finite-Sum Minimization

Volkan Cevher, Efstratios Panteleimon Skoulakis, Leello Tadesse Dadi

Given a sequence of functions

f_1,\ldots,f_n

with

f_i:\mathcal{D}\mapsto \mathbb{R}

, finite-sum minimization seeks a point

{x}^\star \in \mathcal{D}

minimizing

\sum_{j=1}^nf_j(x)/n

. In this work, we propose a key twist into the finite-sum minimizat ...

2024

Complexity class

Graph Chatbot

Chat with Graph Search

Quantifying the Unknown: Data-Driven Approaches and Applications in Energy Systems

A Streamline Upwind Petrov-Galerkin Reduced Order Method for Advection-Dominated Partial Differential Equations Under Optimal Control

Hybrid ground-state quantum algorithms based on neural Schrödinger forging

Inhalation of Microplastics—A Toxicological Complexity

High-Resolution Modeling Without Computation Slowdown for PETALE in CROCUS

A Comparative Analysis of Tools & Task Types for Measuring Computational Problem-Solving

Efficient Continual Finite-Sum Minimization

Reactive collision-free motion generation in joint space via dynamical systems and sampling-based MPC

Identification of typical district configurations: A two-step global sensitivity analysis framework

Randomized low-rank approximation and its applications

Quantifying the Unknown: Data-Driven Approaches and Applications in Energy Systems

A Streamline Upwind Petrov-Galerkin Reduced Order Method for Advection-Dominated Partial Differential Equations Under Optimal Control

Inhalation of Microplastics—A Toxicological Complexity

High-Resolution Modeling Without Computation Slowdown for PETALE in CROCUS

Reactive collision-free motion generation in joint space via dynamical systems and sampling-based MPC

Hybrid ground-state quantum algorithms based on neural Schrödinger forging

Randomized low-rank approximation and its applications

A Comparative Analysis of Tools & Task Types for Measuring Computational Problem-Solving

Efficient Continual Finite-Sum Minimization

Identification of typical district configurations: A two-step global sensitivity analysis framework