Query：
学者姓名：何秀萍
Refining：
Year
Type
Indexed by
Source
Complex
Co-
Language
Clean All
Abstract ：
Circuit partitioning plays a crucial role in very large-scale integrated circuit (VLSI) physical design automation. With current trends, partitioning with multiple objectives which includes cutsize, area, delay, and power obtains much concentration. In this paper, a multi-objective greedy randomized adaptive search procedure (GRASP) is presented for simultaneous cutsize and circuit delay minimization. Each objective is assigned a preference or weight to direct the search procedure and generate a variety of efficient solutions by changing the preference. To get a good initial partition with minimal cutsize and circuit delay, the gain of each module in a circuit is computed by considering both signal nets and circuit delay. The performance of the proposed algorithm is evaluated on a standard set of partitioning benchmark. The experimental results show that the proposed algorithm can generate a set of Pareto optimal solutions and is efficient for tackling multi-objective circuit partitioning. Copyright © 2012 Editorial Department of Journal of Donghua University.
Keyword ：
Algorithms Algorithms Benchmarking Benchmarking Computer aided design Computer aided design Electric network analysis Electric network analysis Multiobjective optimization Multiobjective optimization VLSI circuits VLSI circuits
Cite：
Copy from the list or Export to your reference management。
| GB/T 7714 | Zhan, Qing-Qing , Zhu, Wen-Xing , He, Xiu-Ping et al. A GRASP algorithm for multi-objective circuit partitioning [J]. | Journal of Donghua University (English Edition) , 2012 , 29 (1) : 1-4 . |
| MLA | Zhan, Qing-Qing et al. "A GRASP algorithm for multi-objective circuit partitioning" . | Journal of Donghua University (English Edition) 29 . 1 (2012) : 1-4 . |
| APA | Zhan, Qing-Qing , Zhu, Wen-Xing , He, Xiu-Ping , Chen, Xiu-Hua . A GRASP algorithm for multi-objective circuit partitioning . | Journal of Donghua University (English Edition) , 2012 , 29 (1) , 1-4 . |
| Export to | NoteExpress RIS BibTex |
Version ：
Abstract ：
We study the circuit partitioning problem with area and delay constraints to optimize the circuit performance. We integrate delay constraints into the greedy randomized adaptive search procedure (GRASP), so that GRASP can be used to deal with delay problems. The GRASP with area and delay constraints can generate better initial partitions. Then the initial partition is iteratively improved by an extended FM algorithm. Finally we obtain the partition satisfying area and delay constraints. Our hybrid algorithm can solve bi-partition with area and delay constraints successfully. The experimental results indicate that, compared with FM algorithm and clustering algorithm, our hybrid algorithm improves the solution quality in a reasonable computational time, and obtains a better partition, especially in terms of the minimum cut-size and the average cut-size. © 2010 IEEE.
Keyword ：
Clustering algorithms Clustering algorithms Delay circuits Delay circuits Electric network analysis Electric network analysis Frequency modulation Frequency modulation Heuristic algorithms Heuristic algorithms Iterative methods Iterative methods Timing circuits Timing circuits
Cite：
Copy from the list or Export to your reference management。
| GB/T 7714 | Zhan, Qingqing , Zhu, Wenxing , He, Xiuping . A GRASP based algorithm for multi-constraint circuit partitioning [C] . 2010 : 3110-3114 . |
| MLA | Zhan, Qingqing et al. "A GRASP based algorithm for multi-constraint circuit partitioning" . (2010) : 3110-3114 . |
| APA | Zhan, Qingqing , Zhu, Wenxing , He, Xiuping . A GRASP based algorithm for multi-constraint circuit partitioning . (2010) : 3110-3114 . |
| Export to | NoteExpress RIS BibTex |
Version ：
Abstract ：
给出算法搜索任意凯库勒型苯图的根,并基于此分别给出新的充要条件判定:苯图的正规,凯库勒结构为根、芽或其它.进一步,对于任意两个凯库勒结构,给出充要条件判定其一是否可经由六角旋转转化为另一个.
Keyword ：
六角旋转 六角旋转 完美匹配 完美匹配 珊瑚 珊瑚 算法 算法 苯图 苯图
Cite：
Copy from the list or Export to your reference management。
| GB/T 7714 | 何秀萍 , 刘园年 . 苯图上的珊瑚 [J]. | 福州大学学报（自然科学版） , 2010 , 38 (3) : 325-329 . |
| MLA | 何秀萍 et al. "苯图上的珊瑚" . | 福州大学学报（自然科学版） 38 . 3 (2010) : 325-329 . |
| APA | 何秀萍 , 刘园年 . 苯图上的珊瑚 . | 福州大学学报（自然科学版） , 2010 , 38 (3) , 325-329 . |
| Export to | NoteExpress RIS BibTex |
Version ：
Abstract ：
讨论树的最大度距离排序问题,确定了这个序的前四个树及其相应的度距离.
Keyword ：
度距离 度距离 排序 排序 树 树
Cite：
Copy from the list or Export to your reference management。
| GB/T 7714 | 何秀萍 , 常安 . 树的最大度距离排序 [J]. | 福州大学学报（自然科学版） , 2010 , 38 (5) : 640-643 . |
| MLA | 何秀萍 et al. "树的最大度距离排序" . | 福州大学学报（自然科学版） 38 . 5 (2010) : 640-643 . |
| APA | 何秀萍 , 常安 . 树的最大度距离排序 . | 福州大学学报（自然科学版） , 2010 , 38 (5) , 640-643 . |
| Export to | NoteExpress RIS BibTex |
Version ：
Abstract ：
记G(n)为所有n阶连通简单双圈图所掏成的集合.本文主要讨论G(n)按其度距离从小到大进行排序的问题,并确定了该序的前两个图及其相应的度距离,其中具有最小度距离的图是由星图K1,n-1的-个悬挂点与另外两个悬挂点之间各连上一条边所得的图Sn.
Keyword ：
双圈图 双圈图 序 序 度距离 度距离
Cite：
Copy from the list or Export to your reference management。
| GB/T 7714 | 何秀萍 . 具有最小度距离的双圈图 [J]. | 数学研究 , 2008 , 41 (4) : 434-438 . |
| MLA | 何秀萍 . "具有最小度距离的双圈图" . | 数学研究 41 . 4 (2008) : 434-438 . |
| APA | 何秀萍 . 具有最小度距离的双圈图 . | 数学研究 , 2008 , 41 (4) , 434-438 . |
| Export to | NoteExpress RIS BibTex |
Version ：
Export
| Results： |
Selected to |
| Format： |
