glorian

[1]	Gael Glorian, Adrien Debesson, Sylvain Yvon-Paliot, and Laurent Simon. Génération de donjons à l'aide de la programmation par contraintes. In Seizièmes Journées Francophones de Programmation par Contraintes, JFPC 2021, Nice, France, 22 au 24 juin, 2021, Actes, 2021. [ bib ]
[2]	Gaël Glorian, Adrien Debesson, Sylvain Yvon-Paliot, and Laurent Simon. The dungeon variations problem using constraint programming. In Laurent D. Michel, editor, 27th International Conference on Principles and Practice of Constraint Programming, CP 2021, Montpellier, France (Virtual Conference), October 25-29, 2021, volume 210 of LIPIcs, pages 27:1--27:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021. [ bib \| DOI \| http ]
[3]	Gael Glorian, Jean-Marie Lagniez, and Christophe Lecoutre. NACRE - A nogood and clause reasoning engine. In Elvira Albert and Laura Kovács, editors, LPAR 2020: 23rd International Conference on Logic for Programming, Artificial Intelligence and Reasoning, Alicante, Spain, May 22-27, 2020, volume 73 of EPiC Series in Computing, pages 249--259. EasyChair, 2020. [ bib \| http ]
[4]	Gael Glorian. Hybridation de techniques d'apprentissage de clauses en programmation par contraintes. Theses, Université d'Artois, December 2019. [ bib \| http \| .pdf ] Keywords: constraint programming ; SAT ; clauses ; nogoods ; hybridization ; programmation par contraintes ; SAT ; clauses ; nogoods ; hybridation
[5]	Gael Glorian, Jean-Marie Lagniez, Valentin Montmirail, and Michael Sioutis. Une approche sat incrémentale pour raisonner efficacement sur les réseaux de contraintes qualitatives. In Quizièmes journées Francophones de Programmation par Contraintes, JFPC 2019, Albi, France, 10 au 13 juin, 2019, Actes, volume 15, pages 67--76. AFPC, 2019. [ bib ]
[6]	Gael Glorian. Nacre. In Christophe Lecoutre and Olivier Roussel, editors, Proceedings of the 2018 XCSP3 Competition, pages 85--85, 2019. [ bib \| http ]
[7]	Gilles Audemard, Gael Glorian, Jean-Marie Lagniez, Valentin Montmirail, and Nicolas Szczepanski. pfactory: A generic library for designing parallel solvers. In Hans Weghorn, editor, the 16th International Conference on Applied Computing, AC'19, pages 89--96, 2019. [ bib ]
[8]	Gael Glorian, Jean-Marie Lagniez, Valentin Montmirail, and Nicolas Szczepanski. An incremental sat-based approach to the graph colouring problem. In Thomas Schiex and Simon de Givry, editors, Principles and Practice of Constraint Programming - 25th International Conference, CP 2019, Stamford, CT, USA, September 30 - October 4, 2019, Proceedings, volume 11802 of Lecture Notes in Computer Science, pages 213--231. Springer, 2019. [ bib \| DOI \| http ]
[9]	Gael Glorian, Jean-Marie Lagniez, Valentin Montmirail, and Michael Sioutis. An incremental sat-based approach to reason efficiently on qualitative constraint networks. In John N. Hooker, editor, Principles and Practice of Constraint Programming - 24th International Conference, CP 2018, Lille, France, August 27-31, 2018, Proceedings, volume 11008 of Lecture Notes in Computer Science, pages 160--178. Springer, 2018. [ bib \| DOI \| http ]
[10]	Gael Glorian, Frédéric Boussemart, Jean-Marie Lagniez, Christophe Lecoutre, and Bertrand Mazure. Combinaison de nogoods extraits au redémarrage. In Treizièmes journées Francophones de Programmation par Contraintes, JFPC 2017, Montreuil-sur-mer, France, 13 au 15 juin, 2017, Actes, volume 13, pages 55--64. AFPC, 2017. [ bib ]
[11]	Gael Glorian, Frédéric Boussemart, Jean-Marie Lagniez, Christophe Lecoutre, and Bertrand Mazure. Combining nogoods in restart-based search. In J. Christopher Beck, editor, Principles and Practice of Constraint Programming - 23rd International Conference, CP 2017, Melbourne, VIC, Australia, August 28 - September 1, 2017, Proceedings, volume 10416 of Lecture Notes in Computer Science, pages 129--138. Springer, 2017. [ bib \| DOI ]

This file was generated by bibtex2html 1.99.