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.
Optimization is important in science and engineering as a way of finding ”optimal” situations, designs or operating conditions. Optimization is typically performed on the basis of a mathematical model of the process under investigation. In practice, optimi ...
Time-optimal path following considers the problem of moving along a predetermined geometric path in minimum time. In the case of a robotic manipulator with simplified constraints, a convex reformulation of this optimal control problem has been derived prev ...
Institute of Electrical and Electronics Engineers2013
The convex ℓ1-regularized logdet divergence criterion has been shown to produce theoretically consistent graph learning. However, this objective function is challenging since the ℓ1-regularization is nonsmooth, the logdet objective is n ...
FK866 (also named APO866 or WK175) is a potent NAMPT inhibitor being evaluated (Phase II) as a potential anticancer drug. The preparation of the C-iminoribofuranoside analog (2E)-N-[4-(1-benzoylpiperidin-4-yl)butyl]-3-{3-[(2S,3S,4R,5R)-3,4-dihydroxy-5-(hyd ...
Substitutability and interchangeability in constraint satisfaction problems (CSPs) have been used as a basis for search heuristics, solution adaptation and abstraction techniques. In this paper, we consider how the same concepts can be extended to soft con ...
We propose a working set based approximate subgradient descent algorithm to minimize the margin-sensitive hinge loss arising from the soft constraints in max-margin learning frameworks, such as the structured SVM. We focus on the setting of general graphic ...
The convex l(1)-regularized log det divergence criterion has been shown to produce theoretically consistent graph learning. However, this objective function is challenging since the l(1)-regularization is nonsmooth, the log det objective is not globally Li ...
This work proposes a strategy to adjust the combination weights of an adaptive network in order to attain both faster convergence during the transient phase and lower mean-square-error during the steady-state phase. Optimal combination weights are designed ...
This paper deals with compatible component selection problems, where the goal is to find combinations of components satisfying design constraints given a product structure, component alternatives available in design catalogue for each subsystem of the prod ...
In this paper, a direct data-driven approach is proposed to tune fixed-order controllers for unknown stable LTI plants in a mixed-sensitivity loop-shaping problem. The method requires a single set of input-output samples and it is based on simple convex op ...
