Abstract. We deal with two important problems in pattern recognition that arise in the analysis of large datasets. While most feature subset selection methods use statistical techn...
In previous research, many mutation selection techniques have been proposed to reduce the cost of mutation analysis. After a mutant subset is selected, researchers could obtain a t...
An approach is suggested for arguing that a system is dependable. The key idea is to structure the system so that critical requirements are localized in small, reliable subsets of ...
The addition of a cross-cutting concern in a program, through aspect weaving, has an impact on its existing behaviors. If test cases exist for the program, it is necessary to ident...
The diameter k-clustering problem is the problem of partitioning a finite subset of Rd into k subsets called clusters such that the maximum diameter of the clusters is minimized. ...