minimum problem 中文意思是什麼
minimum problem
解釋
極小問題-
This paper research the mining press the meaning of the spirit system with the principle of basic theories and superior, application that press the windpipe net to compute the analysis method of the system theories, press the present condition of the spirit system to proceed to investigate the research to old factory tin mine of company of yunnan tin industry group, minimum tree principle within " diagram theories " of key problem, adoption that find out the esse, right pressed the windpipe net to proceeds the superior
本文闡述了研究礦山壓氣系統的意義和壓氣管網計算的基本理論及優化原理，並運用運籌學的分析方法，對雲南錫業集團公司老廠錫礦壓氣系統的現狀進行了詳細的調查研究。針對目前老廠錫礦壓氣系統存在的管網長、漏氣多、壓力損失大等主要問題，採用「圖論」中最小樹原理，對壓氣管網進行了優化研究。 -
In this paper, we study an on - line version of the two - dimensional bin packing problem that is the problem of packing a list of rectangular items into a minimum number of unit - square bins in an on - line manner. an on - line algorithm called rtdh ( refined two dimensional harmonic ) is proposed and analyzed. we show that rtdh can achieve an asymptotic worst - case ratio of less than 2. 7687, which beats the best - known bound 2. 85958
目前，對該問題的研究有各種演算法，主要有harmonic和round演算法，本文針對harmonic和round演算法存在的問題，提出一種演算法rtdh （ refinedtwodimensionalharmonic ） ，做了相應的分析，並且給出了該演算法的最壞性能比是2 . 7687的證明，這個結果刷新了目前最好的結果2 . 85958 。 -
Zhu had deduced generalized fenchel ' s duality theorem in [ 8 ], and further applied it to minimum discrimination information ( mdi ) problem
朱德通在文[ 8 ]中導出廣義的fenchel對偶定理，並將此定理成功地應用於帶約束的最小區別信息量問題（簡稱mdi問題） 。 -
Combining the international newest research result of multicast tree, this paper get a series of high efficiency arithmetic of multicast tree problem with the method of increasing storage space, and this paper also takes into account the dynamic capability of arithmetic. in many research fields of multicast tree, many high - efficiency solutions were obtained in this paper. this paper has broadly discussed about multicast tree problem and obtained dmdt ( dynamic minimum distance tree ), fmph ( fast minimum path cost heuristic ), dmph ( dynamic minimum path cost heuristic ) and fgmra ( fast group multicast routing arithmetic )
本篇論文對多播生成樹問題進行了比較全面的討論，涉及內容包括單約束的單樹多播、單約束的成組多播等多個方面，所提出的動態最短路徑樹演算法dmdt （ dynamicminimumdistancetree ） ，最小代價多播生成樹演算法fmph （ fastminimumpathcostheuristic ）動態最小代價多播生成樹演算法dmph （ dynamicminimumpathcostheuristic ） ，成組多播快速路由演算法fgmra （ fastgroupmulticastroutingarithmetic ） ，都取得了顯著的效果，是目前同類問題中比較好的解決方案，達到了預期的目的。 -
In the second part, for the purpose of poverty identification, we elaborate the poverty line and its types. by incorporating its determinants, i. e. minimum demand, income and other factors, the problem to choose poverty line is explored. we explained some popular methods to determine a poverty line, that is, shopping basket method, engle ’ s ratio method, international poverty line standard and life style method
從貧困的識別看，在定義並劃分貧困線之後，從最小需求和收入兩個基本要素出發，結合其他因素來確定貧困線，並著重分析了市場菜籃法、恩格爾系數法、國際貧困標準法、生活形態法四種主流的貧困線測量方法。 -
Another constrained problem is delay and delay variation constrained multicast routing problem. sp - dvma ( shortest path delay variation multicast algorithm ) algorithm based on minimum delay path is presented
第二類是時延和時延差約束的多播路由問題，提出了以最短時延路徑為基礎的一種演算法? ? sp - dvma演算法。 -
The delay and delay variation constrained minimum steiner tree problem is also researched. lcdvma ( low - cost delay variation - constrained multicast algorithm ) is proposed for this problem. low time complexity, low cost and constrained delay and low delay variation are achieved by only comparing minimum delay paths and minimum cost paths
對于時延和時延差約束的最小steiner樹問題，提出了一種基於最小時延路徑和最小費用路徑的演算法?一lcdvma演算法，由於該演算法比較了通過中轉節點后的最低費用路徑和最短時延路徑，降低了運算復雜度，通過模擬得到了較小的網路費用和時延差，因此lcdvma演算法是一種具有低復雜度的時延和時延差約束的最小steiner樹的啟發式演算法。 -
This subject will survey some of the applications of network flows and focus on key special cases of network flow problems including the following : the shortest path problem, the maximum flow problem, the minimum cost flow problem, and the multi - commodity flow problem
這個主題將審視一些網流的應用並集中焦點在以下網流問題的關鍵特殊情況:最短路徑問題，最大流量問題，最少成本流量問題，和多元物品流量問題。 -
Because ga possesses the traits of can global random search, the robustness is strong, been use briefly and broadly, it didn ’ t use path search, and use probability search, didn ’ t care inherence rule of problem itself, can search the global optimum points effectively and rapidly in great vector space of complicated, many peak values, cannot differentiable. so it can offset the shortages of nn study algorithm, can reduce the possibility that the minimum value get into local greatly, the speed of convergence can improve, interpolation time shorten greatly, the quantity of training reduce
因為遺傳演算法具有全局隨機搜索能力，魯棒性強、使用簡單和廣泛的特點，它不採用路徑搜索，而採用概率搜索，不用關心問題本身的內在規律，能夠在復雜的、多峰值的、不可微的大矢量空間中迅速有效地尋找到全局最優解，所以可以彌補神經網路學習演算法的不足，使陷入局部最小值的可能性大大減少，使得收斂速度提高，訓練量減小。 -
3 g 一 g g abasi 叱 加 ical pp 訕 howthe qquasi ghgsical 毗 quasi sociological methodmo 止 secondlx we uthuther nalsze the nhrsical model on which he quasi pnsical and quasi sociological methods for solving s 肛 problembased considering a physical hypothesis on this model ， we construct a counterexaxnple to showthatthe hypothesis is not eee ? howeve 二 itdoes notdamage the goodpractical effectof applpinp this phpsical model to solve s 盯 problem considering he existence of alsorithlnic region ， which reflects that the quasi sociological method is very necessw for ass 吶 ng the high efficient of theent whole algori 燦 m therefore deepens our comprehension on the quasi physical and quasi sociological methods mird1x we wpl … 叫 nas 恤 ysi 陰 1md q 阻 si 500i 吶 i0alm 毗 cd 引 0 咖 we mathematical problem ofcom 恤 non oforthogonal tmles m successfully es 恤 fish a physicalopttrizatbo model for sotring saturated o 汕 ogonal tables ， whwh ws provedto be correctintheo0 we thi 冰 。 w goodpersonated s 咖 egies forjumping out of the t 呷 oflocal minimum using quasi sociological method based onthe physical model thus wegetthe wholequasi physicaland quasi sociological algorim forthe problem ofconswction ofs 咖 med orthogonal tables he experimental results showthatthephysical model ishighly efficientthanthe conflmng nlllllber mode ！ based on me pure m 她 ematical 訕 kgfound 他 sucoes 訕 11y ? ? rk 咖 m 枷 ons 訕 卿 nal 郵 ie with 3 leve13 using th 叫 u 1 physical and quasi sociological algori 恤 we got some o 汕 ogonal t 勸 les ofl 。 ， （ 3 ’ ‘ ） which are not isomorphic moreove 乙 some ofour results are also not isomorphic to oe results pearedb 山 e open rekrences we got lip to now lastlx for 讓 卜 ancie 口 戊 扯 d importantproblemsofconstfutfuction oflatin square and orthogonal latin squares （ most of
應用此演算法，我們成功地計算出難的三水平正交表本課題為國家重點基礎研究發展「九七三」規劃，國家「八六三」高技術發展計劃，高等學校博士學位點專項科研基金及中國科學院軟體研究所計算機科學開放研究實驗室課題基金資助項目1g一gs第四，應用擬物擬人方法嘗試求解古老而重要的拉丁方、正交拉丁方（它們事實上是正交表）問題。我們結合這些問題的特性，建立了新的物理模型，從理論上證明了這些物理模型的正確性，並設計出擬人化的「跳出局部極小值陷餅」的策略，得到了求解拉丁方、正交拉丁方的擬物擬人演算法。實驗表明， 」對某些問題演算法有好的效果。 -
Are specially designed for those who wish to gain the latest web development knowledge in the shortest time with minimum hassles. the web development and design training courses focus on the home page design technology, combined with the latest development in this field, which include use of popular web page editors, graphic image software, cgi and java scripts, web site management etc. the training course takes the form of demonstration, lab practice, problem solving, and free after - course consulting
為了幫助那些希望趕上時代發展，不痛失此良機，而又初涉網際網路和網站設計的人員能夠啟動他們的網上業務，提高網頁製作技能，也為了更好地完善我們的售後服務工作，從而滿足客戶對網頁製作各方面的需求，易通網業專門推出網站策劃設計培訓這個項目。 -
Genetic programming is delivering human - competitive machine intelligence with a minimum of human involvement for each new problem and without using either logical deduction or a database of human knowledge
遺傳規劃在解決每一個新問題時，都是在人類極少參與的狀況下，自行發展出與人類相當的機器智慧，而且既未採用邏輯推演，也沒有採用人類知識資料庫。 -
Concretely we discuss the application of the shortest path problem, traveling salesman problerm and project management method on the touring itinerary improvement of travel agency. furthermore, we explore the use of minimum spanning tree problem, overlaid problerm and maximum flow problerm on the touring itinerary improvement of scenic spots. and also enclosed detailed spreadsheet solutions
具體的，討論了最短路問題、旅行商問題和排程問題在旅行社線路優化中的應用；討論了最小支撐樹問題、覆蓋問題和最大流問題在旅遊景區線路優化中的運用，並在附錄中給出了詳細的電子表格解法。 -
Firstly, a 0 - 1 integer programming mathematical model is constructed to describe tail - number - assigning work happened in domestic airline, since the problem is npc, a unified polynomial algorithm which satisfies engineering requirement is unavailable. illuminated by the practical experience, a specific tna problem is classified into one of three typical tna modes : tna based on fleet dispatching commands, tna based on fleet balance application, tna based on minimum fleet requirement ; secondly, by simplifying and relaxing some minor constraints, corresponding mathematical models and heuristic algorithms are reconstructed for each typical tna mode ; finally, computing complexities are discussed
為此論文在借鑒手工編制排班計劃經驗的基礎上，將一個具體的飛機排班問題，歸結為三種典型排班模式中的一種，即：基於飛機調度指令要求的排班問題，基於飛機使用均衡要求的排班問題和基於最少需用飛機數的排班問題，對于每種典型的飛機排班模式，在對次要的約束條件進行簡化、松馳的基礎上構造出相應的能夠滿足工程應用要求的啟發式演算法，並分析了演算法的復雜性。 -
It is the main problem that how we make out the uncertain surplus and minimum interest rate guaranteed which constitutes the expense of the participation policy
我們可將分紅保單投保人視為向壽險公司購買了一份身故保障、按比例分得投資收益以及以保證最低收益率為執行價格的歐式看跌期權的組合。 -
The minimum erathwork of slope cutting is regarded as target function, and the anticipated factor of safety of slope as a constraint condition, so this problem is equivalent to optimality one with constraint conditions. thus the optimal scheme of slope cutting can be obtained
這里將最小的削坡土方量作為目標函數，將預期的邊坡安全系數作為約束條件，把削坡問題等價於一個有約束的優化問題，可找出最優的削坡方案。 -
Semi on - line scheduling problem for maximizing the minimum machine completion time on m identical machines
臺同型機極大化最小機器負載的半在線問題 -
I ask to write very how the course of order looks ?. what are the haulage ? is minimum order required ? nio and whether mail to poland does not it inflict problem
夾雜著波蘭語的客戶的信，我實在看不懂他什麼意思!大夥給個意見，順便說一下該怎麼回 -
We proposed an improved simulated annealing algorithm with neighbor function based on self - optimization of scale parameter. furthermore incorporating disaster - modification and the improved annealing into genetic algorithm, an improved genetic - annealing algorithm is proposed. in order to solve the deceptive minimum problem, an improved evolutionary strategy combined with similarity detection and improved mutation operator
提出了鄰域尺度函數自尋優的模擬褪火演算法，結合遺傳演算法，引入災變運算元，提出了改進遺傳模擬褪火演算法；為了解決尋優過程中的最小欺騙問題，我們提出了相似性檢測，結合改進的適應值無關變異運算元，提出了基於相似性檢測和適應值無關變異運算元的進化策略演算法。 -
A new genetic neural network is to conduc the non - rigid modeling, which is first put forward, in accordance with some drawbacks of the current software compensation, which include low accuracy and trouble some expressions. and the current difficult questions, which include local minimum problem and the selection of the number of neural network hidden units, are done
針對現有誤差補償過程中精度較低等問題，提出了一種改進的遺傳神經網路演算法建立三坐標測量機非剛性誤差模型，這種演算法克服了現有bp演算法神經網路建模存在的局部極小點、網路隱單元數選擇等問題。
分享友人