Zobrazeno 1 - 10
of 200
pro vyhledávání: '"Christophe Lecoutre"'
Publikováno v:
Journal of Computer Information Systems. :1-21
Publikováno v:
Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence.
In constraint satisfaction problems, the variable ordering heuristic takes a central place by selecting the variables to branch on during backtrack search. As many hand-crafted branching heuristics have been proposed in the literature, a key issue is
Publikováno v:
Constraints Journal (Constraints)
Constraints Journal (Constraints), 2020, pp.1-23
Constraints Journal (Constraints), 2020, pp.1-23
International audience; In this paper, we present a summary of XCSP3, together with its ecosystem. XCSP3 is a format used to build integrated representations of combinatorial constrained problems. Interestingly, XCSP3 preserves the structure of model
Autor:
Christophe Lecoutre, Laetitia Jourdan, Nicolas Szczepanski, Gilles Audemard, Nadarajen Veerapen, Lucien Mousin
Publikováno v:
GECCO '21: Genetic and Evolutionary Computation Conference
GECCO '21: Genetic and Evolutionary Computation Conference, Jul 2021, Lille France, France. pp.723-731, ⟨10.1145/3449639.3459310⟩
GECCO
GECCO '21: Genetic and Evolutionary Computation Conference, Jul 2021, Lille France, France. pp.723-731, ⟨10.1145/3449639.3459310⟩
GECCO
In the domain of partial classification, recent studies about multiobjective local search (MOLS) have led to new algorithms offering high performance, particularly when the data are imbalanced. In the presence of such data, the class distribution is
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::f4f85cbcdd99e8ef506581af92b22a5b
https://hal.archives-ouvertes.fr/hal-03281930
https://hal.archives-ouvertes.fr/hal-03281930
Publikováno v:
LPAR
23rd International Conference on Logic for Programming, Artificial Intelligence and Reasoning (LPAR'20)
23rd International Conference on Logic for Programming, Artificial Intelligence and Reasoning (LPAR'20), 2020, Alicante, Spain. pp.249-259
23rd International Conference on Logic for Programming, Artificial Intelligence and Reasoning (LPAR'20)
23rd International Conference on Logic for Programming, Artificial Intelligence and Reasoning (LPAR'20), 2020, Alicante, Spain. pp.249-259
NACRE, for Nogood And Clause Reasoning Engine, is a constraint solver written in C++. It is based on a modular architecture designed to work with generic constraints while implementing several state-of-the-art search methods and heuristics. Interesti
Publikováno v:
2019 IEEE 31st International Conference on Tools with Artificial Intelligence (ICTAI)
ICTAI 2019: IEEE 31st International Conference on Tools with Artificial Intelligence
ICTAI 2019: IEEE 31st International Conference on Tools with Artificial Intelligence, Nov 2019, Portland, United States. ⟨10.1109/ICTAI.2019.00019⟩
ICTAI
ICTAI 2019: IEEE 31st International Conference on Tools with Artificial Intelligence
ICTAI 2019: IEEE 31st International Conference on Tools with Artificial Intelligence, Nov 2019, Portland, United States. ⟨10.1109/ICTAI.2019.00019⟩
ICTAI
International audience; Backtracking search is a complete approach that is traditionally used to solve instances modeled as constraint satisfaction problems. The space explored during search depends dramatically on the order that variables are instan
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::900e45c842e84f4d8e239bfa280fe285
https://hal.archives-ouvertes.fr/hal-02414832
https://hal.archives-ouvertes.fr/hal-02414832
Publikováno v:
15es Journées Francophones de Programmation par Contraintes – JFPC 2019
15es Journées Francophones de Programmation par Contraintes – JFPC 2019, Jun 2019, Albi, France
HAL
15es Journées Francophones de Programmation par Contraintes – JFPC 2019, Jun 2019, Albi, France
HAL
International audience; L'automatisation de la configuration des solveurs a reçu une grande attention ces dernières années notam-ment pour la capacité à ajuster ses différents paramètres selon l'instance à résoudre. De plus, cette automatisa
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::ec5a983c4767c4a8ce2b1b67124ba2a8
https://hal.archives-ouvertes.fr/hal-02414288/document
https://hal.archives-ouvertes.fr/hal-02414288/document
Publikováno v:
Integration of Constraint Programming, Artificial Intelligence, and Operations Research ISBN: 9783030192112
CPAIOR
CPAIOR
Multi-Valued Decision Diagrams (MDDs), and more generally Multi-Valued Variable Diagrams (MVDs), are instrumental in modeling constrained combinatorial problems. This has led to a number of algorithms for filtering constraints such as mddc, MDD4R and
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::74cdfbf281dceab6ab6511b5b7e35d92
https://doi.org/10.1007/978-3-030-19212-9_39
https://doi.org/10.1007/978-3-030-19212-9_39
Publikováno v:
IJCAI
Multi-Valued Decision Diagrams (MDDs) are instrumental in modeling combinatorial problems with Constraint Programming.In this paper, we propose a related data structure called sMDD (semi-MDD) where the central layer of the diagrams is non-determinist
Publikováno v:
ICTAI
DIAL
DIAL
Reifying a constraint c consists in associating a Boolean variable b with c such that c is satisfied if and only if b is true, which can be denoted by c^{reif}: c b. Reification is useful for logically combining constraints and counting how many reif