Harmony search based remodularization for object-oriented software systems
JK Chhabra - Computer Languages, Systems & Structures, 2017 - Elsevier
Software remodularization is always a key task in the field of software reengineering. In
recent years, search-based optimization techniques have been considered as an effective …
recent years, search-based optimization techniques have been considered as an effective …
Automatic package coupling and cycle minimization
Object-oriented (OO) software is usually organized into subsystems using the concepts of
package or module. Such modular structure helps applications to evolve when facing new …
package or module. Such modular structure helps applications to evolve when facing new …
Computing tree decompositions with small independence number
The independence number of a tree decomposition is the maximum of the independence
numbers of the subgraphs induced by its bags. The tree-independence number of a graph is …
numbers of the subgraphs induced by its bags. The tree-independence number of a graph is …
FP-ABC: Fuzzy-Pareto dominance driven artificial bee colony algorithm for many-objective software module clustering
JK Chhabra - Computer Languages, Systems & Structures, 2018 - Elsevier
Recently, multi-objective evolutionary algorithms (MOEAs) gained wide attention to solve
various search-based software engineering (SBSE) problems. The formulation of software …
various search-based software engineering (SBSE) problems. The formulation of software …
[HTML][HTML] Improving package structure of object-oriented software using multi-objective optimization and weighted class connections
JK Chhabra - Journal of King Saud University-Computer and …, 2017 - Elsevier
The software maintenance activities performed without following the original design
decisions about the package structure usually deteriorate the quality of software …
decisions about the package structure usually deteriorate the quality of software …
TA-ABC: two-archive artificial bee colony for multi-objective software module clustering problem
Amarjeet, JK Chhabra - Journal of Intelligent Systems, 2018 - degruyter.com
Multi-objective software module clustering problem (M-SMCP) aims to automatically
produce clustering solutions that optimize multiple conflicting clustering criteria …
produce clustering solutions that optimize multiple conflicting clustering criteria …
A polynomial Turing-kernel for weighted independent set in bull-free graphs
The maximum stable set problem is NP-hard, even when restricted to triangle-free graphs. In
particular, one cannot expect a polynomial time algorithm deciding if a bull-free graph has a …
particular, one cannot expect a polynomial time algorithm deciding if a bull-free graph has a …
A graph modification approach for finding core–periphery structures in protein interaction networks
The core–periphery model for protein interaction (PPI) networks assumes that protein
complexes in these networks consist of a dense core and a possibly sparse periphery that is …
complexes in these networks consist of a dense core and a possibly sparse periphery that is …
Search-based cost-effective software remodularization
R Mahouachi - Journal of Computer Science and Technology, 2018 - Springer
Software modularization is a technique used to divide a software system into independent
modules (packages) that are expected to be cohesive and loosely coupled. However, as …
modules (packages) that are expected to be cohesive and loosely coupled. However, as …
The complexity of drawing graphs on few lines and few planes
It is well known that any graph admits a crossing-free straight-line drawing in R^ 3 and that
any planar graph admits the same even in R^ 2. For a graph G and d ∈ {2, 3\}, let ρ^ 1_d (G) …
any planar graph admits the same even in R^ 2. For a graph G and d ∈ {2, 3\}, let ρ^ 1_d (G) …