This paper demonstrates the feasibility of a word-based genetic algorithm (GA) for solving short substitution cryptograms such as the kind found in newspapers and puzzle books. Al...
Abstract. Two extensions of the original Wilson’s editing method are introduced in this paper. These new algorithms are based on estimating probabilities from the k-nearest neigh...
This paper presents a comparative analysis of neural networks, simulated annealing, and genetic algorithms in the determination of input patterns for testing analog circuits. The ...
Maintaining diversity is important for the performance of evolutionary algorithms. Diversity mechanisms can enhance global exploration of the search space and enable crossover to ...
Tobias Friedrich, Pietro Simone Oliveto, Dirk Sudh...
This paper presents the comparison of performance on a simple genetic algorithm (SGA) using roulette wheel selection and tournament selection. A SGA is mainly composed of three ge...