default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPatrice Boizumault
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c56]Djawad Bekkoucha, Abdelkader Ouali, Patrice Boizumault, Bruno Crémilleux:
Efficiently Mining Closed Interval Patterns with Constraint Programming. CPAIOR (1) 2024: 51-67- 2023
- [c55]Maksim Koptelov
, Albrecht Zimmermann, Patrice Boizumault, Ronan Bureau, Jean Luc Lamotte:
Explanations for Itemset Mining by Constraint Programming: A Case Study Using ChEMBL Data. IDA 2023: 208-221 - 2020
- [j17]Abdelkader Ouali, David Allouche, Simon de Givry, Samir Loudni, Yahia Lebbah, Lakhdar Loukil, Patrice Boizumault:
Variable neighborhood search for graphical model energy minimization. Artif. Intell. 278 (2020)
2010 – 2019
- 2019
- [c54]Willy Ugarte, Samir Loudni, Patrice Boizumault, Bruno Crémilleux, Alexandre Termier:
Compressing and Querying Skypattern Cubes. IEA/AIE 2019: 406-421 - 2017
- [j16]Willy Ugarte, Patrice Boizumault, Bruno Crémilleux, Alban Lepailleur, Samir Loudni, Marc Plantevit, Chedy Raïssi, Arnaud Soulet:
Skypattern mining: From pattern condensed representations to dynamic constraint satisfaction problems. Artif. Intell. 244: 48-69 (2017) - [j15]Amina Kemmar, Yahia Lebbah, Samir Loudni, Patrice Boizumault, Thierry Charnois:
Prefix-projection global constraint and top-k approach for sequential pattern mining. Constraints An Int. J. 22(2): 265-306 (2017) - [c53]Abdelkader Ouali, Albrecht Zimmermann, Samir Loudni, Yahia Lebbah, Bruno Crémilleux, Patrice Boizumault, Lakhdar Loukil:
Integer Linear Programming for Pattern Set Mining; with an Application to Tiling. PAKDD (2) 2017: 286-299 - 2016
- [j14]David Allouche, Christian Bessiere, Patrice Boizumault, Simon de Givry, Patricia Gutierrez, Jimmy H. M. Lee, Ka Lun Leung, Samir Loudni, Jean-Philippe Métivier, Thomas Schiex, Yi Wu:
Tractability-preserving transformations of global cost functions. Artif. Intell. 238: 166-189 (2016) - [j13]Amina Kemmar, Yahia Lebbah, Samir Loudni, Patrice Boizumault, Thierry Charnois:
Une contrainte globale pour l'extraction de motifs séquentiels. Rev. d'Intelligence Artif. 30(6): 675-703 (2016) - [c52]Nadjib Lazaar, Yahia Lebbah, Samir Loudni, Mehdi Maamar, Valentin Lemière, Christian Bessiere, Patrice Boizumault:
A Global Constraint for Closed Frequent Pattern Mining. CP 2016: 333-349 - [c51]Amina Kemmar, Samir Loudni, Yahia Lebbah, Patrice Boizumault, Thierry Charnois:
A Global Constraint for Mining Sequential Patterns with GAP Constraint. CPAIOR 2016: 198-215 - [c50]Abdelkader Ouali, Samir Loudni, Yahia Lebbah, Patrice Boizumault, Albrecht Zimmermann, Lakhdar Loukil:
Efficiently Finding Conceptual Clustering Models with Integer Linear Programming. IJCAI 2016: 647-654 - 2015
- [j12]Abdelkader Ouali, Samir Loudni, Lakhdar Loukil, Patrice Boizumault, Yahia Lebbah:
Replicated Parallel Strategies for Decomposition Guided VNS. Electron. Notes Discret. Math. 47: 93-100 (2015) - [j11]Willy Ugarte, Patrice Boizumault, Samir Loudni, Bruno Crémilleux, Alban Lepailleur:
Soft constraints for pattern mining. J. Intell. Inf. Syst. 44(2): 193-221 (2015) - [c49]Amina Kemmar, Samir Loudni, Yahia Lebbah, Patrice Boizumault, Thierry Charnois:
PREFIX-PROJECTION Global Constraint for Sequential Pattern Mining. CP 2015: 226-243 - [c48]Willy Ugarte, Patrice Boizumault, Samir Loudni, Bruno Crémilleux:
Modeling and Mining Optimal Patterns Using Dynamic CSP. ICTAI 2015: 33-40 - [i4]David Allouche, Christian Bessiere, Patrice Boizumault, Simon de Givry, Patricia Gutierrez, Jimmy H. M. Lee, Ka Lun Leung, Samir Loudni, Jean-Philippe Métivier, Thomas Schiex, Yi Wu:
Tractability and Decompositions of Global Cost Functions. CoRR abs/1502.02414 (2015) - [i3]Amina Kemmar, Samir Loudni, Yahia Lebbah, Patrice Boizumault, Thierry Charnois:
Prefix-Projection Global Constraint for Sequential Pattern Mining. CoRR abs/1504.07877 (2015) - [i2]Amina Kemmar, Samir Loudni, Yahia Lebbah, Patrice Boizumault, Thierry Charnois:
A global Constraint for mining Sequential Patterns with GAP constraint. CoRR abs/1511.08350 (2015) - 2014
- [c47]Willy Ugarte Rojas, Patrice Boizumault, Samir Loudni, Bruno Crémilleux, Alban Lepailleur:
Mining (Soft-) Skypatterns Using Dynamic CSP. CPAIOR 2014: 71-87 - [c46]Willy Ugarte, Patrice Boizumault, Samir Loudni, Bruno Crémilleux:
Computing Skypattern Cubes. ECAI 2014: 903-908 - [c45]Abdelkader Ouali, Samir Loudni, Lakhdar Loukil, Patrice Boizumault, Yahia Lebbah:
Cooperative Parallel Decomposition Guided VNS for Solving Weighted CSP. Hybrid Metaheuristics 2014: 100-114 - [c44]Amina Kemmar, Willy Ugarte, Samir Loudni, Thierry Charnois, Yahia Lebbah, Patrice Boizumault, Bruno Crémilleux:
Mining Relevant Sequence Patterns with CP-Based Framework. ICTAI 2014: 552-559 - [c43]Willy Ugarte, Patrice Boizumault, Samir Loudni, Bruno Crémilleux:
Computing Skypattern Cubes Using Relaxation. ICTAI 2014: 859-866 - 2013
- [j10]Mathieu Fontaine, Samir Loudni, Patrice Boizumault:
Exploiting Tree Decomposition for Guiding Neighborhoods Exploration for VNS. RAIRO Oper. Res. 47(2): 91-123 (2013) - [c42]Willy Ugarte, Patrice Boizumault, Samir Loudni, Bruno Crémilleux, Alban Lepailleur:
Mining (Soft-) Skypatterns Using Constraint Programming. EGC (best of volume) 2013: 105-136 - [c41]Willy Ugarte, Patrice Boizumault, Samir Loudni, Bruno Crémilleux, Alban Lepailleur:
Découverte des soft-skypatterns avec une approche PPC. EGC 2013: 217-228 - [c40]Samir Loudni, Mathieu Fontaine, Patrice Boizumault:
Intensification/Diversification in Decomposition Guided VNS. Hybrid Metaheuristics 2013: 22-36 - 2012
- [j9]Samir Loudni, Mathieu Fontaine, Patrice Boizumault:
Exploiting Separators for Guiding VNS. Electron. Notes Discret. Math. 39: 265-272 (2012) - [c39]David Allouche, Christian Bessiere, Patrice Boizumault, Simon de Givry, Patricia Gutierrez, Samir Loudni, Jean-Philippe Métivier, Thomas Schiex:
Filtering Decomposable Global Cost Functions. AAAI 2012: 407-413 - [c38]Willy Ugarte, Patrice Boizumault, Samir Loudni, Bruno Crémilleux:
Soft Threshold Constraints for Pattern Mining. Discovery Science 2012: 313-327 - [c37]Jean-Philippe Métivier, Patrice Boizumault, Bruno Crémilleux, Mehdi Khiari, Samir Loudni:
Constrained Clustering Using SAT. IDA 2012: 207-218 - [c36]Jean-Philippe Métivier, Patrice Boizumault, Bruno Crémilleux, Mehdi Khiari, Samir Loudni:
A constraint language for declarative pattern discovery. SAC 2012: 119-125 - 2011
- [c35]Jean-Philippe Métivier, Patrice Boizumault, Bruno Crémilleux, Mehdi Khiari, Samir Loudni:
A Constraint-Based Language for Declarative Pattern Discovery. ICDM Workshops 2011: 1112-1119 - [c34]Mathieu Fontaine, Samir Loudni, Patrice Boizumault:
Guiding VNS with Tree Decomposition. ICTAI 2011: 505-512 - [c33]Mehdi Khiari, Patrice Boizumault, Bruno Crémilleux:
A Generic Approach for Modeling and Mining n-ary Patterns. ISMIS 2011: 300-305 - [i1]Patrice Boizumault, Bruno Crémilleux, Mehdi Khiari, Samir Loudni, Jean-Philippe Métivier:
Discovering Knowledge using a Constraint-based Language. CoRR abs/1107.3407 (2011) - 2010
- [j8]Samir Loudni, Patrice Boizumault, Nicolas Levasseur:
Advanced generic neighborhood heuristics for VNS. Eng. Appl. Artif. Intell. 23(5): 736-764 (2010) - [c32]Mehdi Khiari, Patrice Boizumault, Bruno Crémilleux:
Constraint Programming for Mining n-ary Patterns. CP 2010: 552-567 - [c31]Mehdi Khiari, Patrice Boizumault, Bruno Crémilleux:
Combining Constraint Programming and Constraint-Based Mining for Pattern Discovery. EGC (best of volume) 2010: 85-103 - [c30]Mehdi Khiari, Patrice Boizumault, Bruno Crémilleux:
Allier CSPs et motifs locaux pour la découverte de motifs sous contraintes n-aires. EGC 2010: 199-210 - [c29]Mehdi Khiari, Patrice Boizumault, Bruno Crémilleux:
Combining CSP and Constraint-Based Mining for Pattern Discovery. ICCSA (2) 2010: 432-447
2000 – 2009
- 2009
- [c28]Jean-Philippe Métivier, Patrice Boizumault, Samir Loudni:
Solving Nurse Rostering Problems Using Soft Global Constraints. CP 2009: 73-87 - [c27]Jean-Philippe Métivier, Patrice Boizumault, Samir Loudni:
Softening Gcc and Regular with preferences. SAC 2009: 1392-1396 - 2008
- [j7]Samir Loudni, Patrice Boizumault:
Combining VNS with constraint programming for solving anytime optimization problems. Eur. J. Oper. Res. 191(3): 705-735 (2008) - [c26]Nicolas Levasseur, Patrice Boizumault, Samir Loudni:
Boosting VNS with Neighborhood Heuristics for Solving Constraint Optimization Problems. Hybrid Metaheuristics 2008: 131-145 - 2007
- [c25]Jean-Philippe Métivier, Patrice Boizumault, Samir Loudni:
All Different: Softening AllDifferent in Weighted CSPs. ICTAI (1) 2007: 223-230 - [c24]Nicolas Levasseur, Patrice Boizumault, Samir Loudni:
A Value Ordering Heuristic for Weighted CSP. ICTAI (1) 2007: 259-262 - 2006
- [j6]Samir Loudni, Patrice Boizumault, Philippe David:
On-line resources allocation for ATM networks with rerouting. Comput. Oper. Res. 33(10): 2891-2917 (2006) - 2003
- [j5]Patrice Boizumault, Narendra Jussien, Samir Ouis:
Explications k-relevantes pour la programmation par contraintes. Tech. Sci. Informatiques 22(1): 111-124 (2003) - [j4]Patrice Boizumault, Philippe David, Samir Loudni:
Réservation en ligne avec reroutage de demandes de connexion dans les réseaux ATM. Tech. Sci. Informatiques 22(1): 169-182 (2003) - [c23]Samir Ouis, Narendra Jussien, Patrice Boizumault:
k-relevant Explanations for Constraint Programming. FLAIRS 2003: 192-196 - [c22]Samir Loudni, Patrice Boizumault:
Solving Constraint Optimization Problems in Anytime Contexts. IJCAI 2003: 251-256 - [c21]Samir Ouis, Narendra Jussien, Patrice Boizumault:
Explications k-relevantes pour la programmation par contraintes. JFPLC 2003: 111-124 - [c20]Samir Loudni, Patrice Boizumault, Philippe David:
Réservation en ligne avec reroutage de demandes de connexion dans les réseaux ATM. JFPLC 2003: 169-182 - 2002
- [c19]Muriel Lauvergne, Philippe David, Patrice Boizumault:
Connections Reservation with Rerouting for ATM Networks: A Hybrid Approach with Constraints. CP 2002: 649-663 - [c18]Samir Ouis, Narendra Jussien, Patrice Boizumault:
COINS: a constraint-based interactive solving system. WLPE 2002: 31-46 - 2001
- [j3]Olivier Ridoux, Patrice Boizumault:
Typed Static Analysis: Application to the Groundness Analysis of Typed Prolog. J. Funct. Log. Program. 2001(4) (2001) - [j2]Patrice Boizumault, Philippe David, Housni Djellab:
Resource allocation in a mobile telephone network: A constructive repair algorithm. RAIRO Oper. Res. 35(2): 189-209 (2001) - [c17]Samir Loudni, Patrice Boizumault:
A New Hybrid Method for Solving Constraint Optimization Problems in Anytime Contexts. ICTAI 2001: 325-332 - 2000
- [c16]Narendra Jussien, Romuald Debruyne, Patrice Boizumault:
Maintaining Arc-Consistency within Dynamic Backtracking. CP 2000: 249-261
1990 – 1999
- 1999
- [c15]Olivier Ridoux, Patrice Boizumault, Frédéric Malésieux:
Typed Static Analysis: Application to Groundness Analysis of PROLOG and lambda-PROLOG. Fuji International Symposium on Functional and Logic Programming 1999: 267-283 - [c14]Frédéric Malésieux, Olivier Ridoux, Patrice Boizumault:
Analyse statique typée: application à l'analyse de clôtures de lambda-Prolog. JFPLC 1999: 55-72 - 1998
- [c13]Frédéric Malésieux, Olivier Ridoux, Patrice Boizumault:
Abstract Compilation of lambda-Prolog. IJCSLP 1998: 130-144 - [c12]Frédéric Malésieux, Olivier Ridoux, Patrice Boizumault:
Compilation abstraite de LambdaProlog. JFPLC 1998: 287- - 1997
- [c11]Narendra Jussien, Patrice Boizumault:
Stratégies en meilleur d'abord pour la relaxation de contraintes. JFPLC 1997: 149- - [c10]Narendra Jussien, Patrice Boizumault:
Best-First Search for Property Maintenance in Reactive Constraint Systems. ILPS 1997: 339-353 - 1996
- [j1]Patrice Boizumault, Yan Delon, Laurent Péridy:
Constraint Logic Programming for Examination Timetabling. J. Log. Program. 26(2): 217-233 (1996) - [c9]Narendra Jussien, Patrice Boizumault:
Maintien de déduction pour la relaxation de contraintes. JFPLC 1996: 239-254 - 1995
- [c8]Patrice Boizumault, Yan Delon, Laurent Péridy:
A CLP Approach for Examination Planning. Constraint Processing, Selected Papers 1995: 85-101 - [c7]Narendra Jussien, Patrice Boizumault:
Implementing Constraint Relaxation over Finite Domains Using Assumption-Based Truth Maintenance Systems. Over-Constrained Systems 1995: 265-280 - [c6]Christelle Guéret, Narendra Jussien, Patrice Boizumault, Christian Prins:
Building University Timetables Using Constraint Logic Programming. PATAT 1995: 130-145 - 1993
- [c5]Patrice Boizumault, Yan Delon, Laurent Péridy:
Solving a real life exams problem using CHIP. ILPS 1993: 661
1980 – 1989
- 1986
- [c4]Patrice Boizumault:
A Classical Implementation for Prolog-II. ESOP 1986: 262-273 - [c3]Patrice Boizumault:
A General Model to Implement DIF and FREEZE. ICLP 1986: 585-592 - 1984
- [c2]Patrice Boizumault:
Un modèle de trace pour PROLOG. SPLT 1984 - 1983
- [c1]Patrice Boizumault:
Sur la transformation de l'appel terminal en itération dans un interprète PROLOG. SPLT 1983
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-06-05 21:32 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:
