Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Narendra Jussien

dblp:89/5260 · DBLP profile ↗
← Back
15ranked-venue papers
3as first author
0since 2021 · last 2012
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 8 · 3 first-authorSoftware engineering, systems software and programming languages · 8 · 1 first-authorApplied, interdisciplinary, general and emerging computing · 3Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 first-authorTheory of computation · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Software engineering, system software, and programming languages
2 papers
Software maintenance and evolution · 56% Requirements engineering and software design · 23% Program analysis · 20%
Artificial intelligence
1 paper
Planning, search and constraint satisfaction · 100%

Topics — the 8 heaviest of 10, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Knowledge, reasoning and agents › Planning, search and constraint satisfaction › heuristic search
local search
0.012002
Local search with constraint propagation and conflict-based heuristics · Artif. Intell. 2002
Program analysis
dynamic analysis
0.012002
No Java without Caffeine: A Tool for Dynamic Analysis of Java Programs · ASE 2002
Software maintenance and evolution
program comprehension
0.012002
No Java without Caffeine: A Tool for Dynamic Analysis of Java Programs · ASE 2002
Requirements engineering and software design
design patterns
0.012001
Instantiating and Detecting Design Patterns: Putting Bits and Pieces Together · ASE 2001
Software maintenance and evolution › reverse engineering
design pattern detection
0.012001
Instantiating and Detecting Design Patterns: Putting Bits and Pieces Together · ASE 2001
Software maintenance and evolution
software reengineering
0.012001
Instantiating and Detecting Design Patterns: Putting Bits and Pieces Together · ASE 2001
Knowledge, reasoning and agents › Planning, search and constraint satisfaction
constraint propagation
0.012002
Local search with constraint propagation and conflict-based heuristics · Artif. Intell. 2002
Requirements engineering and software design
software architecture
0.012001
Instantiating and Detecting Design Patterns: Putting Bits and Pieces Together · ASE 2001

Methods — techniques the papers use, named apart from their topics

prolog querying · 0.0java platform debug architecture · 0.0conflict-based heuristics · 0.0
YearPublicationVenuePosition
2012 An Optimal Constraint Programming Approach to the Open-Shop Problem
abstract
This paper presents an optimal constraint programming approach for the open-shop scheduling problem, which integrates recent constraint propagation and branching techniques with new upper bound heuristics. Randomized restart policies combined with nogood recording allow us to search diversification and learning from restarts. This approach is compared with the best-known metaheuristics and exact algorithms, and it shows better results on a wide range of benchmark instances.
Arnaud Malapert, Hadrien Cambazard, Christelle Guéret, Narendra Jussien, André Langevin, Louis-Martin Rousseau
INFORMS J. Comput.4
2011 Filtering Algorithms for Discrete Cumulative Problems with Overloads of Resource
Alexis De Clercq, Thierry Petit, Nicolas Beldiceanu, Narendra Jussien
CP4
2008 Solving a real-time allocation problem with constraint programming
Pierre-Emmanuel Hladik, Hadrien Cambazard, Anne-Marie Déplanche, Narendra Jussien
J. Syst. Softw.4
2005 Integrating Benders Decomposition Within Constraint Programming
Hadrien Cambazard, Narendra Jussien
CP2
2005 Identifying and Exploiting Problem Structures Using Explanation-Based Constraint Programming
Hadrien Cambazard, Narendra Jussien
CPAIOR2
2004 Decomposition and Learning for a Hard Real Time Task Allocation Problem
Hadrien Cambazard, Pierre-Emmanuel Hladik, Anne-Marie Déplanche, Narendra Jussien, Yvon Trinquet
CP4
2004 Interactively Solving School Timetabling Problems Using Extensions of Constraint Programming
Hadrien Cambazard, Fabien Demazeau, Narendra Jussien, Philippe David
PATAT3
2002 Conflict-Based Repair Techniques for Solving Dynamic Scheduling Problems
Abdallah Elkhyari, Christelle Guéret, Narendra Jussien
CP3
2002 No Java without Caffeine: A Tool for Dynamic Analysis of Java Programs
abstract
To understand the behavior of a program, a maintainer reads some code, asks a question about this code, conjectures an answer, and searches the code and the documentation for confirmation of her conjecture. However, the confirmation of the conjecture can be error-prone and time-consuming because the maintainer has only static information at her disposal. She would benefit from dynamic information. In this paper, we present Caffeine, an assistant that helps the maintainer in checking her conjecture about the behavior of a Java program. Our assistant is a dynamic analysis tool that uses the Java platform debug architecture to generate a trace, i.e., an execution history, and a Prolog engine to perform queries over the trace. We present a usage scenario based on the n-queens problem, and two real-life examples based on the Singleton design pattern and on the composition relationship.
Yann-Gaël Guéhéneuc, Rémi Douence, Narendra Jussien
ASE3
2002 Solving Dynamic Resource Constraint Project Scheduling Problems Using New Constraint Programming Tools
Abdallah Elkhyari, Christelle Guéret, Narendra Jussien
PATAT3
2002 Local search with constraint propagation and conflict-based heuristics
Narendra Jussien, Olivier Lhomme
Artif. Intell.1
2001 Instantiating and Detecting Design Patterns: Putting Bits and Pieces Together
abstract
Design patterns ease the designing, understanding, and re-engineering of software. Achieving a well-designed piece of software requires a deep understanding and a good practice of design patterns. Understanding existing software relies on the ability to identify architectural forms resulting from the implementation of design patterns. Maintaining software involves spotting places that can be improved by using better design decisions, like those advocated by design patterns. Nevertheless, there is a lack of tools automatizing the use of design patterns to achieve well-designed pieces of software, to identify recurrent architectural forms, and to maintain software. We present a set of tools and techniques to help OO software practitioners design, understand, and re-engineer a piece of software using design-patterns. A first prototype tool, PATTERNS-BOX, provides assistance in designing the architecture of a new piece of software, while a second prototype tool, PTIDEJ, identifies design patterns used in an existing one. These tools, in combination, support maintenance by highlighting defects in an existing design, and by suggesting and applying corrections based on widely-accepted design pattern solutions.
Hervé Albin-Amiot, Pierre Cointe, Yann-Gaël Guéhéneuc, Narendra Jussien
ASE4
2000 Maintaining Arc-Consistency within Dynamic Backtracking
Narendra Jussien, Romuald Debruyne, Patrice Boizumault
CP1
1998 Dynamic Domain Splitting for Numeric CSPs
Narendra Jussien, Olivier Lhomme
ECAI1
1995 Building University Timetables Using Constraint Logic Programming
Christelle Guéret, Narendra Jussien, Patrice Boizumault, Christian Prins
PATAT2