| Author | Aamir, Aamir Rasheed |
| Call Number | AIT RSPR no.CS-93-02 |
| Subject(s) | Genetic algorithms
|
| Note | A research study submitted in partial fulfillment of the requirement for the degree of Master of
Science |
| Publisher | Asian Institute of Technology |
| Abstract | The Genetic Programming Paradigm is a new approach to problem solving. In this
approach the size and shape of the solution to a problem is dynamically created using Darwinian
principles of reproduction and survival of the fittest. Moreover the resulting solution is inherently
hierarchical. In this study, this new problem-solving approach is explored by using the test
problem of sorting of an array. Sorting is a process of re-arranging a given set of objects in a
specific order and is a fundamental problem of great theoretical and practical importance in
computation. The problem of sorting of an array is reformulated for genetic programming
paradigm and the results of computer experimentation are presented. A software package was
developed in C programming language to carry-out these experiments. Based on the experimental
results, some conclusions about the performance and behavior of genetic programming paradigm
are also deduced. |
| Year | 1993 |
| Type | Research Study Project Report (RSPR) |
| School | School of Engineering and Technology (SET) |
| Department | Department of Information and Communications Technologies (DICT) |
| Academic Program/FoS | Computer Science (CS) |
| Chairperson(s) | Sadananda, Ramakoti; |
| Examination Committee(s) | Murai, Shunji;Yulu, Qi; |
| Scholarship Donor(s) | Japan; |
| Degree | Research Studies Project Report (M.Sc.) - Asian Institute of Technology, 1993 |