Optimal orientations of cells in slicing floorplan designs
Information and Control
Nonlinear programming: theory, algorithms, and applications
Nonlinear programming: theory, algorithms, and applications
Algorithms for VLSI Physical Design Automation
Algorithms for VLSI Physical Design Automation
VISI Physical Design Automation: Theory and Practice
VISI Physical Design Automation: Theory and Practice
A fast algorithm for area minimization of slicing floorplans
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Area minimization for floorplans
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Floorplan sizing by linear programming approximation
Proceedings of the 37th Annual Design Automation Conference
Timing-driven placement based on partitioning with dynamic cut-net control
Proceedings of the 37th Annual Design Automation Conference
Integrated floorplanning with buffer/channel insertion for bus-based microprocessor designs
Proceedings of the 2002 international symposium on Physical design
Floorplanning method based on liner programming
ICS'06 Proceedings of the 10th WSEAS international conference on Systems
Computing cartograms with optimal complexity
Proceedings of the twenty-eighth annual symposium on Computational geometry
| Hi-index | 0.00 |
It is sho wn that the floorplan area minimization problem can be formulated as a convex programming problem with the n umbers of variables and constraints significantly less than those previously published.