Zobrazeno 1 - 10
of 204
pro vyhledávání: '"optimalité"'
Autor:
Parag, Amit
Publikováno v:
Automatic. INSA TOULOUSE, 2023. English. ⟨NNT : ⟩
National audience; Deep reinforcement learning uses simulators as abstract oracles to interact with the environment. In continuous domains of multi-body robotic systems, differentiable simulators have recently been proposed, still, they are yet under
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od______4074::1a8fc32150cbfbddcec235b39a2b3fc6
https://hal.laas.fr/tel-04121962
https://hal.laas.fr/tel-04121962
Autor:
Dufossé, Paul
Publikováno v:
Optimization and Control [math.OC]. Institut Polytechnique de Paris, 2022. English. ⟨NNT : ⟩
This thesis proposes several contributions to the problem of optimizing a nonlinear function of several variables in a continuous search space in the presence of constraints. The approach is called black box in that the considered algorithms have onl
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od_______165::ebab91e3a061d8c3d164654451c301cf
https://hal.science/tel-03949333
https://hal.science/tel-03949333
Autor:
El Hamdi, Fatima
Nous présentons un argument en faveur de la racine vocalique en tachelhit, une racine qui contient une (des) voyelle(s). Sur la base de la morphologie de l’état des noms : l’état libre et l’état d’annexion, nous distinguerons entre voyell
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=openedition_::6fe1612890d1f0b7a7cb302e1340b5f9
http://journals.openedition.org/asinag/508
http://journals.openedition.org/asinag/508
Publikováno v:
JFPC 2022
JFPC 2022, Jun 2022, Saint-Etienne, France
JFPC 2022, Jun 2022, Saint-Etienne, France
International audience; Dans ce papier, on présente un outil, MS-Builder, qui génère des certificats pour le problème Max-SAT, en appelant itérativement un oracle SAT pour générer une réfutation par résolution de la formule qui est ensuite r
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::56b43a08766f6d586a9bf90ad438265b
https://hal-amu.archives-ouvertes.fr/hal-03737729
https://hal-amu.archives-ouvertes.fr/hal-03737729
Autor:
Verzelen, Nicolas
6.1 Parcours scientifiqueMa thèse de doctorat [T1] portait sur l’ inférence de graphes dans les modèles graphiques gaussiens. Puisque l’estimation de ces graphes peut se reformuler en termes de sélection de variables dans des modèles de rég
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od_______166::e5673e76f42f933ec1d4b6e08c5856ba
https://theses.hal.science/tel-03885196
https://theses.hal.science/tel-03885196
Autor:
Hadiji, Hédi
Publikováno v:
Statistics [math.ST]. Université Paris-Saclay, 2020. English. ⟨NNT : 2020UPASM021⟩
The main topics adressed in this thesis lie in the general domain of sequential learning, and in particular stochastic multi-armed bandits. The thesis is divided into four chapters and an introduction. In the first part of the main body of the thesis
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od_______212::5fd4861be3e79005608d891c5644a38b
https://tel.archives-ouvertes.fr/tel-03117852/document
https://tel.archives-ouvertes.fr/tel-03117852/document
Autor:
Dai, Xiang
Publikováno v:
Automatic. CentraleSupélec, 2021. English. ⟨NNT : 2021CSUP0007⟩
Model Predictive Control (MPC) has attracted increasing interest over the last decades for its capability in delivering optimal control actions while satisfying constraints. However, the optimal solution of the resulting optimization problem is somet
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od______2755::ab421a3d2fb23e7ae9bc60aa0384b639
https://theses.hal.science/tel-03582589
https://theses.hal.science/tel-03582589
Publikováno v:
JFPDA 2021-Journées Francophones Planification, Décision et Apprentissage
JFPDA 2021-Journées Francophones Planification, Décision et Apprentissage, Jun 2021, Bordeaux (virtuel), France. pp.1-14
JFPDA 2021-Journées Francophones Planification, Décision et Apprentissage, Jun 2021, Bordeaux (virtuel), France. pp.1-14
Solving a 2-player zero-sum partially observable stochastic game (zs-POSG) typically relies on turning it into an extensive-form game, thus losing structural information contained in the original representation. We prevent such a loss by turning the
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::c403110f24a4701548897faaad9c46e9
https://inria.hal.science/hal-03523951/file/jfpda21.pdf
https://inria.hal.science/hal-03523951/file/jfpda21.pdf
Autor:
Kriouile, Saad
Publikováno v:
Networking and Internet Architecture [cs.NI]. Université Paris-Saclay, 2021. English. ⟨NNT : 2021UPASG022⟩
In this thesis, we investigate a general channel allocation problem where the number of channels is less than that of users. The aim is to find a policy that schedules the channels to a given subset of users at each time slot in such a way to minimiz
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::e10f167e03067be3d729c26c17b8b77e
https://tel.archives-ouvertes.fr/tel-03243493
https://tel.archives-ouvertes.fr/tel-03243493
Autor:
Bernis, Julien
The part 1 of this thesis focuses on a non autonomous Bolza problem in optimal control for which the Lagrangian L and the dynamics F are allowed to be discontinuous with respect to time on a set of full measure (with left and right limits everywhere)
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od_______166::b65a62c32092296ce4efb882b0eac599
https://theses.hal.science/tel-03599535
https://theses.hal.science/tel-03599535