Source: https://people.epfl.ch/jamila.sam
Timestamp: 2019-04-21 14:55:20+00:00

Document:
C. Jermann; A. Neumaier; D. Sam-Haroud : Global Optimization and Constraint Satisfaction. 2005. Second International Workshop, COCOS'03, Selected revised papers.
V. Nguyen; D. Sam-Haroud; B. Faltings : Dynamic Distributed BackJumping; Recent Advances in Constraints; Springer-Verlag, 2005. p. pp.71-85.
-H. Vu; M. Silaghi; D. Sam-Haroud; B. Faltings : Branch-and-Prune Search Strategies for Numerical Constraint Solving. 2005.
X.-H. Vu; H. Schichl; D. Sam-Haroud : Using Directed Acyclic Graphs to Coordinate Propagation and Search for Numerical Constraint Satisfaction Problems. 2004. p. 72-81.
X.-H. Vu; D. Sam-Haroud; B. Faltings : Combining Multiple Inclusion Representations in Numerical Constraint Propagation. 2004. p. 458-467.
X.-H. Vu; D. Sam-Haroud; B. Faltings : Clustering for Disconnected Solution Sets of Numerical CSPs. 2004. p. 25-43.
V. Nguyen; D. Sam-Haroud; B. Faltings : Dynamic Distributed backjumping. 2004. DCR2004, Toronto, Canada.
X.-H. Vu; H. Schichl; D. Sam-Haroud : Using Directed Acyclic Graphs to Coordinate Propagation and Search for Numerical Constraint Satisfaction Problems. 2004.
X.-H. Vu; D. Sam-Haroud; B. V. Faltings : A Generic Scheme for Combining Multiple Inclusion Representations in Numerical Constraint Propagation. 2004.
X.-H. Vu; D. Sam-Haroud; S. Marius-Calin : Numerical Constraint Satisfaction Problems with Non-isolated Solutions. 2003. p. 194-210.
X.-H. Vu; D. Sam-Haroud; B. Faltings : Clustering the Search Tree for Numerical Constraints. 2003.
O. Shcherbina; A. Neumaier; D. Sam-Haroud; X.-H. Vu; T.-V. Nguyen : Benchmarking Global Optimization and Constraint Satisfaction Codes. 2003. First International Workshop on Global Constraint Optimization and Constraint Satisfaction, COCOS 2002, Valbonne-Sophia Antipolis, France. p. 211-222.
X.-H. Vu; D. Sam-Haroud; M.-C. Silaghi : Résolution de problèmes non-linéaires avec continuum de solutions. 2002. p. 27-41.
X.-H. Vu; D. Sam-Haroud; S. Marius-Calin; S. Koenig; R. C. Holte : Approximation Techniques for Non-linear Problems with Continuum of Solutions. 2002. p. 224-241.
M.-C. Silaghi; D. Sam-Haroud; B. Faltings : Search Techniques for Non-Linear Constraints with Inequalities. 2001.
M. C. Silaghi; S. Sabau; D. Sam-Haroud; B. Faltings : Asynchronous Search for Numeric DisCSPs. 2001.
M.-C. Silaghi; D. Sam-Haroud; R. Weigel; X.-H. Vu; B. V. Faltings : e1e2phi-Consistency. 2001.
M.-C. Silaghi; D. Sam-Haroud; M. Calisti; B. Faltings : Negotiation by Relaxation in Dynamic DisCSPs with Private Constraints. 2001.
M.-C. Silaghi; D. Sam-Haroud; M. Calisti; B. Faltings; M.-C. Silaghi : Generalized English Auctions by Relaxation in Dynamic Distributed CSPs with Private Constraints. 2001. p. 45-54.
M.-C. Silaghi; D. Sam-Haroud; B. Faltings : Hybridizing ABT and AWC into a polynomial space, complete protocol with reordering. 2001.
M.-C. Silaghi; D. Sam-Haroud; B. Faltings : Asynchronous Consistency Maintenance with Reordering. 2001.
M.-C. Silaghi; D. Sam-Haroud; B. Faltings : Polynomial Space and Complete Multiply Asynchronous Search with Abstractions. 2001. p. 17-32.
M.-C. Silaghi; D. Sam-Haroud; B. Faltings : Maintaining Consistency for ABT. 2001.
M.-C. Silaghi; D. Sam-Haroud; B. Faltings : Secure Asynchronous Search. 2001.
M.-C. Silaghi; D. Sam-Haroud; B. Faltings : Asynchronous Consistency Maintenance. 2001.
M.-C. Silaghi; D. Sam-Haroud; B. Faltings : ABT with Asynchronous Reordering. 2001. p. 54-63.
C. Bliek; P. Spellucci; L. Vincente; A. Neumaier; L. Granvilliers et al. : Algorithms for Solving Non-Linear Constrained and Optimization Problems: The State of The Art. 2001.
M.-C. Silaghi; D. Sam-Haroud; B. Faltings : Asynchronous Search with Aggregations. 2000.
M.-C. Silaghi; D. Sam-Haroud; B. Faltings : Distributed Asynchronous Search with Private Constraints. 2000. p. 177-178.
M.-C. Silaghi; D. Sam-Haroud; B. V. Faltings : Maintaining Hierachical Distributed Consistency. 2000.
-C. Silaghi; D. Sam-Haroud; B. Faltings : Fractionnement Intelligent de domaine pour CSPs avec domaines ordonnes. 2000. p. 439-448.
-C. Silaghi; D. Sam-Haroud; B. Faltings : Search Techniques for CSPs with Ordered Domains. 1999.
-C. Silaghi; D. Sam-Haroud; B. Faltings : Intelligent Domain Splitting for CSPs with Ordered Domains. 1999. p. 488-489.
-C. Silaghi; D. Sam-Haroud; B. Faltings : Ways of Maintaining Arc Consistency in Search using the Cartesian Representation. 1999.
C. Bliek; D. Sam-Haroud : Path Consistency for Triangulated Constraint Graphs. 1999.
D. Sam-Haroud; B. Faltings : Consistency Techniques for Continuous Constraints; Constraints. 1996. DOI : 10.1007/BF00143879.
D. Sam-Haroud; B. Faltings; E. Freuder : Solving Non-Binary Convex CSPs in Continuous Domains. 1996.
D. Sam-Haroud; B. Faltings : Constraint Consistency Techniques for Continuous Domains. 1995.
X.-H. Vu; D. Sam-Haroud; B. Faltings : Enhancing numerical constraint propagation using multiple inclusion representations; Annals Of Mathematics And Artificial Intelligence. 2009. DOI : 10.1007/s10472-009-9129-6.
X.-H. Vu; H. Schichl; D. Sam-Haroud : Interval propagation and search on directed acyclic graphs for numerical constraint solving; Journal Of Global Optimization. 2009. DOI : 10.1007/s10898-008-9386-7.

References: V. 

V. 
 V. 
 V. 
 Art. 2001
 V.