The art of computer programming, volume 3: (2nd ed.) sorting and searching
The art of computer programming, volume 3: (2nd ed.) sorting and searching
Evolution of Non-Deterministic Incremental Algorithms as a New Approach for Search in State Spaces
Proceedings of the 6th International Conference on Genetic Algorithms
More Effective Genetic Search For The Sorting Network Problem
GECCO '02 Proceedings of the Genetic and Evolutionary Computation Conference
Isomorphism, Normalization, And A Genetic Algorithm For Sorting Network Optimization
GECCO '02 Proceedings of the Genetic and Evolutionary Computation Conference
Depth Optimal Sorting Networks Resistant to k Passive Faults
SIAM Journal on Computing
Statistical analysis of heuristics for evolving sorting networks
GECCO '05 Proceedings of the 7th annual conference on Genetic and evolutionary computation
| Hi-index | 0.00 |
Sorting networks have been of interest to the computer science and evolutionary computing communities for several decades. In this paper we present a measure of test case quality that may have application to other problems in which fitness is based on a large number of test cases. We use this measure to reduce the number of tests used in fitness evaluation as a means of optimizing the speed of a genetic algorithm, although the quality measure itself is expensive. We report the results of several genetic algorithm experiments evolving sorting networks using a restricted number of test cases, and compare those results to similar experiments in the literature.