Zobrazeno 1 - 4
of 4
pro vyhledávání: '"Antuori, Valentin"'
Autor:
Antuori, Valentin, Richoux, Florian
Decision-making problems can be modeled as combinatorial optimization problems with Constraint Programming formalisms such as Constrained Optimization Problems. However, few Constraint Programming formalisms can deal with both optimization and uncert
Externí odkaz:
http://arxiv.org/abs/1901.00942
Publikováno v:
27th International Conference on Principles and Practice of constraint Programming (CP 2021)
27th International Conference on Principles and Practice of Constraint Programming
27th International Conference on Principles and Practice of Constraint Programming, Oct 2021, Montpellier, France. ⟨10.4230/LIPIcs.CP.2021.13⟩
27th International Conference on Principles and Practice of Constraint Programming
27th International Conference on Principles and Practice of Constraint Programming, Oct 2021, Montpellier, France. ⟨10.4230/LIPIcs.CP.2021.13⟩
In this paper, we highlight an intriguing connection between the cryptographic attacks on Enigma’s code and local consistency reasoning in constraint programming. The coding challenge proposed to the students during the 2020 ACP summer school, to b
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::44cd44e68e0194f6a4edaff35184a490
https://hal.laas.fr/hal-03454134/document
https://hal.laas.fr/hal-03454134/document
Publikováno v:
27th International Conference on Principles and Practice of Constraint Programming (CP 2021).
International Conference on Principles and Practice of Constraint Programming
International Conference on Principles and Practice of Constraint Programming, Oct 2021, Montpellier (on line), France. ⟨10.4230/LIPIcs.CP.2021.14⟩
International Conference on Principles and Practice of Constraint Programming
International Conference on Principles and Practice of Constraint Programming, Oct 2021, Montpellier (on line), France. ⟨10.4230/LIPIcs.CP.2021.14⟩
Many state-of-the-art methods for combinatorial games rely on Monte Carlo Tree Search (MCTS) method, coupled with machine learning techniques, and these techniques have also recently been applied to combinatorial optimization. In this paper, we propo
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::8931061f0c8816b9e8b0efe210bb8bd8
https://hal.laas.fr/hal-03372005/document
https://hal.laas.fr/hal-03372005/document
Publikováno v:
Rencontres des Jeunes Chercheurs en Intelligence Artificielle (RJCIA'21) Plate-Forme Intelligence Artificielle (PFIA'21)
Rencontres des Jeunes Chercheurs en Intelligence Artificielle (RJCIA'21) Plate-Forme Intelligence Artificielle (PFIA'21), Jul 2021, Bordeaux, France. pp.7-13
Rencontres des Jeunes Chercheurs en Intelligence Artificielle (RJCIA'21) Plate-Forme Intelligence Artificielle (PFIA'21), Jul 2021, Bordeaux, France. pp.7-13
National audience; La recherche arborescente Monte-Carlo (MCTS) connaît un développement important pour la résolution de problèmes d'optimisation combinatoire, en particulier, lorsque les mécanismes d'inférence ne passent pas à l'échelle, ou
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::13eb85401c614691f58f2a84357cfb41
https://hal.science/hal-03298740
https://hal.science/hal-03298740