default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDjamila Sam-Haroud
Person information
- affiliation: Swiss Federal Institute of Technology in Lausanne, Switzerland
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2009
[j3]Xuan-Ha Vu, Djamila Sam-Haroud, Boi Faltings:
Enhancing numerical constraint propagation using multiple inclusion representations. Ann. Math. Artif. Intell. 55(3-4): 295-354 (2009)- [j2]Xuan-Ha Vu, Hermann Schichl, Djamila Sam-Haroud:
Interval propagation and search on directed acyclic graphs for numerical constraint solving. J. Glob. Optim. 45(4): 499-531 (2009) - 2005
- [e1]Christophe Jermann, Arnold Neumaier, Djamila Sam-Haroud:
Global Optimization and Constraint Satisfaction, Second International Workshop, COCOS 2003, Lausanne, Switzerland, November 18-21, 2003, Revised Selected Papers. Lecture Notes in Computer Science 3478, Springer 2005, ISBN 3-540-26003-X [contents] - [i1]Xuan-Ha Vu, Marius-Calin Silaghi, Djamila Sam-Haroud, Boi Faltings:
Branch-and-Prune Search Strategies for Numerical Constraint Solving. CoRR abs/cs/0512045 (2005) - 2004
- [c18]Viet Nguyen, Djamila Sam-Haroud, Boi Faltings:
Dynamic Distributed BackJumping. CSCLP 2004: 71-85 - [c17]Xuan-Ha Vu, Hermann Schichl, Djamila Sam-Haroud:
Using Directed Acyclic Graphs to Coordinate Propagation and Search for Numerical Constraint Satisfaction Problems. ICTAI 2004: 72-81 - [c16]Xuan-Ha Vu, Djamila Sam-Haroud, Boi Faltings:
Combining Multiple Inclusion Representations in Numerical Constraint Propagation. ICTAI 2004: 458-467 - 2003
- [c15]Xuan-Ha Vu, Djamila Sam-Haroud, Boi Faltings:
Clustering for Disconnected Solution Sets of Numerical CSPs. CSCLP 2003: 25-43 - 2002
- [c14]Xuan-Ha Vu, Djamila Sam-Haroud, Marius-Calin Silaghi:
Numerical Constraint Satisfaction Problems with Non-isolated Solutions. COCOS 2002: 194-210 - [c13]Oleg Shcherbina, Arnold Neumaier, Djamila Sam-Haroud, Xuan-Ha Vu, Tuan-Viet Nguyen:
Benchmarking Global Optimization and Constraint Satisfaction Codes. COCOS 2002: 211-222 - [c12]Xuan-Ha Vu, Djamila Sam-Haroud, Marius-Calin Silaghi:
Résolution de problèmes non linéaires avec continuum de solutions. JFPLC 2002: 27- - [c11]Xuan-Ha Vu, Djamila Sam-Haroud, Marius-Calin Silaghi:
Approximation Techniques for Non-linear Problems with Continuum of Solutions. SARA 2002: 224-241 - 2001
- [c10]Marius-Calin Silaghi, Djamila Sam-Haroud, Boi Faltings:
Search Techniques for Non-linear Constraint Satisfaction Problems with Inequalities. AI 2001: 183-193 - [c9]Marius-Calin Silaghi, Djamila Sam-Haroud, Boi Faltings:
Consistency Maintenance for ABT. CP 2001: 271-285 - [c8]Marius-Calin Silaghi, Stefan Sabau, Djamila Sam-Haroud, Boi Faltings:
Asynchronous Search for Numeric DisCSPs. CP 2001: 785 - 2000
- [c7]Marius-Calin Silaghi, Djamila Sam-Haroud, Boi Faltings:
Asynchronous Search with Aggregations. AAAI/IAAI 2000: 917-922 - [c6]Marius-Calin Silaghi, Djamila Sam-Haroud, Boi Faltings:
Distributed asynchronous search with private constraints (extended abstract). Agents 2000: 177-178
1990 – 1999
- 1999
- [c5]Marius-Calin Silaghi, Djamila Sam-Haroud, Boi Faltings:
Ways of Maintaining Arc Consistency in Search Using the Cartesian Representation. New Trends in Constraints 1999: 173-187 - [c4]Marius-Calin Silaghi, Djamila Sam-Haroud, Boi Faltings:
Intelligent Domain Splitting for CSPs with Ordered Domains. CP 1999: 488-489 - [c3]Christian Bliek, Djamila Sam-Haroud:
Path Consistency on Triangulated Constraint Graphs. IJCAI 1999: 456-461 - 1998
- [c2]Claudio Lottaz, Djamila Sam-Haroud, Boi Faltings, Ian F. C. Smith:
Constraint techniques for collaborative design. ICTAI 1998: 34-41 - 1996
- [j1]Djamila Sam-Haroud, Boi Faltings:
Consistency Techniques for Continuous Constraints. Constraints An Int. J. 1(1/2): 85-118 (1996) - [c1]Djamila Sam-Haroud, Boi Faltings:
Solving Non-binary Convez CSPs in Continous Domains. CP 1996: 410-424
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:16 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:
