Please use this identifier to cite or link to this item:
https://hdl.handle.net/10316/8224
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Almeida, Ana Maria de | - |
dc.contributor.author | Rodrigues, Rosália | - |
dc.date.accessioned | 2009-02-09T14:22:57Z | - |
dc.date.available | 2009-02-09T14:22:57Z | - |
dc.date.issued | 2003 | en_US |
dc.identifier.citation | Networks. 41:4 (2003) 235-244 | en_US |
dc.identifier.uri | https://hdl.handle.net/10316/8224 | - |
dc.description.abstract | Hierarchical approaches to floorplan design usually use trees to represent hierarchical floorplans, defining topological relations between a set of components to be placed on a (circuit) board. This placement is then optimized to minimize chip area, perimeter, or other such cost measurements. This work places the problem of minimizing hierarchical floorplans of order k within the appropriate theoretical framework and presents an algorithm that uses exclusively the k-ary representation tree to determine the best or minimal solution to a conflicting bicriteria problem. The algorithm does not need predefined partitioning schemes and determines the orientation of each individual component. It can deal both with five-module wheels, as well as slices, and can handle an arbitrary number of realizations for each individual component. © 2003 Wiley Periodicals, Inc. | en_US |
dc.language.iso | eng | eng |
dc.rights | openAccess | eng |
dc.title | Trees, slices, and wheels: On the floorplan area minimization problem | en_US |
dc.type | article | en_US |
dc.identifier.doi | 10.1002/net.10075 | en_US |
item.fulltext | Com Texto completo | - |
item.grantfulltext | open | - |
item.languageiso639-1 | en | - |
item.cerifentitytype | Publications | - |
item.openairetype | article | - |
item.openairecristype | http://purl.org/coar/resource_type/c_18cf | - |
Appears in Collections: | FCTUC Matemática - Artigos em Revistas Internacionais |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.