Exact computation of the expectation curves of the bit-flip mutation using landscapes theory
Proceedings of the 13th annual conference on Genetic and evolutionary computation
Elementary landscape decomposition of the test suite minimization problem
SSBSE'11 Proceedings of the Third international conference on Search based software engineering
A methodology to find the elementary landscape decomposition of combinatorial optimization problems
Evolutionary Computation
EvoCOP'12 Proceedings of the 12th European conference on Evolutionary Computation in Combinatorial Optimization
Elementary landscape decomposition of the 0-1 unconstrained quadratic optimization
Journal of Heuristics
| Hi-index | 0.00 |
Recent research in search-based software engineering (SBSE) has demonstrated that a number of software engineering problems can be reformulated as a search problem, hence search algorithms can be applied to tackle it. However, most of the existing work has been of empirical nature and the techniques are predominately experimental. Therefore in-depth studies into characteritics of SE problems and appropriate algorithms to solve them are necessary. In this paper, we propose a novel method to gain insight knowledge on a variant of the next release problem (NRP) using elementary landscape analysis, which could be used to guide the design of more efficient algorithms. Preliminary experimental results are obtained to indicate the effectiveness of the proposed method.