Netlist bipartitioning using particle swarm optimisation technique
by Sandeep Singh Gill; Rajeevan Chandel; Ashwani Kumar Chandel
International Journal of Artificial Intelligence and Soft Computing (IJAISC), Vol. 3, No. 1, 2012

Abstract: In this paper circuit netlist bipartitioning using particle swarm optimisation technique is presented. Particle swarm optimisation is a powerful evolutionary computation technique for global search and optimisation. The circuit netlist is partitioned into two partitions such that the number of interconnections between the partitions (cutsize) is minimised. Results obtained show the versatility of the proposed soft computing method in solving non polynomial hard problems like circuit netlist partitioning.

Online publication date: Sat, 29-Nov-2014

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Artificial Intelligence and Soft Computing (IJAISC):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com