多项式算法,polynomial algorithm英语短句,例句大全

多项式算法,polynomial algorithm
1)polynomial algorithm多项式算法
1.In this paper,we consider a special integer bottleneck problem,and present two polynomial algorithms.研究了一个特殊的整数瓶颈问题并给出了两个求最优解的多项式算法程序。
2.A strong polynomial algorithm is proposed to solve the problem.讨论了此类问题的特性 ,并给出了解决问题的一个强多项式算法。
3.Also, we represent the polynomial algorithms relevant to these cases.对以最大滞后时间以及带权加工时间和为第二优化目标的动态单机排序问题１｜ｒｊ｜Ｃｍａｘ分别进行了探讨，并给出了相应的多项式算法。

英文短句/例句

1.It proves that the developed algorithm has a polynomial upper boUnd at the time, and can also be easily mounted on computers.本算法属多项式算法，计算简单，易于计算机实现。
2.The degree of difficulty in algorithms is gradually enhanced in proper order from dynamic programming to continue fraction algorithm.算法的实现难易程度由动态规划算法到多项式算法依次提高。
3.The Polynomlial Algorithm Finding a Basic Feasible Solution in the Sense of Probability求基可行解一种概率意义下的多项式算法
4.Polynomial Algorithm for Capacitated Lot Sizing Models with Shortage and Outsourcing;允许缺货和转包的受限批量模型的多项式算法
5.An Efficient Algorithm for Computing Minimal Polynomials of Polynomial Matrices;多项式矩阵最小多项式的一种有效算法
6.A Fasting Algorithm to Find Taylor Expansion of Polynomial;关于多项式Taylor展开式的一种快速算法
7.An Algorithm for Isolating Real Roots of Rational Polynomial Systems and an Algorithm for Calculating Liapunov Values of Polynomial Li?nard Systems;有理多项式组的实根分离算法和多项式Liénard 系统的焦点量求解算法
8.Right Product Polynomial Preconditioned GMRES;右端积多项式预处理GMRES算法
9.An Algorithm for Calculating the Liapunov Values of Polynomial Li(?)nard System;多项式Liénard系统焦点量的一种算法
10.Elevation Algorithm for a Class of Trigonometric Polynomial Spline Curves一类三角多项式样条曲线的升阶算法
11.Auto-choosing Algorithm for Polynomial Fitting in GPS-LevelingGPS水准多项式拟合自动优选算法
12.The bit-operation complexity of the fast exponential algorithm is polynomial.快速指数算法的比特运算复杂度是多项式的。
13.An Efficient and Deterministic Algorithm to Determine Irreducible and Primitive Polynomials over Finite Fields判定有限域上不可约多项式及本原多项式的一种高效算法
14.Parallel Algorithms for Computing Permanents and Permanental Polynomials of Sparse Matrices;稀疏矩阵积和式与积和多项式的并行算法
15.A Matrix Method of Computation of the minimal Common Multiple of Polynomial Group;多项式组的最小公倍式计算的矩阵方法
16.Heuristic Algorithm for Aerospace Multi-project Scheduling with Multi-resource Constraints多资源约束下航天多项目调度的启发式算法
17.FAST CALCULATION USING POLYNOMES FORTOPOGRAPHIC CORRECTION INRESISTIVITY METHOD电阻率法地形改正的多项式快速计算方法
18.characteristic polynomial of a differential operator微分算子的特征多项式

相关短句/例句

polynomial time algorithm多项式算法
1.SDNM is a polynomial time algorithm with the Newton s method, so that SDNM can solve large-scale linear inequalities.它在理论上是多项式算法 ,并可以从任意点启动 ,可以应用共轭梯度方法有效地求解大规模线性不等式组问题。
2.A polynomial time algorithm is developed for the restricted version in which the jobs in each group have the same due date.对同组工件有相同工期的限制情形给出了一个多项式算法。
3)Polynomial-time algorithm多项式算法
4)polynomial algorithms多项式算法
1.The following objective function is considered: the maximum completion time(makespan),and the polynomial algorithms are presented for the problem.针对一类带有准备时间和安装时间的单机成组排序问题,给出了求解最优排序的多项式算法。
5)polynomial-time algorithm多项式时间算法
1.In this paper,we gave two polynomial-time algorithms for solving two special unit type shortest path improvement problems under Hamming distance in single-source arborescence,and we studied some properties of the general problem.给出了求解两类特殊的Hamming距离下单位型单发点树型网络最短路改进问题的多项式时间算法,并研究了一般树型网络下该问题的性质。
2.Finally a polynomial-time algorithm for the optimal strategy of OEM is gotten by using dual theory of bilevel programming.最后,利用双层规划的对偶理论,给出求解OEM业务最优策略的一种多项式时间算法。
3.It is shown that this algorithm is a polynomial-time algorithm which can algorithm can find anε-approximate solution in O(n~(1/2)lnε~(-1)) iterations.给出二次锥规划的一种不可行内点算法并证明该算法是多项式时间算法。
6)polynomial time algorithm多项式时间算法
1.A polynomial time algorithm for the scheduling problem of identical coupled-task jobs is presented in.本文讨论并给出了由n个相同的耦合工件构成的耦合工件组作业问题的多项式时间算法。
2.To present a new polynomial time algorithm for China traveling salesman problem, first, point set was partitioned into a number of subpoint sets by using convex hull and medial axis.研究求解中国货郎担问题最短回路的多项式时间算法。
3.In this paper,we will prove that there exit an orthogonal matching decomposition of M in simple bipartite graph,and present a polynomial time algorithm of this decomposition.在本文中我们将证明对于简单二部图G,存在关于完美匹配M的正交匹配分解,并给出了求这个分解的多项式时间算法。