algorithms for optimization 中文意思是什麼

algorithms for optimization 解釋
最優化演算法
  • algorithms : 演算法式
  • for : FOR f o r ＝ free on rail 【商業】火車上交貨（價格）。1 〈表示目標、去向〉向，往。 leave [sail] f...
  • optimization : n. 最佳化，最優化。
  1. He is a phd candidate at the university of piraeus ( “ optimization algorithms for container terminal operations and decision support systems ” )

    他已經獲得紐約城市大學電子工程學士學位和紐約曼哈頓學院的計算機工程科學碩士學位。
  2. Ant colony optimization algorithms ( acoas ) were appropriate for this optimization problem

    採用蟻群演算法求解調度模型。
  3. The mathematical model for two - level hierarchical system optimization and their decomposition - coordination algorithms

    二階遞階系統優化的數學模型及其分解協調演算法
  4. 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 ）蟻群優化演算法的解構造圖一般要靜態地描述整個解空間（或者是離散化了的解空間） ，對于大規劃動態決策問題，不僅存在描述解空間的困難，而且讓蟻群在迭代過程中始終在整個解空間中進行搜索，搜索性能會很低。
  5. Optimization algorithms for semi - markov control processes with average criteria

    控制過程在平均準則下的優化演算法
  6. Based on the analysis of the features, key procedure and research tendency of various algorithms for cutting stock problem, this paper proposes that the increasing of material utility ratio can not be reached by solving cutting stock problem only. a integrated solution should be resolved from both management and application optimization technology in view of system engineering

    通過分析各排樣演算法的特點、關鍵步驟與研究趨勢，本文從系統工程的觀點出發，指出提高材料利用率不僅僅只是一個排樣問題的求解，而是要從下料生產管理和優化技術方法兩個方面同時入手，建立完整的解決方案。
  7. Genetic algorithms for model optimization of on - chip spiral inductors

    基於遺傳演算法的片上螺旋電感模型優化方法
  8. So a lot of researchers have attached importance to optimization computing, and put forward all kinds of algotithms for optimization problems, for instance : simplex algorithm, dynamic programming algorithm, branch - bound algorithm, etc. but these algorithms are all disadvantage and can not be applied to complex nonlinear optimization problems

    為了解決各種優化計算問題，人們提出了各種各樣的優化計算方法，如單純形法、梯度法、動態規劃法、分枝剪界法。這些優化演算法各有各的長處，各有各的適用范圍，也有各自的限制。
  9. But as a good optimization method, the researches on using tabu search as the learning algorithms for fuzzy neural networks are very few

    然而，目前使用禁忌搜索演算法作為模糊神經網路參數學習演算法的研究卻不多見。
  10. Results showed csa had strong ability of function optimization and maintaining diversity. it was one of effective algorithms for multi - modal functions and non - stationary functions optimization

    研究結果表明，該演算法優化能力和保持模式多樣性的能力較強，能夠獲得較好的多模態函數和時變函數優化效果。
  11. Some important algorithms for nonlinear optimization problems are studied in this dissertation. the aim of this dissertation is to give some theoretical analysis. chapter 1 is the introduction of this dissertation, which introduces the variational inequality problem and the complementarity problem, the context of this dissertation and the main results obtained in this dissertation

    本文主要是對非線性最優化問題中的若干重要演算法的理論分析作了探討，包括約束最優化問題中的梯度投影方法以及求解變分不等式和互補問題的幾類演算法，主要是集中在這幾種演算法的收斂性分析上。
  12. Obviously, the artificial ground motions used for structural time history analysis should well coincide with multi - damping - ratio - spectra. based on the comparison of the conventional algorithms for multi - objective optimization and genetic algorithms, a method for the simulation of multi - damping - ratio - spectra is proposed in the thesis which combines the multi - objective optimization algorithms and genetic algorithms. the program corresponding to the method is also developed and the method is proved to be feasible and convenient by an example at the end of the thesis

    本文通過分析多目標優化問題的解的意義和常用解法，在比較現有的幾種常用優化演算法的基礎上，選用遺傳演算法這種自適應全局優化概率搜尋演算法作為本文的搜尋方法，將其與多目標優化理論有機地結合在一起，形成多目標遺傳演算法，並將其引入地震動模擬，形成基於遺傳演算法擬合多阻尼比反應譜的地震動模擬程序。
  13. This dissertation studies mainly theories and according numerical implementation of a class of dual algorithms for nonlinear optimization problems, including unconstrained minimax problems and constrained nonlinear programming problems

    本文主要研究非線性優化中的一類對偶演算法，包括無約束極大極小問題的對偶演算法和約束非線性規劃問題的一類對偶演算法的理論與相應的數值實現。
  14. Chapter 1, making use of the technique of pivoting operation, the technique of sequential systems of linear equations of studying constrained optimization problems and the idea of strongly subfeasible directions method and, several new algorithms for systems of nonlinear inequalities are presented

    第一章，藉助于轉軸運算技術，序列線性方程組技術以及強次可行方向法思想，建立了非線性不等式組的序列線性方程組演算法，演算法的搜索方向由有唯一解的線性方程組的解及其校正產生。
  15. Presenting optimization algorithms for extended stga extending the syntax of the script language to definite the verification problem, and implementing the compilation and stga generation module for this language ; incorporating the module with the core verification algorithm ; demonstrating the validation and analyzing the performance of the tool with some real - world examples

    ?擴充檢測問題的定義語言?腳本語言的格式，使用sml語言實現了腳本語言的編譯和擴展stga圖生成模塊，並將該模塊和檢測演算法核心連接，實現了整個工具。論文還結合應用實例證明了擴展工作的有效性並分析了工具的性能。
  16. Chapter 2 establishes the theoretical framework of a class of dual algorithms for solving nonlinear optimization problems with inequality constraints. we prove, under some mild assumptions, the local convergence theorem for this class of dual algorithms and present the error bound for approximate solutions. the modified barrier function methods of polyak ( 1992 ) and the augmented lagrange function method of bertsekas ( 1982 ) are verified to be the special cases of the class of dual algorithms

    第2章建立求解不等式約束優化問題的一類對偶演算法的理論框架，在適當的假設條件下，證明了該類演算法的局部收斂性質，並給出近似解的誤差界，驗證了polyak （ 1992 ）的修正障礙函數演算法以及bertsekas （ 1982 ）的增廣lagrange函數演算法都是這類演算法的特例。
  17. By comparing these two methods, we show the advantages of quasi - monte carlo method. we also introduce the standard monte carlo random search for optimization. the last but not least application is metropolis algorithms which is the origin of monte carlo method

    第1章介紹了蒙特卡羅和擬蒙特卡羅積分的誤差估計並闡述了擬蒙特卡羅方法的優勢，同時介紹了擬蒙特卡羅的標準優化方法，最後介紹了蒙特卡羅方法的起源? metropolis模擬方法。
  18. Two asynchronous parallel algorithms for function optimization

    求解函數優化問題的兩種異步并行演算法
  19. Research on the genetic algorithms for linear constraint optimization problems

    線性約束優化問題的遺傳優化方法研究
  20. The video phone system designed by us is mainly the real - time implement of a - v codec the implement of h. 323 protocol stack and the implement of the network communication protocol for example pppoe smtp and pop3 etc. so we not only ensure that the qos of the a - v codec ' s datum, but also develop the increment services for example e - mail system and browser etc. the paper will emphasis on the graft and realization of the internet protocols h. 263 video codec rate control algorithms for video encoder and optimization methods of the codec based on tm1300. h. 323 sip, h. 264 and psos + are also simply introduced

    本文主要針對作者在實現ip可視電話系統中所從事的研究工作而展開的，將重點放在ip可視電話系統中tcp ip協議棧在psos +上的移植、網路通信協議如pppoe 、 ppp 、 smtp 、 imap 、 pop3 、 dns 、 dhcp等協議的實現、 h . 263視頻編碼及其碼率控制演算法研究、視頻編碼中基於程序結構和7m1300dsp專用指令的優化方法，同時初步介紹h . 323 、 sip 、 h . 264及嵌入式系統中的實時操作系統（ rtos ） psos + 。
分享友人
分享到 Line

分享到臉書