您要查找的是不是：
- This paper presents a solution to the test time minimization problem for core-based systems. 本文针对基于芯核系统的测试时间最小化问题提出了一种解决方案。
- So long as this minimization problem is solved, the whole system is asymptotically stable. 只要该最小化问题有解，则整个系统是渐近稳定的。
- For the total completion time minimization problem on two machines with decision maintenance, the worst-case analysis of SPT algorithm was given. 对于决策维护最小化总完工时间问题，分析了SPT算法的界。
- For the make-span minimization problem on two machines with periodic maintenance, it was shown that FFD algorithm was an efficient algorithm. 对于周期维护最小化时间表长问题，证明了经典的FFD算法是一个很好的启发式算法，并且得到了该算法的一个上界。
- A causal residual generator is obtained by making use of the ununiqueness of the optimal solutions to the minimization problem. 然后，利用该最小化问题解不唯一的特点，求得满足因果关系的最优残差产生器。
- Third, we introduce an analytical placement approach as a convex quadratic program formulation of the power minimization problem. 第三，我们介绍一种分析式摆放演算法，将电能减少问题设成二次方程的公式。
- 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. 基于总变分的图像重建和复原导致一类最小化问题,它归结为解一个非线性椭圆型偏微分方程。
- 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. 我们将解析混合光谱问题看成是一个受限制的最小化问题，使K-L距离最小化且丰度满足和为一及非负的限制。
- 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网络的设计问题就是关于网络隐节点数和隐层节点RBF函数中心、宽度和隐层到输出层的权值的性能指标的最小化问题。
- The experiment results of VEQPSO on a classic multiobjective minimization problem show the efficiency of the algorithm, for solving multi-objective optimization problem. 在VEQPSO算法中改进了粒子的进化公式，通过典型的多目标测试函数所做的实验,验证了该算法解决多目标问题的有效性。
- 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. 为此，介绍了只含一个参数的填充函数，并且根据这个填充函数提出了一个求无约束全局优化问题的填充函数算法。
- 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函数最小化问题邻近点算法的一个收敛性定理，并对此问题提出一类非精确邻近点算法。
- 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. 把仿射约化变换应用于基于模型的割线法中，给出了一种新的求解无约束极小化问题的下降方向算法。
- 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. 将多用户类型随机用户平衡问题表示为一个无约束极小化问题，并提出了该问题的一种基于路段水平的灵敏度分析方法。
- In this thesis, we consider some topics about the nonmonotone trust region method for unconstrained minimization problems. 本文主要讨论了求解无约束极小化问题的非单调信赖域方法的相关论题。
- Various geometrical problems are then presented, and there is detailed discussion of unconstrained and constrained minimization problems, and interior-point methods. 各种各样的几何问题然后被提出， 并且有不受强制并且强制的极小化问题和内部点的方法的详细的讨论。
- I look at this problem from a different viewpoint. 我从不同的观点来看这个问题。
- quasi-Lagrangean minimization problem 拟拉格朗日极小化问题
- She skirted round the problem of the high cost. 她避而不谈巨额费用问题。
- It may take a long time to find a solution to the problem. 也许要花很长时间才能找到解决这个问题的办法。
