英语人>网络例句>优化问题 相关的搜索结果
网络例句

优化问题

与 优化问题 相关的网络例句 [注:此内容来源于网络,仅供参考]

Raveling Salesman Problem is a classic combined optimization problem and it is proved that TSP is NP hard.

SP问题作为经典的组合优化问题,已经被证明是一个NP难题。

The total optimization ability is improved.4. The structure in problem can be difficultly reflected by use of binary code. GA local searching ability is quite worse for continuum function.

二进制编码有时不便于反映所求问题的结构特征,对于一些连续函数的优化问题,GA的局部搜索能力也较差。

In the other hands, we present a levelvalue estimation method for solving global optimization. The global optimization problem will be converted into solve the first root of a nonlinear equation.

此外,我们提出了求解总极值问题的水平值估计方法,将一全局优化问题转化为求解一元非线性函数方程的根。

The paper simplifies the joint diagonalization of matrices into optimization problem which only includes the eigen matrix. For solving the problem conveniently, each row vector of the eigen matrix is parameterized, then utilizes the improved genetic algorithm to get the optimal parameter.

摘要该文首先将矩阵联合对角化问题化简成一个只含有特征矩阵的优化问题,为了便于求解,文中将待求特征矩阵的每一列向量进行参数化处理,并利用改进的遗传算法寻找最优的新参数。

The existence condition of first and second boundary variation was given with boundary variation method. The numerical method was obtained.

应用测度理论,将经典的变分问题,利用线性分析的方法转化为在几个Randon测度空间中寻找最优测度的有限维线性优化问题;从而得到最优控制律。

The slab sequencing problem in hot strip production is a complex combination optimization problem.It can be formulated as Prize Collecting Traveling Salesman Problem.

热轧带钢生产中的板坯排序是一种复杂的组合优化问题,可以归结为一个PCTSP问题。

During the resample, the wrong hypotheses are discarded through basic Branch and Bound approach. The real optimization or suboptimization association results are obtained after a period.

针对经典的单匹配最近邻和联合匹配方法中关联假设一旦确定就不能修改的不足,将数据关联问题转换成离散优化问题,提出了一种基于粒子滤波的多假设数据关联方法。

A revised branch and bound algorithm based on the idea of Horst (1976) is developed to minimize the tangent plane distance function to determine the thermodynamic stability of a postulated solution for the liquid phase equilibrium described by UNIQUAC or UNIFAC activity coefficient equations.

分支限界法是近年来发展起来的一种用于求解全局优化问题的确定性算法。在本文中,针对由UNIQUAC或UNIFAC活度系数方程描述的液相稳定性分析问题,我们发展了一种用于最小化切平面距离函数的改进的分支限界法。

The formulation of power system transient stability preventive control based on optimal power flow is presents in this thesis, in which multicontingency is considered. The infinite dimensions nonlinear optimization problem in which differential-algebraic equations are existed is changing into finite dimensions difference-algebraic equations by implicit trapezoid method.

建立了基于最优潮流的电力系统暂态稳定预防控制模型,通过隐式梯形法将含有发电机动态微分-代数方程和暂态稳定约束的无限维优化问题转换成有限维的常规静态最优潮流问题。

Traveling Salesman Problem is one of most widely studied combinatorial problems.

旅行商问题是研究最为广泛的组合优化问题,在现实生活中,也有着广泛的应用。

第39/100页 首页 < ... 35 36 37 38 39 40 41 42 43 ... > 尾页
推荐网络例句

The labia have now been sutured together almost completely.The drains and the Foley catheter come out at the top.

此刻阴唇已经几乎完全的缝在一起了,排除多余淤血体液的管子和Foley导管从顶端冒出来。

To get the business done, I suggest we split the difference in price.

为了做成这笔生意,我建议我们在价格上大家各让一半。

After an hour and no pup, look for continued contractions and arching of the back with no pup as a sign of trouble.

一个小时后,并没有任何的PUP ,寻找继续收缩和拱的背面没有任何的PUP作为一个注册的麻烦。