查詢結果分析
來源資料
相關文獻
- The Cosine Simplex Algorithm
- A Simple Algorithm to Search for All d-MCs
- 以灰色線性規劃為基礎之重新調度法作動態發電分配
- Minimum-Torque Trajectory Planning of Redundant Manipulators between Two Joint Configurations
- A Novel Track Accessing Servo Design for a Dual Actuator System
- 以資料包絡法評量我國大學校院之教育品質
- 架構電腦整合生產管理系統的二階段模糊規劃模型
- 模糊線性規劃於水資源規劃之應用
- 水庫標的線性規劃問題之網路切割法簡介
- Revised Simplex Method在電腦飼料配方上之應用
頁籤選單縮合
題名 | A Simple Algorithm to Search for All d-MCs=求解d-MC的簡捷法 |
---|---|
作者 | 葉維彰; Yeh, Wei-chang; |
期刊 | 逢甲學報 |
出版日期 | 20001200 |
卷期 | 38 2000.12[民89.12] |
頁次 | 頁83-88 |
分類號 | 440.11 |
語文 | eng |
關鍵詞 | 限制性最佳化問題; 線性規劃; 簡算法; 餘弦啟發法則; Reliability; Limited-flow network; MC; D-MC; |
中文摘要 | 隨著資訊時代的來臨,電腦與通訊網路已經是我們日常生活中所不能缺少的設施,若能針對此種流量網系統進行績效評估,則將有助於瞭解系統執行的品質與能力,以便做為既有系統維護或改善以及新設系統設計、運作或規劃時重要的參考依據。然在評估一個流量網路系統之執行效率時,可靠度為最主要的指標。而此可靠度的計算為多重NP-hard問題,其解法比較複雜困難。在本研究中,假設全部MC均為已知,而將焦點集中於如何於計算可靠度之前,先將d-MC全部予以求出。所發展的方法不僅比現存用於求解本問題之最佳演算法還更有效率,同時更簡潔易懂。最後,並以一範例來加以驗證並示範所提出之方法。 |
英文摘要 | With the arrival of the information age, computer links and communication via the information superhighway have become indispensable in our daily life. Evaluation of the traffic on the superhighway has shown potential in assisting the understanding of the nature and capabilities of the net. Such an evaluatio can be utilized as an important reference in the design, operation, and planning of new systems. Reliability of a system is considered as the most important indication in the evaluation of operational efficiency in a communications network. However the process of ascertaining reliability is a very complicated and multiple NP-hard problem. In this study, all MCs is assumed to be known in advance and we focused on how to find the entire d-MCs before calculating the reliability value of a network. Just based on the definition of d-MC, we develop an intuitive algorithm which is better than the desk-known exitsing method. Analysis of our algorithm and comparison to existing algorithms shows that our proposed method is easier to understand and implement. Finally, the computational complexity of the proposed algorithm is analyzed and compared with the existing methods. |
本系統之摘要資訊系依該期刊論文摘要之資訊為主。