default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAlexandre Papadopoulos
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[c13]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- 2022
- [c12]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
2010 – 2019
- 2017
- [c11]François Pachet, Alexandre Papadopoulos, Pierre Roy:
Sampling Variations of Sequences for Structured Music Generation. ISMIR 2017: 167-173 - [i1]Pierre Roy, Alexandre Papadopoulos, François Pachet:
Sampling Variations of Lead Sheets. CoRR abs/1703.00760 (2017) - 2016
- [c10]Alexandre Papadopoulos, Pierre Roy, François Pachet:
Assisted Lead Sheet Composition Using FlowComposer. CP 2016: 769-785 - [c9]Pierre Roy, Guillaume Perez, Jean-Charles Régin, Alexandre Papadopoulos, François Pachet, Marco Marchini:
Enforcing Structure on Temporal Sequences: The Allen Constraint. CP 2016: 786-801 - 2015
- [c8]Alexandre Papadopoulos, François Pachet, Pierre Roy, Jason Sakellariou:
Exact Sampling for Regular and Markov Constraints with Belief Propagation. CP 2015: 341-350 - [c7]François Pachet, Pierre Roy, Alexandre Papadopoulos, Jason Sakellariou:
Generating 1/f Noise Sequences as Constraint Satisfaction: The Voss Constraint. IJCAI 2015: 2482-2488 - [c6]Alexandre Papadopoulos, Pierre Roy, Jean-Charles Régin, François Pachet:
Generating all Possible Palindromes from Ngram Corpora. IJCAI 2015: 2489-2495 - 2014
- [c5]Alexandre Papadopoulos, Pierre Roy, François Pachet:
Avoiding Plagiarism in Markov Sequence Generation. AAAI 2014: 2731-2737 - 2012
- [j1]Hadrien Cambazard, Emmanuel Hebrard, Barry O'Sullivan, Alexandre Papadopoulos:
Local search and constraint programming for the post enrolment-based course timetabling problem. Ann. Oper. Res. 194(1): 111-135 (2012) - [c4]Alexandre Papadopoulos, Barry O'Sullivan:
Compiling Domain Consequences. ICTAI 2012: 618-625 - 2011
- [b1]Alexandre Papadopoulos:
Computing explanations for interactive constraint-based systems. University College Cork, Republic of Ireland, 2011
2000 – 2009
- 2009
- [c3]Alexandre Papadopoulos, Barry O'Sullivan:
Compiling All Possible Conflicts of a CSP. CP 2009: 639-653 - 2008
- [c2]Alexandre Papadopoulos, Barry O'Sullivan:
Relaxations for Compiled Over-Constrained Problems. CP 2008: 433-447 - 2007
- [c1]Barry O'Sullivan, Alexandre Papadopoulos, Boi Faltings, Pearl Pu:
Representative Explanations for Over-Constrained Problems. AAAI 2007: 323-328
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 2025-01-09 13:28 CET 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:
