Competitive Generation for Genetic Algorithms
نویسندگان
چکیده
منابع مشابه
Systolic Random Number Generation for Genetic Algorithms
A parallel hardware random number generator for use with a VLSI genetic algorithm processing device is proposed. The design uses an systolic array of mixed congruential random number generators. The generators are constantly reseeded with the outputs of the proceeding generators to avoid signiicant biasing of the randomness of the array which would result in longer times for the algorithm to co...
متن کاملGenetic Algorithms for Dynamic Test Data Generation
In software testing, it is often desirable to find test inputs that exercise specific program features. To find these inputs by hand is extremely time-consuming, especially when the software is complex. Therefore, many attempts have been made to automate the process. Random test data generation consists of generating test inputs at random, in the hope that they will exercise the desired softwar...
متن کاملGenetic algorithms for generation of class boundaries
A method is described for finding decision boundaries, approximated by piecewise linear segments, for classifying patterns in R(N),N>/=2, using an elitist model of genetic algorithms. It involves generation and placement of a set of hyperplanes (represented by strings) in the feature space that yields minimum misclassification. A scheme for the automatic deletion of redundant hyperplanes is als...
متن کاملOptimization of Cutting Parameters Based on Production Time Using Colonial Competitive (CC) and Genetic (G) Algorithms
A properly designed machining procedure can significantly affect the efficiency of the production lines. To minimize the cost of machining process as well as increasing the quality of products, cutting parameters must permit the reduction of cutting time and cost to the lowest possible levels. To achieve this, cutting parameters must be kept in the optimal range. This is a non-linear optimizati...
متن کاملSexual Selection with Competitive/Co-operative Operators for Genetic Algorithms
In a standard genetic algorithm (GA), individuals reproduce asexually: any two organisms may be parents in crossover. Gender separation and sexual selection here inspire a model of gendered GA in which crossover takes place only between individuals of opposite sex and the GA’s evaluation, selection, and mutation strategies depend on gender. Consequently, a pattern of cross-gender cooperation an...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Korean Institute of Intelligent Systems
سال: 2007
ISSN: 1976-9172
DOI: 10.5391/jkiis.2007.17.1.086