逢甲學報, Band 36逢甲大學, 1999 |
Im Buch
Ergebnisse 1-3 von 24
Seite 38
... solution . At each subsequent iteration of the algorithm the most promising constraint ( according to the cosine criterion described below ) violated by the solution to the current subsidiary problem is appended to the current ...
... solution . At each subsequent iteration of the algorithm the most promising constraint ( according to the cosine criterion described below ) violated by the solution to the current subsidiary problem is appended to the current ...
Seite 39
... solution . The initial subsidiary problem to be solved is Maximize subject to Z = c1x arx sbr X ≥ 0 , which is a bounded problem . It follows that in Step 3 below the dual simplex algorithm yields an optimal solution for each new ...
... solution . The initial subsidiary problem to be solved is Maximize subject to Z = c1x arx sbr X ≥ 0 , which is a bounded problem . It follows that in Step 3 below the dual simplex algorithm yields an optimal solution for each new ...
Seite 62
... solution Pareto solution 候選解圖 3.1 訓練集和檢驗集資料產生的流程分類樣本是在設計分類器時,根據欲解決的問題領域,採集樣本所得的集合。集合中的每一個物件都可由一個特徵向量所表示,並且已知每一物件的類別由圖 3.1 中可以很清楚地看出輸入資料製作 ...
... solution Pareto solution 候選解圖 3.1 訓練集和檢驗集資料產生的流程分類樣本是在設計分類器時,根據欲解決的問題領域,採集樣本所得的集合。集合中的每一個物件都可由一個特徵向量所表示,並且已知每一物件的類別由圖 3.1 中可以很清楚地看出輸入資料製作 ...