SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
Uniform Crossover in Genetic Algorithms
Proceedings of the 3rd International Conference on Genetic Algorithms
Testing the Results of Static Worst-Case Execution-Time Analysis
RTSS '98 Proceedings of the IEEE Real-Time Systems Symposium
A systematic review of search-based testing for non-functional system properties
Information and Software Technology
Comparison of nearest point algorithms by genetic algorithms
Expert Systems with Applications: An International Journal
Estimating discretionary accruals using a grouping genetic algorithm
Expert Systems with Applications: An International Journal
Hi-index | 12.05 |
Genetic algorithms have successfully been used in automatic software testing. Particularly programming errors and inputs that conflict with time constraints can be found. In this paper, the idea of genetic algorithm based software testing is broadened to algorithm performance testing. It is shown how the best and worst case performance of the algorithms can be found effectively. This information can be further utilized when comparing and improving algorithms. In this paper, the proposed test method is introduced and the advantages of using genetic algorithms are discussed. Furthermore, the proposed method is applied to a 2D nearest point algorithm, which is tested by optimizing the parameters of 2D Gaussian distributions using genetic algorithms in order to find the best and worst case distributions and the corresponding performances.