Ant Colony Multi-Optimization Algorithm for Circuit Bi- Partitioning.

دانشگاه آزاد اسلامی اصفهان(خوراسگان)

منو

رکورد قبلی

رکورد بعدی

" Ant Colony Multi-Optimization Algorithm for Circuit Bi- Partitioning. "

Document Type	:	Latin Dissertation
Language of Document	:	English
Record Number	:	148653
Doc. No	:	ET20445
Main Entry	:	Emran A. Ba-Abbad
Title Proper	:	Ant Colony Multi-Optimization Algorithm for Circuit Bi- Partitioning.
Note	:	This document is digital این مدرک بصورت الکترونیکی می باشد
Abstract	:	The acceleration of the product to market cycle of VLSI based technology productsdictates continuously reJining design and implementation methodologies. Circuitpartitioning is a physical design problem in which a given circuit is divided into segmentsmeeting some constraints and objectives. The circuit partitioning problem is NP hard;that means for this class of problems no algorithm of polynomial complexity could befound. In this thesis work, a biologically inspired heuristic (ant colony) is used to solvesuch problem. The ant colony implemented is closely rooted at the biological andbehavioral model of the real social insects. It is a non-deterministic heuristic and couldbe used as both constructive and iterative. The solution uses many ants of simple natureand limited memory requirements. The intelligence of this heuristic is not portrayed byindividual ants, but rather is expressed by the colony as a whole. Careful presentation ofthe problem to the ant colony model facilitates the close biological solution derivation.The solutions obtained.
Subject	:	Electericl tess
	:	برق
electronic file name	:	TL43580.pdf
Title and statement of responsibility and	:	Ant Colony Multi-Optimization Algorithm for Circuit Bi- Partitioning. [Thesis]