Solving partitioning problem in codesign with ant colonies

6Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Partitioning problem in codesign is of great importance since it can widely influence the characteristics of the system under design. The numerous constraints imposed by the environment and/or the underlying target architecture, in addition to its NP-Completeness makes the problem hard to solve. This paper introduces an automatic partitioning approach inspired by the collective behavior of social insects such as ants, which are able to find the shortest path from their nest to a food source. © Springer-Verlag Berlin Heidelberg 2005.

Cite

CITATION STYLE

APA

Koudil, M., Benatchba, K., Gharout, S., & Hamani, N. (2005). Solving partitioning problem in codesign with ant colonies. In Lecture Notes in Computer Science (Vol. 3562, pp. 324–337). Springer Verlag. https://doi.org/10.1007/11499305_34

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free