default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDOlivier Lhomme
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2012
[c17]Olivier Lhomme:
Practical Reformulations With Table Constraints. ECAI 2012: 911-912- 2011
- [c16]Roberto Di Cosmo, Olivier Lhomme, Claude Michel:
Aligning component upgrades. LoCoCo 2011: 1-11
2000 – 2009
- 2006
- [c15]Ulrich Junker, Olivier Lhomme:
Return of the JTMS: Preferences Orchestrate Conflict Learning and Solution Synthesis. ECAI 2006: 123-127 - 2005
- [c14]Olivier Lhomme, Jean-Charles Régin:
A Fast Arc Consistency Algorithm for n-ary Constraints. AAAI 2005: 405-410 - [c13]Olivier Lhomme:
Quick Shaving. AAAI 2005: 411-415 - 2004
- [j6]Olivier Lhomme:
Amortized Random Backtracking. Ann. Oper. Res. 130(1-4): 143-161 (2004) - [c12]Olivier Lhomme:
Arc-Consistency Filtering Algorithms for Logical Combinations of Constraints. CPAIOR 2004: 209-224 - 2003
- [j5]Christelle Guéret
, Narendra Jussien, Olivier Lhomme, C. Pavageau, Christian Prins:
Loading aircraft for military operations. J. Oper. Res. Soc. 54(5): 458-465 (2003) - [c11]Olivier Lhomme:
An Efficient Filtering Algorithm for Disjunction of Constraints. CP 2003: 904-908 - 2002
- [j4]Narendra Jussien, Olivier Lhomme:
Local search with constraint propagation and conflict-based heuristics. Artif. Intell. 139(1): 21-45 (2002) - [j3]Yahia Lebbah, Olivier Lhomme:
Accelerating filtering techniques for numeric CSPs. Artif. Intell. 139(1): 109-132 (2002) - [c10]Samir Ouis, Narendra Jussien, Olivier Lhomme:
Explications conviviales pour la programmation par contraintes. JFPLC 2002: 105- - [c9]Olivier Lhomme:
Amortized Non-Systematic Search Algorithms. JFPLC 2002: 199- - 2000
- [j2]Narendra Jussien, Olivier Lhomme:
The Path repair algorithm. Electron. Notes Discret. Math. 4: 2-16 (2000) - [c8]Narendra Jussien, Olivier Lhomme:
Local Search with Constraint Propagation and Conflict-Based Heuristics. AAAI/IAAI 2000: 169-174
1990 – 1999
- 1998
- [j1]Olivier Lhomme, Arnaud Gotlieb, Michel Rueher:
Dynamic Optimization of Interval Narrowing Algorithms. J. Log. Program. 37(1-3): 165-183 (1998) - [c7]Yahia Lebbah, Olivier Lhomme:
Acceleration Methods for Numeric CSPs. AAAI/IAAI 1998: 19-24 - [c6]Narendra Jussien, Olivier Lhomme:
Dynamic Domain Splitting for Numeric CSPs. ECAI 1998: 224-228 - [c5]Yahia Lebbah, Olivier Lhomme:
Acceleration methods for numeric CSPs. JFPLC 1998: 185-198 - [c4]Yahia Lebbah, Olivier Lhomme:
Prediction by extrapolation for interval tightening methods. SCAN 1998: 159-166 - 1996
- [c3]Olivier Lhomme, Arnaud Gotlieb, Michel Rueher, Patrick Taillibert:
Boosting the Interval Narrowing Algorithm. JICSLP 1996: 378-392 - 1993
- [c2]Olivier Lhomme:
Consistency Techniques for Numeric CSPs. IJCAI 1993: 232-238 - 1992
- [c1]Olivier Lhomme:
Programmation logique à contraintes et propagation d'intervalles. JFPL 1992: 314-327
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-04-24 23:06 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:
