Zobrazeno 1 - 8
of 8
pro vyhledávání: '"szczepanski, nicolas"'
Boosted trees is a dominant ML model, exhibiting high accuracy. However, boosted trees are hardly intelligible, and this is a problem whenever they are used in safety-critical applications. Indeed, in such a context, rigorous explanations of the pred
Externí odkaz:
http://arxiv.org/abs/2209.07740
In this document, we introduce PyCSP$3$, a Python library that allows us to write models of combinatorial constrained problems in a declarative manner. Currently, with PyCSP$3$, you can write models of constraint satisfaction and optimization problem
Externí odkaz:
http://arxiv.org/abs/2009.00326
Autor:
Szczepanski, Nicolas
La thèse porte sur la résolution des problèmes de satisfaisabilité booléenne (SAT) dans un cadre massivement parallèle. Le problème SAT est largement utilisé pour résoudre des problèmes combinatoires de première importance comme la vérifi
Externí odkaz:
http://www.theses.fr/2017ARTO0403/document
Publikováno v:
The 25th International Conference on Principles and Practice of Constraint Programming
The 25th International Conference on Principles and Practice of Constraint Programming, Simon de Givry and Thomas Schiex, In press
The 25th International Conference on Principles and Practice of Constraint Programming, Simon de Givry and Thomas Schiex, In press
International audience
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::6c9fb14365451b6eb18a71f1336efb5a
https://hal.univ-cotedazur.fr/hal-02271397
https://hal.univ-cotedazur.fr/hal-02271397
Autor:
Szczepanski, Nicolas
Publikováno v:
Calcul parallèle, distribué et partagé [cs.DC]. Université d'Artois, 2017. Français. ⟨NNT : ⟩
This thesis deals with propositional satisfiability (SAT) in a massively parallel setting. The SAT problem is widely used for solving several combinatorial problems (e.g. formal verification of hardware and software, bioinformatics, cryptography, pla
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od______4254::bf13a24587ffc7721278e56f65830adf
https://hal.science/tel-02979325/file/SATenParalleleSzczepanskiNicolas.pdf
https://hal.science/tel-02979325/file/SATenParalleleSzczepanskiNicolas.pdf
Publikováno v:
22nd International Conference on Principles and Practice of Constraint Programming (CP'16)
22nd International Conference on Principles and Practice of Constraint Programming (CP'16), 2016, Toulouse, France. pp.30-48
22nd International Conference on Principles and Practice of Constraint Programming (CP'16), 2016, Toulouse, France. pp.30-48
International audience
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::6eff3673eda455b092594a0618a22859
https://hal-univ-artois.archives-ouvertes.fr/hal-03299478
https://hal-univ-artois.archives-ouvertes.fr/hal-03299478
Publikováno v:
11èmes Journées Francophones de Programmation par Contraintes (JFPC'15)
11èmes Journées Francophones de Programmation par Contraintes (JFPC'15), 2015, Bordeaux, France
11èmes Journées Francophones de Programmation par Contraintes (JFPC'15), 2015, Bordeaux, France
National audience
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::64db45421076e160ceb8c5d91efa457b
https://hal-univ-artois.archives-ouvertes.fr/hal-03300782
https://hal-univ-artois.archives-ouvertes.fr/hal-03300782
Publikováno v:
Principles & Practice of Constraint Programming: 22nd International Conference, CP 2016, Toulouse, France, September 5-9, 2016, Proceedings; 2016, p30-48, 19p
