最小自由度优先算法研究 |
| |
引用本文: | 王昊.最小自由度优先算法研究[J].科技信息,2009(5):199-200. |
| |
作者姓名: | 王昊 |
| |
作者单位: | 湖北交通职业技术学院; |
| |
摘 要: | 基于最小自由度优先原则(LFF)的布局算法是一种确定性的布局算法,它具有多项式的时间复杂度,该算法的实验结果在面积优化方面优于基于随机优化方法的布局算法。
|
关 键 词: | 最小自由度优先 算法 确定性布局算法 |
Research on the Algorithm of the Less Flexibility First Principles |
| |
Abstract: | The deterministic Placement algorithm based on Less Flexibility First (LFF)Principles has Polynomial complexity. The results of the algorithm Present the better Performance on area usage than the stochastic optimization algorithm. |
| |
Keywords: | Less Flexibility First Principles Algorithm Deterministic Placement algorithm |
本文献已被 CNKI 维普 等数据库收录! |