Detailed Information

Cited 0 time in webofscience Cited 0 time in scopus
Metadata Downloads

Minimizing Total Wire Length by Flipping Modules

Full metadata record
DC Field Value Language
dc.contributor.authorChong, K.-
dc.contributor.authorSahni, S.-
dc.date.accessioned2022-05-24T02:48:38Z-
dc.date.available2022-05-24T02:48:38Z-
dc.date.created2022-05-24-
dc.date.issued1993-
dc.identifier.issn0278-0070-
dc.identifier.urihttps://scholarworks.bwise.kr/hongik/handle/2020.sw.hongik/28078-
dc.description.abstractWe consider the problem of flipping modules about their horizontal and/or vertical axes so as to minimize the estimated total wire length. Polynomial time algorithms are proposed for some classes of module layouts. Further, it is shown that a simple greedy heuristic often outperforms the neural network and simulated annealing heuristics proposed earlier for this problem. © 1993 IEEE-
dc.language영어-
dc.language.isoen-
dc.titleMinimizing Total Wire Length by Flipping Modules-
dc.typeArticle-
dc.contributor.affiliatedAuthorChong, K.-
dc.identifier.doi10.1109/43.184854-
dc.identifier.scopusid2-s2.0-33751424535-
dc.identifier.bibliographicCitationIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, v.12, no.1, pp.167 - 175-
dc.relation.isPartOfIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems-
dc.citation.titleIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems-
dc.citation.volume12-
dc.citation.number1-
dc.citation.startPage167-
dc.citation.endPage175-
dc.type.rimsART-
dc.type.docTypeArticle-
dc.description.journalClass1-
dc.description.journalRegisteredClassscopus-
Files in This Item
There are no files associated with this item.
Appears in
Collections
College of Engineering > Computer Engineering > Journal Articles

qrcode

Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.

Altmetrics

Total Views & Downloads

BROWSE