Two-Way Greedy Sort and Ratio Cut Technique for Optimal Linear Arrangement
碩士 === 南華大學 === 資訊管理學研究所 === 96 === Wireless broadcasting environment, the use of bandwidth is still one of the hottest topics. So the limited bandwidth of information on how to make broadcasting more efficient for wireless networks on one of the main themes. However server-side (Server) efficient...
Main Authors: | Chao-hsun Wu, 吳昭勳 |
---|---|
Other Authors: | Te-chien Tsai |
Format: | Others |
Language: | zh-TW |
Published: |
2008
|
Online Access: | http://ndltd.ncl.edu.tw/handle/81900036379154951727 |
Similar Items
-
Correction of failure in linear antenna arrays with greedy sparseness constrained optimization technique
by: Khan, S. U., et al.
Published: (2017) -
Correction of failure in linear antenna arrays with greedy sparseness constrained optimization technique.
by: Shafqat Ullah Khan, et al.
Published: (2017-01-01) -
GANC: greedy agglomerative normalized cut
by: Tabatabaei, Seyed Salim
Published: (2011) -
Sorting permutations by cut-circularize-linearize-and-paste operations
by: Huang Keng-Hsuan, et al.
Published: (2011-11-01) -
Pair Ordering Technique for Optimal Linear Arrangement Problem
by: Yung-sheng Yeh, et al.
Published: (2008)