Sciweavers

Share
GECCO
2003
Springer

Ant Colony Programming for Approximation Problems

8 years 11 months ago
Ant Colony Programming for Approximation Problems
Abstract. A method of automatic programming, called genetic programming, assumes that the desired program is found by using a genetic algorithm. We propose an idea of ant colony programming in which instead of a genetic algorithm an ant colony algorithm is applied to search for the program. The test results demonstrate that the proposed idea can be used with success to solve the approximation problems.
Mariusz Boryczka, Zbigniew J. Czech, Wojciech Wiec
Added 06 Jul 2010
Updated 06 Jul 2010
Type Conference
Year 2003
Where GECCO
Authors Mariusz Boryczka, Zbigniew J. Czech, Wojciech Wieczorek
Comments (0)
books