From post

копировать удалить добавить публикацию в буфер
Запись сообщества
посмотреть историю данной записи
URL
DOI
BibTeX
EndNote
APA
Chicago
DIN 1505
Harvard
MSOffice XML

An Incremental SAT-Based Approach to the Graph Colouring Problem.

G. Glorian, J. Lagniez, V. Montmirail, и N. Szczepanski. CP, том 11802 из Lecture Notes in Computer Science, стр. 213-231. Springer, (2019)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.

Gaël Ecorchard

Gaël Sauvanet

Engelbert Wilhelm Gaelings

Gaël Hammer

Gaël Kaneko

Другие публикации лиц с тем же именем

Hybridation de techniques d'apprentissage de clauses en programmation par contraintes. (Hybridization of clause learning techniques in constraint programming).G. Glorian. Artois University, Arras, France, (2019)A Deep Reinforcement Learning Heuristic for SAT based on Antagonist Graph Neural Networks.T. Fournier, A. Lallouet, T. Cropsal, G. Glorian, A. Papadopoulos, A. Petitet, G. Perez, S. Sekar, и W. Suijlen. ICTAI, стр. 1218-1222. IEEE, (2022)Distribution Optimization in Constraint Programming.G. Perez, G. Glorian, W. Suijlen, и A. Lallouet. CP, том 280 из LIPIcs, стр. 29:1-29:19. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)The Dungeon Variations Problem Using Constraint Programming.G. Glorian, A. Debesson, S. Yvon-Paliot, и L. Simon. CP, том 210 из LIPIcs, стр. 27:1-27:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)Generalized Confidence Constraints.G. Perez, S. Malalel, G. Glorian, V. Jung, A. Papadopoulos, M. Pelleau, W. Suijlen, J. Régin, и A. Lallouet. AAAI, стр. 4078-4086. AAAI Press, (2023)Combining Nogoods in Restart-Based Search.G. Glorian, F. Boussemart, J. Lagniez, C. Lecoutre, и B. Mazure. CP, том 10416 из Lecture Notes in Computer Science, стр. 129-138. Springer, (2017)An Incremental SAT-Based Approach to the Graph Colouring Problem.G. Glorian, J. Lagniez, V. Montmirail, и N. Szczepanski. CP, том 11802 из Lecture Notes in Computer Science, стр. 213-231. Springer, (2019)A Constraint Programming Model for Scheduling the Unloading of Trains in Ports.G. Perez, G. Glorian, W. Suijlen, и A. Lallouet. ICTAI, стр. 693-699. IEEE, (2023)NACRE - A Nogood And Clause Reasoning Engine.G. Glorian, J. Lagniez, и C. Lecoutre. LPAR, том 73 из EPiC Series in Computing, стр. 249-259. EasyChair, (2020)An Incremental SAT-Based Approach to Reason Efficiently on Qualitative Constraint Networks.G. Glorian, J. Lagniez, V. Montmirail, и M. Sioutis. CP, том 11008 из Lecture Notes in Computer Science, стр. 160-178. Springer, (2018)

BibSonomy

Disambiguation