no code implementations • 27 Mar 2024 • Dennis Gross, Helge Spieker, Arnaud Gotlieb, Ricardo Knoblauch
This research presents a method that utilizes explainability techniques to amplify the performance of machine learning (ML) models in forecasting the quality of milling processes, as demonstrated in this paper through a manufacturing use case.
no code implementations • 25 Mar 2024 • Nassim Belmecheri, Arnaud Gotlieb, Nadjib Lazaar, Helge Spieker
In this article, we introduce the Qualitative Explainable Graph (QXG), which is a unified symbolic and qualitative representation for scene understanding in urban mobility.
no code implementations • 24 Oct 2023 • Pierre Bernabé, Arnaud Gotlieb, Bruno Legeard, Dusica Marijan, Frank Olaf Sem-Jacobsen, Helge Spieker
In maritime traffic surveillance, detecting illegal activities, such as illegal fishing or transshipment of illicit products is a crucial task of the coastal administration.
1 code implementation • 24 Aug 2023 • Nassim Belmecheri, Arnaud Gotlieb, Nadjib Lazaar, Helge Spieker
The future of automated driving (AD) is rooted in the development of robust, fair and explainable artificial intelligence methods.
no code implementations • 30 Apr 2022 • Dusica Marijan, Arnaud Gotlieb
Machine learning has become prevalent across a wide variety of applications.
no code implementations • 23 Apr 2022 • Dusica Marijan, Arnaud Gotlieb
While such challenges can be varied and many, in this paper we focus on the challenges of achieving participative knowledge creation supported by active dialog between industry and academia and continuous commitment to joint problem solving.
no code implementations • 24 Feb 2022 • Mohit Kumar Ahuja, Arnaud Gotlieb, Helge Spieker
To discover faults in DL models, existing software testing methods have been adapted and refined accordingly.
no code implementations • 23 Nov 2021 • Mohamed-Bachir Belaid, Arnaud Gotlieb, Nadjib Lazaar
In this paper, we propose Learn&Optimize, a method to solve optimization problems with known objective function and unknown constraint network.
no code implementations • 4 Nov 2021 • Helge Spieker, Arnaud Gotlieb
Solving Constraint Optimization Problems (COPs) can be dramatically simplified by boundary estimation, that is, providing tight boundaries of cost functions.
no code implementations • 14 Jul 2020 • Mohit Kumar Ahuja, Mohamed-Bachir Belaid, Pierre Bernabé, Mathieu Collet, Arnaud Gotlieb, Chhagan Lal, Dusica Marijan, Sagar Sen, Aizaz Sharif, Helge Spieker
Trustworthiness is a central requirement for the acceptance and success of human-centered artificial intelligence (AI).
no code implementations • 20 Jun 2020 • Helge Spieker, Arnaud Gotlieb
Constraint Optimization Problems (COP) are often considered without sufficient knowledge on the boundaries of the objective variable to optimize.
no code implementations • 12 Feb 2019 • Morten Mossige, Arnaud Gotlieb, Helge Spieker, Hein Meling, Mats Carlsson
When testing industrial robots, it is common that the target machines need to share some common resources, e. g., costly hardware devices, and so there is a need to schedule test case execution on the target machines, accounting for these shared resources.
no code implementations • 14 Jan 2019 • Helge Spieker, Arnaud Gotlieb
However, testing the training routines requires running them and fully training a deep learning model can be resource-intensive, when using the full data set.
2 code implementations • 9 Nov 2018 • Helge Spieker, Arnaud Gotlieb, Dusica Marijan, Morten Mossige
Testing in Continuous Integration (CI) involves test case prioritization, selection, and execution at each cycle.
1 code implementation • 9 Nov 2018 • Arnaud Gotlieb, Dusica Marijan, Helge Spieker
Constraint Programming (CP) is a powerful declarative programming paradigm where inference and search are interleaved to find feasible and optimal solutions to various type of constraint systems.
no code implementations • 8 Nov 2018 • Helge Spieker, Arnaud Gotlieb, Morten Mossige
Multi-cycle assignment problems address scenarios where a series of general assignment problems has to be solved sequentially.
no code implementations • 1 Dec 2013 • Sébastien Bardin, Arnaud Gotlieb
However, effective reasoning over arrays is still rare in CP, as local reasoning is dramatically ill-conditioned for constraints over arrays.
no code implementations • 18 Aug 2013 • Roberto Bagnara, Matthieu Carlier, Roberta Gori, Arnaud Gotlieb
Floating-point computations are quickly finding their way in the design of safety- and mission-critical systems, despite the fact that designing floating-point algorithms is significantly more difficult than designing integer algorithms.