default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDGaël Glorian
Person information
- affiliation: LaBRI, Bordeaux, Nouvelle-Aquitaine, France
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[c9]Guillaume Perez, Steve Malalel, Gael Glorian
, Victor Jung, Alexandre Papadopoulos, Marie Pelleau, Wijnand Suijlen, Jean-Charles Régin, Arnaud Lallouet:
Generalized Confidence Constraints. AAAI 2023: 4078-4086- [c8]Guillaume Perez, Gaël Glorian, Wijnand Suijlen, Arnaud Lallouet:
Distribution Optimization in Constraint Programming. CP 2023: 29:1-29:19 - [c7]Guillaume Perez, Gaël Glorian, Wijnand Suijlen, Arnaud Lallouet:
A Constraint Programming Model for Scheduling the Unloading of Trains in Ports. ICTAI 2023: 693-699 - [i1]Guillaume Perez, Gael Glorian, Wijnand Suijlen, Arnaud Lallouet:
A Constraint Programming Model for Scheduling the Unloading of Trains in Ports: Extended. CoRR abs/2312.13682 (2023) - 2022
- [c6]Thomas Fournier, Arnaud Lallouet, Télio Cropsal, Gaël Glorian, Alexandre Papadopoulos, Antoine Petitet, Guillaume Perez, Suruthy Sekar, Wijnand Suijlen:
A Deep Reinforcement Learning Heuristic for SAT based on Antagonist Graph Neural Networks. ICTAI 2022: 1218-1222 - 2021
- [c5]Gaël Glorian, Adrien Debesson, Sylvain Yvon-Paliot, Laurent Simon:
The Dungeon Variations Problem Using Constraint Programming. CP 2021: 27:1-27:16 - 2020
- [c4]Gael Glorian, Jean-Marie Lagniez, Christophe Lecoutre:
NACRE - A Nogood And Clause Reasoning Engine. LPAR 2020: 249-259
2010 – 2019
- 2019
- [b1]Gael Glorian:
Hybridation de techniques d'apprentissage de clauses en programmation par contraintes. (Hybridization of clause learning techniques in constraint programming). Artois University, Arras, France, 2019 - [c3]Gael Glorian, Jean-Marie Lagniez, Valentin Montmirail, Nicolas Szczepanski:
An Incremental SAT-Based Approach to the Graph Colouring Problem. CP 2019: 213-231 - 2018
- [c2]Gael Glorian, Jean-Marie Lagniez, Valentin Montmirail, Michael Sioutis:
An Incremental SAT-Based Approach to Reason Efficiently on Qualitative Constraint Networks. CP 2018: 160-178 - 2017
- [c1]Gael Glorian, Frédéric Boussemart, Jean-Marie Lagniez, Christophe Lecoutre, Bertrand Mazure:
Combining Nogoods in Restart-Based Search. CP 2017: 129-138
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-05-31 18:42 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
