Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.

An Interval Constraint Programming Approach for Quasi Capture Tube Validation

Autor: Bedouhene, Abderahmane, Neveu, Bertrand, Trombettoni, Gilles, Jaulin, Luc, Le Menec, Stéphane

Publikováno v: Acta Chimica Slovenica
27th International Conference on Principles and Practice of Constraint Programming (CP 2021)
27th International Conference on Principles and Practice of Constraint Programming (CP 2021), Oct 2021, Montpellier, France

Proving that the state of a controlled nonlinear system always stays inside a time moving bubble (or capture tube) amounts to proving the inconsistency of a set of nonlinear inequalities in the time-state space. In practice however, even with a good

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::2521e6e197933d265b8ae7a99e4fb499
https://hal-enpc.archives-ouvertes.fr/hal-03412799

Reliable Bounds for Convex Relaxation in Interval Global Optimization Codes.

Autor: Messine, Frédéric, Trombettoni, Gilles

Publikováno v: AIP Conference Proceedings; 2019, Vol. 2070 Issue 1, p020050-1-020050-4, 4p

An Interval Branch and Bound Algorithm for Parameter Estimation

Autor: Neveu, Bertrand, De La Gorce, Martin, Trombettoni, Gilles

Publikováno v: 13th Globla Optimization Workshop
GOW: Globla Optimization Workshop
GOW: Globla Optimization Workshop, Sep 2016, Braga, Portugal

International audience; The parameter estimation problem is a widespread and challenging problem in engineering sciences consisting in computing the parameters of a parametric model that fit observed data. The computer vision community has proposed t

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::ed714ac13a4f1768484b8cc8ad74ae8c
https://hal-enpc.archives-ouvertes.fr/hal-01376601/file/gow16.pdf

Choix de noeud dans un algorithme de Branch and Bound sur intervalles

Autor: Neveu, Bertrand, Trombettoni, Gilles, Araya, Ignacio

Publikováno v: 11èmes Journées Francophones de Programmation par Contraintes (JFPC 2015)
11èmes Journées Francophones de Programmation par Contraintes (JFPC 2015), Jun 2015, Bordeaux, France

International audience; Nous présentons dans cet article de nouvelles stra-tégies de choix de noeud dans un algorithme de Branch and Bound sur intervalles pour l'optimisation globale sous contraintes. La stratégie standard en meilleur d'abord choi

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::c26aef5365d069a729fbb586e326c5ac
https://hal-enpc.archives-ouvertes.fr/hal-01230883/file/jfpctasfr1.pdf