English  |  正體中文  |  简体中文  |  Items with full text/Total items : 27287/39131
Visitors : 2443955      Online Users : 42
RC Version 4.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
Scope Adv. Search
LoginUploadHelpAboutAdminister

Please use this identifier to cite or link to this item: http://ntour.ntou.edu.tw:8080/ir/handle/987654321/40461

Title: Broadcasting in Heterogeneous Tree Networks with Uncertainty
Authors: Cheng-Hsiao Tsou
Gen-Huey Chen
Ching-Chi Lin
Contributors: 國立臺灣海洋大學:電機工程學系
Keywords: uncertainty
algorithm
heterogeneous tree network
broadcasting
minmax-regret
Date: 2011
Issue Date: 2017-01-19T03:11:21Z
Publisher: International Symposium on Algorithms and Computation
Abstract: Abstract: We consider the broadcasting problem in heterogeneous tree networks T = (V(T),E(T)) with edge weight uncertainty, where the edge weight wu,v can take any value from [w − u,v, w+u,vwu,v+ ] with unknown distribution. The broadcasting problem with uncertainty is to find a “minmax-regret” broadcast center to minimize the worst-case loss in the objective function that may occur due to the uncertainty. In this paper, we propose an O(n logn loglogn)-time algorithm for the broadcasting problem with uncertainty in heterogeneous tree networks following the postal model.
URI: http://ntour.ntou.edu.tw:8080/ir/handle/987654321/40461
Appears in Collections:[資訊工程學系] 期刊論文

Files in This Item:

File Description SizeFormat
index.html0KbHTML62View/Open


All items in NTOUR are protected by copyright, with all rights reserved.

 


著作權政策宣告: 本網站之內容為國立臺灣海洋大學所收錄之機構典藏,無償提供學術研究與公眾教育等公益性使用,請合理使用本網站之內容,以尊重著作權人之權益。
網站維護: 海大圖資處 圖書系統組
DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - Feedback