combinational algorithm 中文意思是什麼

combinational algorithm 解釋
組合演算法
  1. First, the basic theory of the competitiveness is analyzed, evaluating indexes which conclude relative and absolute indexes basic on the last literatures are set up. second, because the data are too many and computing time is too long, the competitiveness of science and technology of 30 areas are clustered using fuzzy clustering model, the areas of the whole nation are clustered several kinds and we can draw some conclusions of same kind. evaluating the competitiveness using single model can produce white noise, so combinational models which concluding neural network, fuzzy theory and genetic algorithm are brought forward to evaluate the competitiveness of areas which are in the same kind with fujian province in the test

    本文首先分析科技競爭力的基本理論,並根據以往研究科技競爭力文獻,建立包含絕對指標和相對指標的評價科技競爭力評價指標體系,其次,針對評價福建省科技競爭力在全國范圍內的排名情況數據較多,計算時間較長的具體情況,利用模糊神經網路模型對全國30個省市自治區科技競爭力水平進行聚類分析,將科技競爭力水平接近的地區聚為一類,得出科技競爭力水平相近地區情況,而後,針對已有文獻科技競爭力評價只是利用單一模型可能產生噪聲,影響評價結果,並且主觀性較強的缺點,本文將神經網路、模糊數學、遺傳演算法等智能演算法組合,利用組合評價模型對福建省和與福建省同在一類的其它地區的科技競爭力水平進行橫向、縱向評價,得出福建省在全國范圍內的科技競爭力水平排名。
  2. 3 ) give the reduct algorithm and improved algorithm based on discernibility matrices. 4 ) give the algorithm of rules. 5 ) in this thesis, by using rs theory in the synthesis of combinational logic function, we can get minimal expression of logic function ; if by using rs theory in the rough control of boiler, we can get rough control rules

    對於前人提出的差別矩陣和差別函數的概念和定義,將其應用於信息系統中,用差別函數得到了最小約簡,然後,通過研究差別矩陣和差別函數的構造過程,提出了對差別矩陣降階和消元的策略,實例證明是有效的,起到了化簡差別矩陣和差別函數的目的; 4
  3. It is widely applied to the domain of combinational evolutionary problem seeking, self - adapt controlling, planning devising, machine learning and artificial life etc. however, there are multi - objective attributes in real - world optimization problems that always conflict, so the multi - objective genetic algorithm ( moga ) is put forward. moga can deal simultaneously with many objections, and find gradually pareto - optimal solutions

    由於現實世界中存在的問題往往呈現為多目標屬性,而且需要優化的多個目標之間又是相互沖突的,從而多目標遺傳演算法應運而生,它使得進化群體并行搜尋多個目標,並逐漸找到問題的最優解。
  4. Retiming has been used for many fields recently. regretfully, the retiming algorithm can not be used together with existing combinational optimization techniques

    遺憾的是,以前提出的重定時演算法不能很好地與組合優化方法結合起來。
  5. This paper discusses equivalence checking for combinational circuits and analyzes the key techniques of fan algorithm

    摘要討論了組合電路的等價性檢驗方法,分析了fan演算法的關鍵技術。
  6. We check equivalence of combinational circuits with fun algorithm, and experimental results show that fan algorithm is efficient

    利用該演算法進行了組合電路的等價性檢驗,實驗結果表明了該方法的有效性。
  7. It adopt an algorithm called binary - seek by character in the word rough segmentation. it also designs some efficient strategies to deal with the ambiguities and the unknown words, especially for combinational ambiguity, it designs a new disambiguated algorithm in case - learning method based on the structured similarity of the chinese sentences

    本文採用基於詞典的逐字二分查找方法實現粗切分,並對歧義切分和未登錄詞識別設計了相應的處理策略;特別是針對組合型歧義,本文提出了基於句子結構相似度的事例學習消歧方法。
分享友人