High-level synthesis by dynamic ant
Article first published online: 12 JAN 2004
DOI: 10.1002/int.10148
Copyright © 2004 Wiley Periodicals, Inc.
Issue
1098-111X/asset/cover.gif?v=1&s=7f7c12f2c86265974044b2b3f9936860ffc468a0)
International Journal of Intelligent Systems
Special Issue: Intelligent Technologies
Volume 19, Issue 1-2, pages 25–38, January - February 2004
Additional Information
How to Cite
Keinprasit, R. and Chongstitvatana, P. (2004), High-level synthesis by dynamic ant. Int. J. Intell. Syst., 19: 25–38. doi: 10.1002/int.10148
Publication History
- Issue published online: 12 JAN 2004
- Article first published online: 12 JAN 2004
- Abstract
- References
- Cited By
Abstract
In this article, a new algorithm called dynamic ant is introduced. It was a combination of ant colony optimization (ACO) techniques and the dynamic niche sharing scheme. The interesting point of this algorithm is that it is implemented easily and could be well matched with existing design algorithms by adding the heuristic weights to speed up the algorithm. The algorithm uses the problem state structure as in the reinforcement-learning algorithm, but the storage explosion is prevented by means of the pheromone trail. This algorithm was investigated for the data path design problem of high-level synthesis of which has a large number of design steps and design techniques. © 2004 Wiley Periodicals, Inc.

1098-111X/asset/INT_left.gif?v=1&s=c0d44ac5ce99265330169e2ac3d22da4ab6b1a5d)
1098-111X/asset/INT_centre.gif?v=1&s=e94826a6788e7bb0695867b68ca2c030d8c7a252)
1098-111X/asset/INT_right.gif?v=1&s=d4616ff123f9b0a0199cc9f89f77f112e4ce3a70)