1) incremental floorplanning
增量式布图规划
1.
This paper introduces a two-stage strategy to solve the incremental floorplanning problem with boundary constraints.
该文提出了一种二阶段法来实现边界约束下的增量式布图规划算法。
2.
This incremental floorplanning algorithm has a very high sp.
提出了一种基于CBL布图表示的新的增量式布图规划算法。
2) floorplanning
布图规划
1.
Rectangle-packing-based floorplanning algorithms for system-on-a-chip design;
基于矩形宏模块的片上系统布图规划算法
2.
The Boundary Constraints of Floorplanning Based on Single-Sequence;
基于Single-Sequence布图规划边界约束问题的研究
3.
Simulation annealing accelerating in VLSI floorplanning
VLSI平面布图规划中模拟退火算法的加速策略
3) floorplan
布图规划
1.
The research on "integrating high level synthesis and floorplan" is a very important part in the research on electronic design automation.
介绍了高层次综合与布图规划相结合的基本方法与技术及其研究进展。
2.
In practice of floorplan/placement of very large scale integration(VLSI) physical design,it is very critical to place some modules along the boundaries of the chip so that connections between inputs and outputs and among units in hierarchical design mode are shortened.
该文针对一般的具有不可二划分结构的布图规划问题,在SS编码的基础上解决VLSI物理设计中有边界约束的布局布图规划的问题;证明SS的放置顺序是表示模块的数字在SS中出现的位置先后顺序;提出模块放置在四个边界(上、下、左、右边界)在SS编码中应满足的充要条件及证明;并给出模块位于四个边界在SS编码中相应的表达式和计算方法。
4) Incremental planning
增量规划
5) VLSI floorplanning
VLSI布图规划
1.
A effective VLSI floorplanning method based on Genetic Algorithms was presented in this paper.
提出了一种有效的基于遗传算法的VLSI布图规划方法。
6) incremental graph partition
增量划分图
补充资料：图的减缩图(或称图子式)
图的减缩图(或称图子式)
minor of a graph
图的减缩图(或称图子式)【.皿以ofa脚户;MHHoPrpa中a」【补注】设G是一个图(graph)(可以有环及多重边).G的一个减缩图(nullor)是从G中接连进行下述运算而得的任何一个图: i)删去一条边; 五)收缩一条边; 说)去掉一个孤立顶点. NRobe由on与P.D.Se脚aour的图减缩定理(脚Ph nl的。r theon习11)如下所述:已知有限图的无穷序列G，，GZ，…，则存在指标i
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条