Publications associées à Algorithme du simplexe

Near-Zero Parasitic Shift Flexure Pivots Based on Coupled n-RRR Planar Parallel Mechanisms

Simon Nessim Henein, Florent Cosandier, Loïc Benoît Tissot-Daguette, Etienne Frédéric Gabriel Thalmann

Flexure pivots, which are widely used for precision mechanisms, generally have the drawback of presenting parasitic shifts accompanying their rotation. The known solutions for canceling these undesirable parasitic translations usually induce a loss in radi ...

2024

Primal-Dual Contextual Bayesian Optimization for Control System Online Optimization with Time-Average Constraints

Colin Neil Jones, Yuning Jiang, Bratislav Svetozarevic, Wenjie Xu

This paper studies the problem of online performance optimization of constrained closed-loop control systems, where both the objective and the constraints are unknown black-box functions affected by exogenous time-varying contextual disturbances. A primal- ...

New York2023

A Proximal-Point Lagrangian-Based Parallelizable Nonconvex Solver for Bilinear Model Predictive Control

Colin Neil Jones, Yuning Jiang, Yingzhao Lian

Nonlinear model predictive control (NMPC) has been widely adopted to manipulate bilinear systems with dynamics that include products of the inputs and the states. These systems are ubiquitous in chemical processes, mechanical systems, and quantum physics, ...

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC2023

Efficient and Accurate Handling of Periodic Flows in Time-Sensitive Networks

Jean-Yves Le Boudec, Seyed Mohammadhossein Tabatabaee

Total Flow Analysis (TFA) is a method for the worst-case analysis of time-sensitive networks. It uses service curve characterizations of the network nodes and arrival curves of flows at their sources; for tractability, the latter are often taken to be line ...

2023

A deep learning method for the trajectory reconstruction of cosmic rays with the DAMPE mission

Jennifer Maria Frieden, Chiara Perrina, Xin Wu, Arshia Ruina, Andrii Kotenko

A deep learning method for the particle trajectory reconstruction with the DAMPE experiment is presented. The developed algorithms constitute the first fully machine-learned track reconstruction pipeline for space astroparticle missions. Significant perfor ...

ELSEVIER2023

Zero Parasitic Shift Pivoting Kinematic Structures Based On Coupled N-RRR Planar Parallel Mechanims For Flexure Pivot Design

Simon Nessim Henein, Florent Cosandier, Loïc Benoît Tissot-Daguette, Etienne Frédéric Gabriel Thalmann

ASME2023

Beyond Local Optimality of Buffer and Splitter Insertion for AQFP Circuits

Giovanni De Micheli, Heinz Riener, Siang-Yun Lee

Adiabatic quantum-flux parametron (AQFP) is an energy-efficient superconducting technology. Buffer and splitter (B/S) cells must be inserted to an AQFP circuit to meet the technology-imposed constraints on path balancing and fanout branching. These cells a ...

ACM2022

A Fundamental Limit of Distributed Hypothesis Testing Under Memoryless Quantization

Ali H. Sayed, Emre Telatar, Mert Kayaalp, Yunus Inan

We consider a distributed binary hypothesis testing setup where multiple nodes send quantized information to a central processor, which is oblivious to the nodes’ statistics. We study the regime where the type-II error decays exponentially and the type-I e ...

2021

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.

Algorithme du simplexe

Near-Zero Parasitic Shift Flexure Pivots Based on Coupled n-RRR Planar Parallel Mechanisms

Primal-Dual Contextual Bayesian Optimization for Control System Online Optimization with Time-Average Constraints

A Proximal-Point Lagrangian-Based Parallelizable Nonconvex Solver for Bilinear Model Predictive Control

Fully solvable finite simplex lattices with open boundaries in arbitrary dimensions

Efficient and Accurate Handling of Periodic Flows in Time-Sensitive Networks

A deep learning method for the trajectory reconstruction of cosmic rays with the DAMPE mission

Zero Parasitic Shift Pivoting Kinematic Structures Based On Coupled N-RRR Planar Parallel Mechanims For Flexure Pivot Design

Beyond Local Optimality of Buffer and Splitter Insertion for AQFP Circuits

A prescriptive Dirichlet power allocation policy with deep reinforcement learning

A Fundamental Limit of Distributed Hypothesis Testing Under Memoryless Quantization

Graph Chatbot

Chattez avec Graph Search

Near-Zero Parasitic Shift Flexure Pivots Based on Coupled n-RRR Planar Parallel Mechanisms

A Proximal-Point Lagrangian-Based Parallelizable Nonconvex Solver for Bilinear Model Predictive Control

Fully solvable finite simplex lattices with open boundaries in arbitrary dimensions

Efficient and Accurate Handling of Periodic Flows in Time-Sensitive Networks

Primal-Dual Contextual Bayesian Optimization for Control System Online Optimization with Time-Average Constraints

A Fundamental Limit of Distributed Hypothesis Testing Under Memoryless Quantization

Zero Parasitic Shift Pivoting Kinematic Structures Based On Coupled N-RRR Planar Parallel Mechanims For Flexure Pivot Design

Beyond Local Optimality of Buffer and Splitter Insertion for AQFP Circuits

A prescriptive Dirichlet power allocation policy with deep reinforcement learning

A deep learning method for the trajectory reconstruction of cosmic rays with the DAMPE mission