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.
CITATION STYLE
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
Mendeley helps you to discover research relevant for your work.