Towards generalized expression for schemata count

Authors:
Rajneesh Pawar;J. S. Saini;M. Gopal;A. P. Mittal
Affiliations:
Electrical Eng. Dept., Deenbandhu Chhotu Ram University of Science & Technology, Murthal, Sonipat, Haryana 131039, India;Deenbandhu Chhotu Ram University of Science & Technology, Murthal, Sonipat, Haryana 131039, India;Electrical Eng. Dept., Indian institute of Technology, Hauz Khas, New Delhi 110 016, India;Instrumentation & Control Eng. Divn., Netaji Subhas Institute of Technology, Sector 3, Dwarka, New Delhi 110075, India
Venue:
Applied Soft Computing
Year:
2011

Citing 3
Cited 0

Genetic algorithms for VLSI design, layout & test automation

Genetic algorithms for VLSI design, layout & test automation
Outline for a Logical Theory of Adaptive Systems

Journal of the ACM (JACM)
An Introduction to Genetic Algorithms

An Introduction to Genetic Algorithms

Quantified Score

Hi-index	0.00

Visualization

Abstract

The main goal of research reported in this paper is to propose a new technique for schemata count of Genetic Algorithms. Till recently, no methods existed for counting the schemata except the manual one that was obviously cursed by the tedium involved. A substantially generalized expression has been developed that directly computes the number of unique (different) schemata in a population, using breakup of similarity bits for non-repeated strings.