Narendra Jussien

According to our database1, Narendra Jussien authored at least 44 papers between 1995 and 2016.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2016
Event Selection Rules to Compute Explanations.
CoRR, 2016

2014
Explanation-based large neighborhood search.
Constraints An Int. J., 2014

Propagation engine prototyping with a domain specific language.
Constraints An Int. J., 2014

2012
An Optimal Constraint Programming Approach to the Open-Shop Problem.
INFORMS J. Comput., 2012

2011
Filtering Algorithms for Discrete Cumulative Problems with Overloads of Resource.
Proceedings of the Principles and Practice of Constraint Programming - CP 2011, 2011

2009
Integrating Strong Local Consistencies into Constraint Solvers.
Proceedings of the Recent Advances in Constraints, 2009

2008
Solving a real-time allocation problem with constraint programming.
J. Syst. Softw., 2008

2007
Learning from the Past to Dynamically Improve Search: A Case Study on the MOSP Problem.
Proceedings of the Learning and Intelligent Optimization, Second International Conference, 2007

Solving the Minimum Number of Open Stacks Problem with Explanation-based Techniques.
Proceedings of the Explanation-Aware Computing, 2007

2006
Editorial.
RAIRO Oper. Res., 2006

Des explications pour reconnaître et exploiter les structures cachées d'un problème combinatoire.
RAIRO Oper. Res., 2006

Identifying and Exploiting Problem Structures Using Explanation-based Constraint Programming.
Constraints An Int. J., 2006

2005
Constraint Solving in Uncertain and Dynamic Environments: A Survey.
Constraints An Int. J., 2005

Peeking in solver strategies using explanations visualization of dynamic graphs for constraint programming.
Proceedings of the ACM 2005 Symposium on Software Visualization, 2005

Integrating Benders Decomposition Within Constraint Programming.
Proceedings of the Principles and Practice of Constraint Programming, 2005

2004
Foreword.
Ann. Oper. Res., 2004

Interactively Solving School Timetabling Problems Using Extensions of Constraint Programming.
Proceedings of the Practice and Theory of Automated Timetabling V, 2004

VISEXP: Visualizing Constraint Solver Dynamics Using Explanations.
Proceedings of the Seventeenth International Florida Artificial Intelligence Research Society Conference, 2004

Decomposition and Learning for a Hard Real Time Task Allocation Problem.
Proceedings of the Principles and Practice of Constraint Programming, 2004

2003
L'enseignement de la programmation logique à l'École des Mines de Nantes.
Tech. Sci. Informatiques, 2003

Explications k-relevantes pour la programmation par contraintes.
Tech. Sci. Informatiques, 2003

Loading aircraft for military operations.
J. Oper. Res. Soc., 2003

k-relevant Explanations for Constraint Programming.
Proceedings of the Sixteenth International Florida Artificial Intelligence Research Society Conference, 2003

Correctness of Constraint Retraction Algorithms.
Proceedings of the Sixteenth International Florida Artificial Intelligence Research Society Conference, 2003

The versatility of using explanations within constraint programming.
, 2003

2002
Local search with constraint propagation and conflict-based heuristics.
Artif. Intell., 2002

Solving Dynamic Resource Constraint Project Scheduling Problems Using New Constraint Programming Tools.
Proceedings of the Practice and Theory of Automated Timetabling IV, 2002

COINS: a constraint-based interactive solving system.
Proceedings of the 12th International Workshop on Logic Programming Environments, 2002

No Java without Caffeine: A Tool for Dynamic Analysis of Java Programs.
Proceedings of the 17th IEEE International Conference on Automated Software Engineering (ASE 2002), 2002

Explications conviviales pour la programmation par contraintes.
Proceedings of the Programmation en logique avec contraintes, 2002

Conflict-Based Repair Techniques for Solving Dynamic Scheduling Problems.
Proceedings of the Principles and Practice of Constraint Programming, 2002

2001
User-friendly explanations for constraint programming.
Proceedings of the Eleventh Workshop on Logic Programming Environments (WLPE'01), 2001

Instantiating and Detecting Design Patterns: Putting Bits and Pieces Together.
Proceedings of the 16th IEEE International Conference on Automated Software Engineering (ASE 2001), 2001

2000
Using intelligent backtracking to improve branch-and-bound methods: An application to Open-Shop problems.
Eur. J. Oper. Res., 2000

The Path repair algorithm.
Electron. Notes Discret. Math., 2000

Maintaining Arc-Consistency within Dynamic Backtracking.
Proceedings of the Principles and Practice of Constraint Programming, 2000

1998
Utilisation du backtrack intelligent dans un branch-and-bound. Application au problème d'Open-Shop.
Proceedings of the JFPLC'98, 1998

Dynamic Domain Splitting for Numeric CSPs.
Proceedings of the 13th European Conference on Artificial Intelligence, 1998

1997
Relaxation de Contraintes pour les problèmes dynamiques. (Constraint relaxation for dynamic problems).
PhD thesis, 1997

Best-First Search for Property Maintenance in Reactive Constraint Systems.
Proceedings of the Logic Programming, 1997

Stratégies en meilleur d'abord pour la relaxation de contraintes.
Proceedings of the JFPLC'97, 1997

1996
Maintien de déduction pour la relaxation de contraintes.
Proceedings of the JFPLC'96, 1996

1995
Building University Timetables Using Constraint Logic Programming.
Proceedings of the Practice and Theory of Automated Timetabling, First International Conference, Edinburgh, UK, August 29, 1995

Implementing Constraint Relaxation over Finite Domains Using Assumption-Based Truth Maintenance Systems.
Proceedings of the Over-Constrained Systems, 1995


  Loading...