Abstract
There exists a long discussion over the issue of whether minimal alphabet or maximal alphabet gives maximum schemata. The article generalizes the concept of schemata to dependency relation based ‘extended formae’. Further, it proves that theoretical maximum schemata could be achieved through an operator exploiting extended formae and using maximal alphabet. It shows that the previous conclusion of minimal alphabet giving maximum schemata is also true for some operators. It is known that maximum schemata is advantageous to achieve maximum implicit parallelism. The article raises a discussion over the requirement of availing maximum schemata by showing some disadvantages also. As a conclusion, it suggests to use an intermediate level alphabet for representation, balancing maximal alphabet to avail maximum schemata and minimal alphabet to overcome the disadvantages due to maximum schemata.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Antonisse., J.: A new interpretation of schema notation that overturns the binary coding constraint. In: Proceedings of the Third International Conference on Genetic Algorithms. pp. 86-91. Morgan Kaufmann (San Mateo) (1989).
Eiben, A., Raué, P., Ruttkay, Z.: Genetic algorithms with multi-parent recombination. Parallel Problem Solving from NaturePPSN III pp. 78-87 (1994).
Eshelman, L.: Real-coded genetic algorithms and interval-schemata. Foundations of genetic algorithms 2, 187-202 (1993).
Goldberg, D.E.: Zen and the art of genetic algorithms. In: Proceedings of the third international conference on Genetic algorithms. pp. 80-85. Morgan Kaufmann Publishers Inc., San Francisco, CA, USA (1989).
Goldberg, D.: Genetic algorithms in search, optimization, and machine learning. Addison-wesley (1989).
Goldberg, D.: Real-coded genetic algorithms, virtual alphabets, and blocking. Complex Systems 5, 139-167 (1991).
Holland, J.: Adaptation in natural and artificial systems. No. 53, University of Michigan press (1975).
Radcliffe, N.: Equivalence class analysis of genetic algorithms. Complex Systems 5(2), 183-205 (1991).
Radcliffe, N.: Forma analysis and random respectful recombination. In: Proceedings of the fourth international conference on genetic algorithms. pp. 222-229. San Marco CA: Morgan Kaufmann (1991).
Smith, R.E., Goldberg, D.E.: Diploidy and dominance in artificial genetic search. Complex Systems 6(3), 251-285 (1992).
Vose, M.D.: Generalizing the notion of schema in genetic algorithms. Artif. Intell. 50(3), 385-396 (Aug 1991).
Wright, A.: Genetic algorithms for real parameter optimization. Foundations of genetic algorithms 1, 205-218 (1991).
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer India
About this paper
Cite this paper
Dharmani Bhaveshkumar , C. (2013). Extended Forma: Analysis and an Operator Exploiting it. In: Bansal, J., Singh, P., Deep, K., Pant, M., Nagar, A. (eds) Proceedings of Seventh International Conference on Bio-Inspired Computing: Theories and Applications (BIC-TA 2012). Advances in Intelligent Systems and Computing, vol 201. Springer, India. https://doi.org/10.1007/978-81-322-1038-2_23
Download citation
DOI: https://doi.org/10.1007/978-81-322-1038-2_23
Published:
Publisher Name: Springer, India
Print ISBN: 978-81-322-1037-5
Online ISBN: 978-81-322-1038-2
eBook Packages: EngineeringEngineering (R0)