Christophe Lecoutre
Professor in Computer ScienceCentre de Recherche en Informatique de Lens
IUT de Lens, Université d'Artois
Rue de l'université, SP16
F 62307 Lens Cedex
France
E-mail: lecoutre [at] cril [dot] fr
Phone: +33 (0)3 21 79 32 71
Fax: +33 (0)3 21 79 32 72
Web: http://www.cril.fr/~lecoutre
Offre de poste(s) d'ingénieur d'étude et/ou de recherche au CRIL (Lens) :
There is still an opportunity for very good candidate to a PhD Grant, supported by OSEO, at CRIL (Lens, France) in Constraint Programming: Interviews possible from February 2012.
- 12, 24 ou 36 mois, à démarrer entre Mars et Juillet 2012
- Entretiens (téléphoniques et/ou sur place) à partir de Février 2012
- Voir Annonce complète
Le financement sera assuré par OSEO dans le cadre d'un projet ISI (Innovation Stratégique Industrielle) auquel participent trois entreprises et trois laboratoires dont le CRIL. Le candidat sera intégré à l'équipe du CRIL travaillant sur ce projet afin de participer à l'effort actuel de recherche, développement et valorisation sur la thématique des problèmes de planification de ressources (avec des outils de programmation par contraintes autour de CSP et SAT).
There is still an opportunity for very good candidate to a PhD Grant, supported by OSEO, at CRIL (Lens, France) in Constraint Programming: Interviews possible from February 2012.
 |
