English  |  正體中文  |  简体中文  |  全文筆數/總筆數 : 8557/14866 (58%)
造訪人次 : 1402652      線上人數 : 2551
RC Version 6.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
搜尋範圍 查詢小技巧:
  • 您可在西文檢索詞彙前後加上"雙引號",以獲取較精準的檢索結果
  • 若欲以作者姓名搜尋,建議至進階搜尋限定作者欄位,可獲得較完整資料
  • 進階搜尋
    主頁登入上傳說明關於CHUR管理 到手機版


    請使用永久網址來引用或連結此文件: http://chur.chu.edu.tw/handle/987654321/32735


    題名: Station Decision Problem in Bicycle Ad Hoc Networks
    作者: 歐陽雯
    Ouyang, Wen
    貢獻者: 資訊工程學系
    Computer Science & Information Engineering
    關鍵詞: Station Decision Problem;Bicycle Ad Hoc Networks;Graph Theory;Public Bicycle Systems;reachability;richness
    日期: 2012
    上傳時間: 2014-06-27 02:02:51 (UTC+8)
    摘要: Biking has been more and more popular recently where public bicycle systems have been adopted in many cities around the world. However, to develop and design a successful public bicycle system is challenging. This work proposes a novel problem called Sta
    顯示於類別:[資訊工程學系] 研討會論文

    文件中的檔案:

    檔案 描述 大小格式瀏覽次數
    s_e331_0634.pdf32KbAdobe PDF41檢視/開啟


    在CHUR中所有的資料項目都受到原著作權保護.


    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - 回饋