A reversing traversal algorithm to predict deleting node for the optimal k-node set reliability with capacity constraint of distributed systems

顯示簡易詮釋資料 統計資料

檔案

所屬典藏: 期刊論文

引用此條目

Yeh, Y., & Chiu, C. (2001). A reversing traversal algorithm to predict deleting node for the optimal k-node set reliability with capacity constraint of distributed systems. COMPUTER COMMUNICATIONS, 24(3-4), 422–433. https://doi.org/10.1016/S0140-3664(00)00242-5

BibTeX RIS

引用文字依 APA 第 7 版格式自動產生,使用前請再核對。

分享

永久網址:https://ir.lib.nycu.edu.tw/handle/11536/29850