Bibliographic Details
| Title: |
Eliminating Introns in Ant Colony Programming. |
| Authors: |
Boryczka, Mariusz1 boryczka@us.edu.pl |
| Source: |
Fundamenta Informaticae. 2005, Vol. 68 Issue 1-2, p1-19. 19p. 7 Diagrams, 5 Charts. |
| Subjects: |
Automatic programming (Computer science), Computer programming, Colonies (Biology), Ants, Introns |
| Abstract: |
Ant Colony Programming is a relatively new paradigm based on Genetic Programming and Ant Colony System. We discuss the problemof eliminating introns in Ant Colony Programming. The approach is tested on several approximation problems. The test results demonstrate that the proposed method simplifies significantly the achieved solutions and shortens their evaluation time. [ABSTRACT FROM AUTHOR] |
|
Copyright of Fundamenta Informaticae is the property of Polskie Towarzystwo Matematyczne and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) |
| Database: |
Engineering Source |
