solution space 中文意思是什麼

solution space 解釋
合適用地；合適地點
  • solution : n. 1. 溶解；溶液，溶體，溶劑。2. （補輪胎用的）橡膠水；〈美國〉藥水。3. 解決，解答 （of; for; to）; 解釋；（數學等的）解法，解式。4. 免除，解除。5. 【醫學】消散，消退。
  • space : n 1 空間；太空。2 空隙，空地；場地；（火車輪船飛機中的）座位；餘地；篇幅。3 空白；間隔；距離。4 ...
  1. The discussion will be generalized, with no measurement data provided because my goal is to encourage architects and designers to look at the impact of the choices on the bigger solution space

    討論是一般性的，沒有提供測量數據，因為目的是鼓勵架構師和設計人員在更大的解決方案空間中考慮不同選擇的影響。
  2. The three kinds of construction graph can be applied to optimization problems with different characteristics, and the two kinds of layered construction graph are more suitable for complex multi - stage dynamic decision problems ( cmsddp ) than scg. the clcg defines smaller solution building blocks and is able to perform better in large - scale cmsddps than the blcg. 2. the construction graph of aco algorithms need statically describe the whole solution space ( or discrete solution spa

    （ 2 ）蟻群優化演算法的解構造圖一般要靜態地描述整個解空間（或者是離散化了的解空間） ，對于大規劃動態決策問題，不僅存在描述解空間的困難，而且讓蟻群在迭代過程中始終在整個解空間中進行搜索，搜索性能會很低。
  3. Its foundation absorbs the cooperatively evolution idea of hybs & gero ' s disjunction of problem space and solution space, and the ideology of collaboration in parallel engineering. it divides engineering optimization task to scheme design and detail design

    該演算法吸收了hvbs & cero提出的問題空間與解空間分離協同演化（ co - evolution ）的思想以及并行工程的協同設計思想，將工程優化任務分解為方案設計和細部設計兩部分。
  4. Genetic algorithm, as a computational model simulating the biological evolution process of the genetic selection theory of dar - win, is a whole new global optimization algorithm and is widely used in many fields with its remarkable characteristic of simplicity, commonability, stability, suitability for parallel processing, high - efficiency, and practibility. on the other hand, there are many op - timization problems in the field of digital image processing, such as image compression, pattern - recognition, image rectification, image segmentation, 3d image recovery, image inquiry, and or so. in fact all these problems can be generalized as the problem of searching for a global optimal solution in a large solution space, which is the classic application field of genetic algorithm

    遺傳演算法是模擬達爾文的遺傳選擇和自然淘汰的生物進化過程的計算模型，是一種新的全局優化搜索演算法，具有簡單通用、穩定性強、適于并行處理以及高效、實用等顯著特點，在很多領域得到了廣泛應用，另一方面，在圖像處理領域有很多優化問題如圖像壓縮，模式識別，圖像校準，圖像分割，三維重建，圖像檢索等等，實際上都等同於一個大范圍搜索尋優問題，而最優化問題是遺傳演算法經典應用領域，因此遺傳演算法完全勝任在圖像處理中優化方面的計算。
  5. The problems of solution space and unique solution of system are defined and discussed

    定義並分析了系統的解空間。
  6. We refer to the elements in the problem space and their representations in the solution space as “ objects

    問題空間中的元素和它們在解空間中的繼承被稱作"對象"
  7. Firstly, optimization variables are expressed by chaotic variables through solution space transformation, and the chaotic variables are coded into an antibody

    首先利用解空間變換將優化變量表示為混沌變量，並將混沌變量編碼為抗體。
  8. A smoothing technique is combined with optimum approximation and finite element piece - wise interpolation in the method, it can simultaneously process measured vector components, imp ro ve smoothing capability of solution, space composed of original discrete points and increase the accuracy of the solution, especialy its derivatives

    該方法結合最佳逼近、有限元分片插值與光順技巧，對測量向量各獨立分量進行處理，改善了原離散點構成的解空間的光滑性，提高了解尤其是導數場的精度，在測量區域內再現了光順向量函數及連續的導數。
  9. Developing a software is actually a transformation from the " problem space " to the " solution space "

    摘要軟體開發過程實際上是「問題空間」向「方案空間」的轉換過程。
  10. In addition, we make research on the convergence of genetic algorithms by analyzing the globality and monotonicity of the schemata. it is demonstrated that for some kinds of the problems, the method of searching global best schemata can greatly decrease the ix abstract solution space and lead to converging quickly and successfully to the optimum. the monotonicity of schemata is used to determine deceptive problems and, with the aid of absorbing schemata, to analyze the schematic factors leading to ga - hard problems

    另外，通過分析模式的全局性和單調性，證明對于某些問題搜索其全局最優模式可以大大縮小解空間，從而導致更快、更順利地收斂到最優解，並把模式的單調性用於對遺傳演算法欺騙問題的劃分，結合吸收模式的性質，進一步探討影響遺傳演算法困難的模式因素。
  11. Through such a study, it is also shown that when the time delay is long enough such that the stability switches of the equilibrium of system halt, the bifurcation branches originated from the critical time delays cannot be surely stable or unstable in the whole solution space, that is, their stability depends on cases. this phenomenon also implies that the stability of the periodic solutions on the bifurcation diagrams indicates only the stability on the local center manifo ld. some distinguished features of delay dyn

    利用打靶法的數值結果說明了當系統平衡點不再發生穩定性切換時，源自這些臨界時滯處的解支的穩定性在整個解空間的穩定性具有不可判定性，這也說明由多尺度法所得高階近似判定的解支的穩定性事實上只表示解支在局部中心流形上的穩定性，而非在整個解空間中的穩定性。
  12. Because of substantive involvement of additional assumption on the solution space, the constrained inverse problem is more difficult to deal with and it can not be solved by unconstrained regularization without modification

    因為在解決實際問題中對解空間的附加假設，若用無約束的正則化方法不加修改的解決帶約束的反問題則比較困難。
  13. Analyzed the similarity between scheme solving problem and traveling salesman problem ( tsp ), the scheme solving problem for conceptual design is transformed into an optimal path problem in combinatorial optimization, where the dynamic programming based solution space model and the longest path based optimization model are developed

    摘要通過分析概念設計方案求解問題與旅行商問題的相似性，將方案求解問題轉化為組合優化的最優路徑問題，建立了基於動態規劃的解空間模型和基於最長路徑的優化模型。
  14. It is also a unattached modeling tool, the most important point of which is able to design and change conveniently comparing with other modeling tools for uml. a reasonable software system architecture should be composed of the oo ( aspect - object ) module and the aop ( aspect - oriented programming ) module, thus, the maintenance will be easy and the concept is in focus. the aop method brought advantage in different periods and abstracted levels of software life cycle, it can be used both in question space ( analysis, design and modeling ) and solution space ( implement and code )

    第一部分闡述了開發gmt的項目背景;第二部分從系統需求出發，提出了領域建模和面向方面建模的概念以及系統的技術支持;第三部分介紹了統一建模語言uml （ unifiedmodelinglanguage ）以及對uml進行擴展的機制，還介紹了元對象設施mof （ metaobjectfacility ）的元層次和元建模結構;第四部分主要介紹系統的實現要點，提出了兩階段建模的概念及優勢以及系統如何實現對面向方面的支持;第五部分是系統的設計與實現，詳述了系統的主要功能和體系結構，並使用一個例子來說明元建模和建模的具體過程及系統的部署結構;最後兩部分是文章的結論和參考文獻。
  15. Secondly, by making use of the characteristics of ergodicity and randomness of chaotic variables, the local search is performed by chaotic search in the neighborhoods of high affinity antibodies, and the chaotic search is carried out in the whole solution space to avoid sticking at local optima

    然後，利用混沌變量的遍歷性和隨機性特點，通過在高親和力抗體的鄰域內進行混沌搜索以實現局部尋優，通過在整個解空間內的混沌搜索來避免陷入局部最優解。
  16. We introduce a method that the line - plane relation in the geometry space can be determined by analyzing the structure of the solution space of the derived - system of the system of linear equation

    摘要講述了如何通過分析線性方程組導出組的解空間結構去判定幾何空間中的線面關系。
  17. 6. based on the physical model of the solution space, analyze the relationship between the workspace and the parameters of the manipulator, the optimal value of the parameters is obtained

    利用機構的空間模型，分析了機構工作空間的大小與其結構參數的關系，得到了為獲得最大工作空間r _ 1 、 r _ 2 、 r _ 3 、 r _ 4的最佳取值。
  18. Based on the solution space analysis of the quadratic assignment problem, we tried to apply the solution schema to ant system algorithm, and made an experiment on the four classes problem of qap

    在對二次分配問題qap解空間地形分析的基礎上，提出了解模式在螞蟻演算法中的應用，並且在qap的四類問題上進行了實驗。
  19. Possible solution space

    可能合適的用地
  20. The method to construct bvl is designed through judging the angle of sample and solution space

    通過分析樣本矢量和解空間的夾角，推導了基矢量的判斷準則。
分享友人
分享到 Line

分享到臉書