Search the dblp DataBase
Narendra Jussien :
[Publications ]
[Author Rank by year ]
[Co-authors ]
[Prefers ]
[Cites ]
[Cited by ]
Publications of Author
Narendra Jussien , Olivier Lhomme Local Search with Constraint Propagation and Conflict-Based Heuristics. [Citation Graph (0, 0)][DBLP ] AAAI/IAAI, 2000, pp:169-174 [Conf ] Hadrien Cambazard , Pierre-Emmanuel Hladik , Anne-Marie Déplanche , Narendra Jussien , Yvon Trinquet Decomposition and Learning for a Hard Real Time Task Allocation Problem. [Citation Graph (0, 0)][DBLP ] CP, 2004, pp:153-167 [Conf ] Hadrien Cambazard , Narendra Jussien Integrating Benders Decomposition Within Constraint Programming. [Citation Graph (0, 0)][DBLP ] CP, 2005, pp:752-756 [Conf ] Abdallah Elkhyari , Christelle Guéret , Narendra Jussien Conflict-Based Repair Techniques for Solving Dynamic Scheduling Problems. [Citation Graph (0, 0)][DBLP ] CP, 2002, pp:702-707 [Conf ] Narendra Jussien , Patrice Boizumault Implementing Constraint Relaxation over Finite Domains Using Assumption-Based Truth Maintenance Systems. [Citation Graph (0, 0)][DBLP ] Over-Constrained Systems, 1995, pp:265-280 [Conf ] Narendra Jussien , Romuald Debruyne , Patrice Boizumault Maintaining Arc-Consistency within Dynamic Backtracking. [Citation Graph (0, 0)][DBLP ] CP, 2000, pp:249-261 [Conf ] Hadrien Cambazard , Narendra Jussien Identifying and Exploiting Problem Structures Using Explanation-Based Constraint Programming. [Citation Graph (0, 0)][DBLP ] CPAIOR, 2005, pp:94-109 [Conf ] Narendra Jussien , Olivier Lhomme Dynamic Domain Splitting for Numeric CSPs. [Citation Graph (0, 0)][DBLP ] ECAI, 1998, pp:224-228 [Conf ] Romuald Debruyne , Gérard Ferrand , Narendra Jussien , Willy Lesaint , Samir Ouis , Alexandre Tessier Correctness of Constraint Retraction Algorithms. [Citation Graph (0, 0)][DBLP ] FLAIRS Conference, 2003, pp:172-176 [Conf ] Mohammad Ghoniem , Narendra Jussien , Jean-Daniel Fekete VISEXP: Visualizing Constraint Solver Dynamics Using Explanations. [Citation Graph (0, 0)][DBLP ] FLAIRS Conference, 2004, pp:- [Conf ] Samir Ouis , Narendra Jussien , Patrice Boizumault k-relevant Explanations for Constraint Programming. [Citation Graph (0, 0)][DBLP ] FLAIRS Conference, 2003, pp:192-196 [Conf ] Narendra Jussien L'enseignement de la programmation logique à l'Ecole des Mines de Nantes. [Citation Graph (0, 0)][DBLP ] JFPLC, 2003, pp:63-75 [Conf ] Narendra Jussien , Patrice Boizumault Maintien de déduction pour la relaxation de contraintes. [Citation Graph (0, 0)][DBLP ] JFPLC, 1996, pp:239-254 [Conf ] Narendra Jussien , Patrice Boizumault Stratégies en meilleur d'abord pour la relaxation de contraintes. [Citation Graph (0, 0)][DBLP ] JFPLC, 1997, pp:149-0 [Conf ] Narendra Jussien , Christelle Guéret Utilisation du backtrack intelligent dans un branch-and-bound. Application au problème d'Open-Shop. [Citation Graph (0, 0)][DBLP ] JFPLC, 1998, pp:231-250 [Conf ] Samir Ouis , Narendra Jussien , Patrice Boizumault Explications k-relevantes pour la programmation par contraintes. [Citation Graph (0, 0)][DBLP ] JFPLC, 2003, pp:111-124 [Conf ] Samir Ouis , Narendra Jussien , Olivier Lhomme Explications conviviales pour la programmation par contraintes. [Citation Graph (0, 0)][DBLP ] JFPLC, 2002, pp:105-0 [Conf ] Hervé Albin-Amiot , Pierre Cointe , Yann-Gaël Guéhéneuc , Narendra Jussien Instantiating and Detecting Design Patterns: Putting Bits and Pieces Together. [Citation Graph (0, 0)][DBLP ] ASE, 2001, pp:166-173 [Conf ] Yann-Gaël Guéhéneuc , Rémi Douence , Narendra Jussien No Java without Caffeine: A Tool for Dynamic Analysis of Java Programs. [Citation Graph (0, 0)][DBLP ] ASE, 2002, pp:117-0 [Conf ] Samir Ouis , Narendra Jussien , Patrice Boizumault COINS: a constraint-based interactive solving system. [Citation Graph (0, 0)][DBLP ] WLPE, 2002, pp:31-46 [Conf ] Narendra Jussien , Samir Ouis User-friendly explanations for constraint programming. [Citation Graph (0, 0)][DBLP ] WLPE, 2001, pp:- [Conf ] Hadrien Cambazard , Fabien Demazeau , Narendra Jussien , Philippe David Interactively Solving School Timetabling Problems Using Extensions of Constraint Programming. [Citation Graph (0, 0)][DBLP ] PATAT, 2004, pp:190-207 [Conf ] Abdallah Elkhyari , Christelle Guéret , Narendra Jussien Solving Dynamic Resource Constraint Project Scheduling Problems Using New Constraint Programming Tools. [Citation Graph (0, 0)][DBLP ] PATAT, 2002, pp:39-62 [Conf ] Christelle Guéret , Narendra Jussien , Patrice Boizumault , Christian Prins Building University Timetables Using Constraint Logic Programming. [Citation Graph (0, 0)][DBLP ] PATAT, 1995, pp:130-145 [Conf ] Narendra Jussien , Patrice Boizumault Best-First Search for Property Maintenance in Reactive Constraint Systems. [Citation Graph (0, 0)][DBLP ] ILPS, 1997, pp:339-353 [Conf ] Mohammad Ghoniem , Hadrien Cambazard , Jean-Daniel Fekete , Narendra Jussien Peeking in solver strategies using explanations visualization of dynamic graphs for constraint programming. [Citation Graph (0, 0)][DBLP ] SOFTVIS, 2005, pp:27-36 [Conf ] Narendra Jussien , Olivier Lhomme Local search with constraint propagation and conflict-based heuristics. [Citation Graph (0, 0)][DBLP ] Artif. Intell., 2002, v:139, n:1, pp:21-45 [Journal ] Gérard Verfaillie , Narendra Jussien Constraint Solving in Uncertain and Dynamic Environments: A Survey. [Citation Graph (0, 0)][DBLP ] Constraints, 2005, v:10, n:3, pp:253-281 [Journal ] Hadrien Cambazard , Narendra Jussien Identifying and Exploiting Problem Structures Using Explanation-based Constraint Programming. [Citation Graph (0, 0)][DBLP ] Constraints, 2006, v:11, n:4, pp:295-313 [Journal ] Samir Ouis , Narendra Jussien , Patrice Boizumault COINS: a constraint-based interactive solving system [Citation Graph (0, 0)][DBLP ] CoRR, 2002, v:0, n:, pp:- [Journal ] Patrice Boizumault , Narendra Jussien , Samir Ouis Explications k-relevantes pour la programmation par contraintes. [Citation Graph (0, 0)][DBLP ] Technique et Science Informatiques, 2003, v:22, n:1, pp:111-124 [Journal ] Narendra Jussien L'enseignement de la programmation logique à l'École des Mines de Nantes. [Citation Graph (0, 0)][DBLP ] Technique et Science Informatiques, 2003, v:22, n:1, pp:63-75 [Journal ] Hadrien Cambazard , Narendra Jussien Solving the Minimum Number of Open Stacks Problem with Explanation-based Techniques. [Citation Graph (0, 0)][DBLP ] ExaCt, 2007, pp:14-19 [Conf ] Learning from the Past to Dynamically Improve Search: A Case Study on the MOSP Problem. [Citation Graph (, )][DBLP ] Search in 0.003secs, Finished in 0.280secs