| Sample |
| Figures |
| Erratum |
Christophe Lecoutre
ISTE/Wiley
592 pp.
June 2009
ISBN: 9781848211063
Content
1. Contraint Networks
2. Random and Structured Networks
Appendices
2. Random and Structured Networks
| Part 1. Inference | Part 2. Search |
| 3. Consistencies | 8. Backtrack Search |
| 4. Generic GAC Algorithms | 9. Guiding Search toward Conflict |
| 5. GAC for Table Constraints | 10. Restarts and Nogood Recording |
| 6. Singleton Arc Consistency | 11. State-based Reasoning |
| 7. Path and Dual Consistency | 12. Symmetry Breaking |
I am interested in search and representation problems in Artificial Intelligence.
I mainly focus my research on Constraint Programming which is a general framework providing simple, general and efficient models and algorithms for solving real-world and academic problems.
Currently, I am interested in:
- properties of constraint networks called consistencies
- constraint propagation algorithms
- (hard) random problem instances
- search heuristics
- learning techniques
- symmetry breaking methods
Main Responsabilities
- Leader at CRIL, with Olivier Roussel, of the project PAJERO supported by OSEO (2011-2015).
- Leader at CRIL, with Frédéric Boussemart, of the project SPI supported by MITI and CIEL (2011-2012).
- Program chair of JFPC'10 (sixièmes Journées Francophones de Programmation par Contraintes).
- Vice leader of the team MARS (Modèles et Algorithmes pour la RéSolution de problèmes combinatoires) at INRIA Lille Nord Europe (2008-2009).
- French Leader of the project PAI Ulysses "strong consistencies" between the CRIL and the UCC (Irland) (2007).
- Co-organizer of constraint solver competitions (2005, 2006, 2008, 2009) - Independent jurys select benchmarks and recognize results.
- Program committee member of the international conferences IJCAI-2011 (senior PC), AAAI-2011, AAAI-2010, IJCAI-2009, ICTAI-2008, Doctoral Program of CP-2008, CP-2007, Doctoral Program of CP-2007, AI-2007, ECAI-2006, of the international workshops CPAI-2006, CPAI-2005, CPAI-2004, and of the national conferences JFPC-2011, RFIA-2010, JFPC-2009, JFPC-2008 and RFIA-2008.
- Co-organizer of the international workshops CPAI-2006 and CPAI-2005, and member of the organizing committee of the national conference JFPC-2005.
PhD. Students
- Nicolas Paris, since October 2011
- Djamel-Eddine Dehani, since October 2010
- Dominique D'almeida, thesis defended in december 3rd, 2010, Etudes de systèmes de contraintes pour le raisonnement qualitatif temporel et spatial.
- Julion Vion, thesis defended in november 30th, 2007, Contributions à la résolution générique des problèmes de satisfaction de contraintes. Assistant professor since 2009 at the University of Valenciennes.
- Sebastien Tabary, thesis defended in november 22th, 2007, Exploiter les conflits pour réduire l'effort de recherche en satisfaction de contraintes. Assistant professor since 2008 at the IUT de Lens.
- Sylvain Merchez, thesis defended in december 15th, 2000, Problèmes de satisfaction de contraintes : étude de mécanismes d'abstraction et de construction de hiérarchies. Assistant professor since 2001 at the FSA de Bethune.
Scientific Highlights
- Runner-up as best paper Failed value consistencies for constraint satisfaction at the international conference CP'09, Lisbon, Portugal (in the resarch track, 128 submissions - 1 best paper - 3 runners-up).
- Distinguished paper Conservative dual consistency at the international conference AAAI'07, Vancouver, Canada (921 submissions - 47 distinguished papers).
- Rankings of the constraint solver AbsCon in international competitions:
- 4th constraint solver competition (2009). AbsCon ranked:
- 1st in the category binary intensional constraints
- 2nd in the category non-binary extensional constraints
- 3rd in the category binary extensional constraints.
- 3rd constraint solver competition (2008). AbsCon is not on the podium in any category, but we are happy to have AbsCon embedded (with the two other solvers Choco and Mistral) in the portfolio cpHydra that won almost every category.
- 2nd constraint solver competition (2006). AbsCon ranked:
- 1st in the category non-binary extensional constraints
- 2nd in the categories non-binary intensional constraints and global constraints.
- 3rd in the category binary intensional constraints.
- 1st constraint solver competition (2005). AbsCon ranked:
- 1st in the category non-binary instances
AbsCon is a constraint solver that I have developed. Sylvain Merchez, Frederic Boussemart, Fred Hemery and Sebastien Tabary have also been involved in the development of some modules.
- 4th constraint solver competition (2009). AbsCon ranked:
Outils pour la Programmation par Contraintes
- Cours
- Modélisation diapos diapos (8 par 8)
- Résolution diapos diapos (8 par 8)
- Résolution SAT par Gilles Audemard diapos
- Travaux Dirigés
- Travaux Pratiques
- Outils
Programmation Web
Le cours est inspiré de :
- Beginning Web programming with HTML, XHTML and CSS (2nd edition) par Jon Duckett (Wrox)
- CSS3 pour les web designers par Dan Cederholm (Eyrolles)
- Professional Javascript for web developers (2nd edition) par Nicholas C. Zakas (Wrox)
- PHP 5 (2nd edition) par Jean Engels (Eyrolles)
Web Programming with XHTML
- Les diapositives (pdf)
- Les exemples
- Les Tps
- Sujet TP 1 (pdf) Correction
- Sujet TP 2 (pdf) Correction
- Sujet TP 3 (pdf) Correction
- Sujet TP 4 (pdf) Correction
- Sujet TP 5
- Les feuilles d'aide
Web Programming with CSS
- Les diapositives (pdf)
- Les exemples
- Les feuilles d'aide
Web Programming with Javascript
- Les diapositives
- Les Tps
- Sujet TP 1
- Sujet TP 2
- Sujet TP 3
- Sujet TP 4
Web Programming with PHP
- Les diapositives (pdf)
- Les exemples
- Les Tps
- Sujet TP 1 (pdf) Correction
- Sujet TP 1bis (pdf)
- Sujet TP 1ter (pdf)
- Sujet TP 2 (pdf) Correction
- Sujet TP 3 (pdf) Correction
- Sujet TP 4 (pdf) Correction
- Sujet TP 5
- Sujet TP 6 (pdf)
- Sujet TP 6 (suite)
Java - Programmation Objet