Jamila Sam
EPFL IC SIN-GE
BC 141 (Bâtiment BC)
Station 14
1015 Lausanne
+41 21 693 52 09
Office: BC 141
EPFL › IC › IC-SIN › SIN-GE
Site web: https://sin.epfl.ch/
+41 21 693 52 09
EPFL › IC › IC-SIN › SIN-ENS
Site web: https://sin.epfl.ch
+41 21 693 52 09
EPFL › IC › IC-SSC › SSC-ENS
Site web: https://ssc.epfl.ch
EPFL P-SG CCE
CH C2 397 (Bâtiment CH)
Station 6
1015 Lausanne
+41 21 693 52 09
EPFL › P › P-EM › CCE
Site web: https://cce.epfl.ch/
Formation
|
1995 – 1995
EPFL
Dirigée par
Thesis director: Boi Faltings
Interval Analysis, Constraint Propagation and Applications
Trends in Constraint Programming; London, UK: ISTE, 2007. p. 223-259.Global Optimization and Constraint Satisfaction
2005. Second International Workshop, COCOS'03, Selected revised papers.Dynamic Distributed BackJumping
2005. Joint ERCIM/CoLogNet International Workshop on Constraint Solving and Constraint Logic Programming, CSCLP 2004, Lausanne, Switzerland, June 23-25, 2004. p. 71-85. DOI : 10.1007/11402763_6.Branch-and-Prune Search Strategies for Numerical Constraint Solving
2005Using Directed Acyclic Graphs to Coordinate Propagation and Search for Numerical Constraint Satisfaction Problems
2004. p. 72-81. DOI : 10.1109/ICTAI.2004.118.Combining Multiple Inclusion Representations in Numerical Constraint Propagation
2004. p. 458-467. DOI : 10.1109/ICTAI.2004.40.Clustering for Disconnected Solution Sets of Numerical CSPs
2004. Joint ERCIM/CoLogNET International Workshop on Constraint Solving and Constraint Logic Programming, CSCLP 2003, Budapest, Hungary, June 30 - July 2, 2003. p. 25-43. DOI : 10.1007/978-3-540-24662-6_2.Dynamic Distributed backjumping
2004. DCR2004, Toronto, Canada.Using Directed Acyclic Graphs to Coordinate Propagation and Search for Numerical Constraint Satisfaction Problems
2004A Generic Scheme for Combining Multiple Inclusion Representations in Numerical Constraint Propagation
2004Numerical Constraint Satisfaction Problems with Non-isolated Solutions
2003. First International Workshop on Global Constraint Optimization and Constraint Satisfaction, COCOS 2002, Valbonne-Sophia Antipolis, France, October 2-4, 2002. p. 194-210. DOI : 10.1007/978-3-540-39901-8_15.Clustering the Search Tree for Numerical Constraints
2003.Benchmarking Global Optimization and Constraint Satisfaction Codes
2003. First International Workshop on Global Constraint Optimization and Constraint Satisfaction, COCOS 2002, Valbonne-Sophia Antipolis, France, October 2-4, 2002. p. 211-222. DOI : 10.1007/978-3-540-39901-8_16.Résolution de problèmes non-linéaires avec continuum de solutions
2002. p. 27-41.Approximation Techniques for Non-linear Problems with Continuum of Solutions
2002. 5th International Symposium, SARA 2002, Kananaskis, Alberta, Canada, August 2–4, 2002. p. 224-241. DOI : 10.1007/3-540-45622-8_17.Search Techniques for Non-Linear Constraints with Inequalities
2001.Asynchronous Search for Numeric DisCSPs
2001. p. 785-785. DOI : 10.1007/3-540-45578-7_83.e1e2phi-Consistency
2001Negotiation by Relaxation in Dynamic DisCSPs with Private Constraints
2001Generalized English Auctions by Relaxation in Dynamic Distributed CSPs with Private Constraints
2001. p. 45-54.Hybridizing ABT and AWC into a polynomial space, complete protocol with reordering
2001Asynchronous Consistency Maintenance with Reordering
2001Polynomial Space and Complete Multiply Asynchronous Search with Abstractions
2001. p. 17-32.Maintaining Consistency for ABT
2001.Secure Asynchronous Search
2001. 2nd Asia-Pacific Conference on Intelligent Agent Technology (IAT'2001). p. 400-404. DOI : 10.1142/9789812811042_0054.Asynchronous Consistency Maintenance
2001. 2nd Asia-Pacific Conference on Intelligent Agent Technology (IAT'2001). p. 98–102. DOI : 10.1142/9789812811042_0014.ABT with Asynchronous Reordering
2001. 2nd Asia-Pacific Conference on Intelligent Agent Technology (IAT'2001). p. 54-63. DOI : 10.1142/9789812811042_0007.Algorithms for Solving Non-Linear Constrained and Optimization Problems: The State of The Art
2001Asynchronous Search with Aggregations
2000.Distributed Asynchronous Search with Private Constraints
2000. p. 177-178.Maintaining Hierachical Distributed Consistency
2000.Fractionnement Intelligent de domaine pour CSPs avec domaines ordonnes
2000. p. 439-448.Search Techniques for CSPs with Ordered Domains
1999Intelligent Domain Splitting for CSPs with Ordered Domains
1999. p. 488-489. DOI : 10.1007/978-3-540-48085-3_40.Ways of Maintaining Arc Consistency in Search using the Cartesian Representation
1999. Joint ERCIM/Compulog NetWorkshop, Paphos, Cyprus, October 25–27, 1999. p. 173-187. DOI : 10.1007/3-540-44654-0_9.Path Consistency for Triangulated Constraint Graphs
1999.Constraint Techniques for Collaborative Design
1998. p. 34-41. DOI : 10.1109/TAI.1998.744754.Consistency Techniques for Continuous Constraints
Constraints. 1996. DOI : 10.1007/BF00143879.Solving Non-Binary Convex CSPs in Continuous Domains
1996. p. 410-424. DOI : 10.1007/3-540-61551-2_90.Constraint Consistency Techniques for Continuous Domains
1995Enhancing numerical constraint propagation using multiple inclusion representations
Annals Of Mathematics And Artificial Intelligence. 2009. DOI : 10.1007/s10472-009-9129-6.Interval propagation and search on directed acyclic graphs for numerical constraint solving
Journal Of Global Optimization. 2009. DOI : 10.1007/s10898-008-9386-7.Interval Analysis, Constraint Propagation and Applications
Trends in Constraint Programming; London, UK: ISTE, 2007. p. 223-259.Global Optimization and Constraint Satisfaction
2005. Second International Workshop, COCOS'03, Selected revised papers.Branch-and-Prune Search Strategies for Numerical Constraint Solving
2005Using Directed Acyclic Graphs to Coordinate Propagation and Search for Numerical Constraint Satisfaction Problems
2004. p. 72-81. DOI : 10.1109/ICTAI.2004.118.Combining Multiple Inclusion Representations in Numerical Constraint Propagation
2004. p. 458-467. DOI : 10.1109/ICTAI.2004.40.Clustering for Disconnected Solution Sets of Numerical CSPs
2004. Joint ERCIM/CoLogNET International Workshop on Constraint Solving and Constraint Logic Programming, CSCLP 2003, Budapest, Hungary, June 30 - July 2, 2003. p. 25-43. DOI : 10.1007/978-3-540-24662-6_2.Dynamic Distributed backjumping
2004. DCR2004, Toronto, Canada.Using Directed Acyclic Graphs to Coordinate Propagation and Search for Numerical Constraint Satisfaction Problems
2004A Generic Scheme for Combining Multiple Inclusion Representations in Numerical Constraint Propagation
2004Numerical Constraint Satisfaction Problems with Non-isolated Solutions
2003. First International Workshop on Global Constraint Optimization and Constraint Satisfaction, COCOS 2002, Valbonne-Sophia Antipolis, France, October 2-4, 2002. p. 194-210. DOI : 10.1007/978-3-540-39901-8_15.Clustering the Search Tree for Numerical Constraints
2003.Benchmarking Global Optimization and Constraint Satisfaction Codes
2003. First International Workshop on Global Constraint Optimization and Constraint Satisfaction, COCOS 2002, Valbonne-Sophia Antipolis, France, October 2-4, 2002. p. 211-222. DOI : 10.1007/978-3-540-39901-8_16.Résolution de problèmes non-linéaires avec continuum de solutions
2002. p. 27-41.Approximation Techniques for Non-linear Problems with Continuum of Solutions
2002. 5th International Symposium, SARA 2002, Kananaskis, Alberta, Canada, August 2–4, 2002. p. 224-241. DOI : 10.1007/3-540-45622-8_17.Search Techniques for Non-Linear Constraints with Inequalities
2001.Asynchronous Search for Numeric DisCSPs
2001. p. 785-785. DOI : 10.1007/3-540-45578-7_83.e1e2phi-Consistency
2001Negotiation by Relaxation in Dynamic DisCSPs with Private Constraints
2001Generalized English Auctions by Relaxation in Dynamic Distributed CSPs with Private Constraints
2001. p. 45-54.Hybridizing ABT and AWC into a polynomial space, complete protocol with reordering
2001Asynchronous Consistency Maintenance with Reordering
2001Polynomial Space and Complete Multiply Asynchronous Search with Abstractions
2001. p. 17-32.Maintaining Consistency for ABT
2001.Secure Asynchronous Search
2001. 2nd Asia-Pacific Conference on Intelligent Agent Technology (IAT'2001). p. 400-404. DOI : 10.1142/9789812811042_0054.Asynchronous Consistency Maintenance
2001. 2nd Asia-Pacific Conference on Intelligent Agent Technology (IAT'2001). p. 98–102. DOI : 10.1142/9789812811042_0014.ABT with Asynchronous Reordering
2001. 2nd Asia-Pacific Conference on Intelligent Agent Technology (IAT'2001). p. 54-63. DOI : 10.1142/9789812811042_0007.Algorithms for Solving Non-Linear Constrained and Optimization Problems: The State of The Art
2001Asynchronous Search with Aggregations
2000.Distributed Asynchronous Search with Private Constraints
2000. p. 177-178.Maintaining Hierachical Distributed Consistency
2000.Fractionnement Intelligent de domaine pour CSPs avec domaines ordonnes
2000. p. 439-448.Search Techniques for CSPs with Ordered Domains
1999Intelligent Domain Splitting for CSPs with Ordered Domains
1999. p. 488-489. DOI : 10.1007/978-3-540-48085-3_40.Ways of Maintaining Arc Consistency in Search using the Cartesian Representation
1999. Joint ERCIM/Compulog NetWorkshop, Paphos, Cyprus, October 25–27, 1999. p. 173-187. DOI : 10.1007/3-540-44654-0_9.Path Consistency for Triangulated Constraint Graphs
1999.Constraint Techniques for Collaborative Design
1998. p. 34-41. DOI : 10.1109/TAI.1998.744754.Consistency Techniques for Continuous Constraints
Constraints. 1996. DOI : 10.1007/BF00143879.Solving Non-Binary Convex CSPs in Continuous Domains
1996. p. 410-424. DOI : 10.1007/3-540-61551-2_90.Constraint Consistency Techniques for Continuous Domains
1995Enseignement et PhD
A dirigé les thèses EPFL de
Cours
Information, calcul, communication
CS-119(g)
L'objectif de ce cours est d'initier les étudiants à la pensée algorithmique, de les familiariser avec les fondamentaux de l'informatique et des communications et de développer une première compétence en programmation (langage C++).
Introduction à la programmation
CS-107
Ce cours aborde les concepts fondamentaux de la programmation et de la programmation orientée objet (langage JAVA). Il permet également de se familisarier avec un environnement de développement informatique (par défaut sous Unix).
Programmation orientée objet
CS-112(i)
L'objectif de ce cours est de développer des compétences de base en programmation. L'accent sera mis sur l'approche orientée-objet laquelle renforce la réutilisabilité, la maintenabilité et la fiabilité des programmes. Des fondamentaux d'algorithmique seront également abordés.