3781.  含住宿及興趣景點考量之旅遊規劃系統

盧濟安; Lu, Chi-an ,  2009
[資訊管理學系暨研究所] 學位論文
the required spots, hotels, and paths; optional spots of varying interest levels; the per day upper and lower bounds for touring time and distance

3782.  利用影像中物件空間位置關係之相似尋取

張博淵; Chang, Bo-yuan ,  2005
[資訊管理學系暨研究所] 學位論文
topic all the time. In this field, Content-Based Image Retrieval (CBIR) technology is a trend on the image databases design at present. Generally

3783.  IEEE 802.16j 都會型網路下的可適性分散式排程機制

黃偉嘉; Huang, Wei-chia ,  2009
[資訊工程學系暨研究所] 學位論文
provide QoS guarantee and additionally enhance the QoS for real-time service. Simulation results show that our proposed scheduling scheme can

3784.  Performance of OFDM systems over rayieigh fading channel using RLS feq

李圖恩; Lee, Tu-en ,  2006
[電機工程學系暨研究所] 學位論文
that the scheme works well for slow fading channels. 2006 [1] J.A.C. Bingham, “Multicarrier modulation for data transmission: an idea whose time has

3785.  高效率能源排程於無線網路之應用

黃教昌; Huang, Chiao-chang ,  2009
[電機工程學系暨研究所] 學位論文
與Data window 兩個部份，而Data window 又會切割成數個相同長度的Time Slot，在Beacon訊框+DTIM期間，AP依資料量與電池剩餘量，依一定比例作Shortest first的排序，在Data Window 中工作站將依據AP的輪詢，傳送資料，因此當先傳送的裝置，傳送

3786.  無線感測網路中省電型媒體存取控制協定之探討

林志信; Lin, Chin-shin ,  2007
[電機工程學系暨研究所] 學位論文
to the base station. The active time of nodes whose height difference = 1 is set to be continuous to reduce transmission latency, while the active time

3787.  Channel estimation for relay based cooperative communication systems

顏進益; Yen, Chin-yi ,  2008
[電機工程學系暨研究所] 學位論文
channel,” IEEE Trans. Inform. Theory, vol. 25, pp. 572–584, Sept. 1979. [3] J.N. Laneman, G.W. Wornell, “Distributed space-time-coded protocols

3788.  基於次巨集區塊固定取樣點SSAD預測SAD的移動估算法

陳坤勝; Chen, Kun-sheng ,  2008
[電機工程學系暨研究所] 學位論文
, computational complexity and computational loading. Therefore, the issue of macro blocks matching has been discussed for a long time. In the past

3789.  Design of dynamically assignmentable TAM width for testing core-based SOCs

陳建勳; Chen, Chien-shiun ,  2006
[電機工程學系暨研究所] 學位論文
time)的改變，時間點上的測試資源(TAM)的數量也有所不同；因此，Core的測試也就隨著測試資源(TAM)數量而改變。如此，一個Core的測試排程會宛如階梯的形狀，我們稱之為梯狀排程(Stairway Schedule)。 在我們的演算法中，我們利用傳統階梯點的計算去產生我們初始Core矩

3790.  無線感測網路中高能源效率群組化方法之探討

楊勝雄; Yang, Sheng-hsiung ,  2008
[電機工程學系暨研究所] 學位論文
clustering information overhead and optimal cluster-head selection. It uses node residual energy to compute the clustering waiting time of each node