Fault insertion based techniqueshave been used for measuring test adequacy and testability of programs. Mutation analysis inserts faults into a program with the goal of creating m...
Roger T. Alexander, James M. Bieman, Sudipto Ghosh...
This paper assumes a search space of fixed-length strings, where the size of the alphabet can vary from position to position. Structural crossover is mask-based crossover, and thu...
Alden H. Wright, Michael D. Vose, Jonathan E. Rowe
In this paper we examine the effects of single node mutations on trees evolved via genetic programming. The results show that neutral mutations are less likely for nodes nearer th...
Using a directed mutation can improve the efficiency of processing many optimization problems. The first mutation operators of this kind proposed by Hildebrand [1], however, suffer...
In this paper, a genetic algorithm is introduced to generate variants of a choreographic sequence, which are then selected using different criteria. The mutation phase of the algo...
: In a canonical genetic algorithm, the reproduction operators (crossover and mutation) are random in nature. The direction of the search carried out by the GA system is driven pur...
Testing plays an important role in the maintenance of Component Based Software Development. Test adequacy for component testing is one of the hardest issues for component testing....
Ying Jiang, Shan-Shan Hou, Jinhui Shan, Lu Zhang, ...
A new mutation concept is proposed to generalize local selection based Differential Evolution algorithm to work in general multimodal problems. Three variations of the proposed me...
Mutation analysis is a widely-adopted strategy in software testing with two main purposes: measuring the quality of test suites, and identifying redundant code in programs. Simila...
Differential evolution (DE) is a powerful yet simple evolutionary algorithm for optimizing real valued optimization problems. Traditional investigations with differential evolution...