您要查找的是不是：
- Optimality Conditions for Set-Valued Vector Minimization Problem 集值向量極小化問(wèn)題的最優(yōu)性條件
- This paper presents a solution to the test time minimization problem for core-based systems. 本文針對基于芯核系統的測試時(shí)間最小化問(wèn)題提出了一種解決方案。
- So long as this minimization problem is solved, the whole system is asymptotically stable. 只要該最小化問(wèn)題有解，則整個(gè)系統是漸近穩定的。
- For the total completion time minimization problem on two machines with decision maintenance, the worst-case analysis of SPT algorithm was given. 對于決策維護最小化總完工時(shí)間問(wèn)題，分析了SPT算法的界。
- For the make-span minimization problem on two machines with periodic maintenance, it was shown that FFD algorithm was an efficient algorithm. 對于周期維護最小化時(shí)間表長(cháng)問(wèn)題，證明了經(jīng)典的FFD算法是一個(gè)很好的啟發(fā)式算法，并且得到了該算法的一個(gè)上界。
- A causal residual generator is obtained by making use of the ununiqueness of the optimal solutions to the minimization problem. 然后，利用該最小化問(wèn)題解不唯一的特點(diǎn)，求得滿(mǎn)足因果關(guān)系的最優(yōu)殘差產(chǎn)生器。
- Third, we introduce an analytical placement approach as a convex quadratic program formulation of the power minimization problem. 第三，我們介紹一種分析式擺放演算法，將電能減少問(wèn)題設成二次方程的公式。
- Total variation based image restoration and reconstruction lead to a kind of minimization problem that turns out to be a nonlinear integro-differential equation of elliptic type. 基于總變分的圖像重建和復原導致一類(lèi)最小化問(wèn)題,它歸結為解一個(gè)非線(xiàn)性橢圓型偏微分方程。
- We formulated the spectral unmixing problem as a constrained minimization problem of the K-L distance subject to the sum-to-one and the nonnegativity constraints on abundances. 我們將解析混合光譜問(wèn)題看成是一個(gè)受限制的最小化問(wèn)題，使K-L距離最小化且豐度滿(mǎn)足和為一及非負的限制。
- The RBF network configuration is formulated as a minimization problem with respect to the number of hidden layer nodes, the center locations and the connection weights. RBF網(wǎng)絡(luò )的設計問(wèn)題就是關(guān)于網(wǎng)絡(luò )隱節點(diǎn)數和隱層節點(diǎn)RBF函數中心、寬度和隱層到輸出層的權值的性能指標的最小化問(wèn)題。
- The experiment results of VEQPSO on a classic multiobjective minimization problem show the efficiency of the algorithm, for solving multi-objective optimization problem. 在VEQPSO算法中改進(jìn)了粒子的進(jìn)化公式，通過(guò)典型的多目標測試函數所做的實(shí)驗,驗證了該算法解決多目標問(wèn)題的有效性。
- A filled function with only one parameter was introduced.Then a method based on the filled function for the unconstrained global minimization problem was presented. 為此，介紹了只含一個(gè)參數的填充函數，并且根據這個(gè)填充函數提出了一個(gè)求無(wú)約束全局優(yōu)化問(wèn)題的填充函數算法。
- In this paper we prove a convergence theorem of the proximate point algorithm for minimization of DC function, and propose a kind of inexact proximate point algorithm for the minimization problem. 摘要本文證明DC函數最小化問(wèn)題鄰近點(diǎn)算法的一個(gè)收斂性定理，并對此問(wèn)題提出一類(lèi)非精確鄰近點(diǎn)算法。
- In this paper, the author applies affine reduced operation to the model based secant method and gives a new method to look for the descent direction for solving unconstrained minimization problem. 把仿射約化變換應用于基于模型的割線(xiàn)法中，給出了一種新的求解無(wú)約束極小化問(wèn)題的下降方向算法。
- The stochastic user equilibrium with multiple user groups is represented as an unconstrained minimization problem solution and a sensitivity analysis method based on link level is proposed for it. 將多用戶(hù)類(lèi)型隨機用戶(hù)平衡問(wèn)題表示為一個(gè)無(wú)約束極小化問(wèn)題，并提出了該問(wèn)題的一種基于路段水平的靈敏度分析方法。
- In this thesis, we consider some topics about the nonmonotone trust region method for unconstrained minimization problems. 本文主要討論了求解無(wú)約束極小化問(wèn)題的非單調信賴(lài)域方法的相關(guān)論題。
- Various geometrical problems are then presented, and there is detailed discussion of unconstrained and constrained minimization problems, and interior-point methods. 各種各樣的幾何問(wèn)題然后被提出， 并且有不受強制并且強制的極小化問(wèn)題和內部點(diǎn)的方法的詳細的討論。
- Characterization and Connectedness of the Proper Efficient Set in Cone-continuous Vector Minimization 錐連續向量函數最小化問(wèn)題真有效解集的特征及連通性
- I look at this problem from a different viewpoint. 我從不同的觀(guān)點(diǎn)來(lái)看這個(gè)問(wèn)題。
- She skirted round the problem of the high cost. 她避而不談巨額費用問(wèn)題。
