查询词典 andre polynomial

As an NP-hard problem, this model has no solution based on polynomial algorithm at present. Therefore, an adaptive and polymorphic ant colony algorithm has been brought forward to solve the VRPMC.

由于该模型是一个NP-hard问题，目前还没有多项式算法求解，又提出了采用自适应的多态蚁群算法来对其进行求解的策略。

After the chained conversion, the paper discussed controllable method of chained system, as a result, we applied the time polynomial inputs control solution in our manipulator.

完成链式变换后，本文研究了链式系统的控制方法，利用时间多项式输入控制的方法实现了对该多关节机械手臂的控制。

We propose a new algorithm for a sample and all Nash equilibria by using heuristic search in game supports and the solution techniques of polynomial equation systems.

摘要应用搜索博弈支持集和方程组求解技术，提出了一个计算单一和全部纳什均衡点的启发搜索方法。

By establishing the correspondence between the primitive operation in polynomial and clause solution in SAT,an efficient algorithm has been built to obtain all solutions which satisfied the problem.

利用一个简单的变换，将可满足性问题转化为多项式形式，然后根据命题逻辑的性质以及多项式的性质，得到一个求解出SAT问题所有解的算法。

In first part it pays attention to theory study. Afterwards, based on linear programming, we introduce some properties of conic optimization and its dual problem, which are a kind of especial convex programming. In second part, we apply these theories to practice, such as least-squares problems, polynomial solution and approximating covariance matrices, and other aspects .

第一部分是理论研究：在线性规划的基础上重点介绍了一种特殊的凸规划类型——锥规划及其对偶锥规划，并介绍了锥规划及其对偶锥规划的发展及其性质。

This paper presented a three-phase heuristic approach to deal with this NP-hard problem. During the process of determining the bottleneck work center, arranging the devices, and ordering the jobs, reduced the complexity of the problem gradually. Therefore obtained an effective solution within polynomial time.

针对这个NP-hard问题，提出一种三阶段启发式方法，通过依次完成瓶颈工作中心的判定、设备分配和任务排序，使这一问题的复杂度得以逐步降低，从而可以在多项式时间内得到有效的调度方案。

High degree congruence, Cryptosystem, Trivial solution, Polynomial time algorithm.

高阶同余方程，密码体制，平凡解，多项式时间算法

The observing activity featured by angle-dependent effects, sequence characteristics, so the problem can be partition into multiple phases according to the maximum slew times. The algorithm based on dynamic programming is developed to find the global optimal solution within polynomial time.

分析了观测活动性质，并基于观测活动间存在时序关系特征，将问题按照卫星的最大侧摆次数划分为多个阶段，提出了基于动态规划思想的算法，能够在多项式时间内得到问题的最优解。

Observation well, water level equation, response lag, power-series solution, approximation polynomial

观测井，水位方程，响应滞后，幂级数解答，近似多项式

The multicast routing problem that finding the minimum cost multicast routing tree with many QoS constraints may be formalized to Steiner tree problem in network, which is a NP-complete problem that an algorithm that finds a Steiner tree can not get the best solution in polynomial time.

寻找有多个QoS约束的最小代价组播路由树可以形式化为网络中的Steiner树问题，它是一个NP完全问题，在多项式时间内不能得到最优解，因此研究者所寻求的是一种次优的、在最差情况和平均情况下的性能都接近于最优的解决方案。

You can snipe the second and third union leaders from this position.

您可以鹬第二和第三工会领袖从这一立场出发。

Aiming at the currently shortage of XML streams quality detecting, this paper proposes a new forecasting method of XML streams quality by least squares support vector machines, which is used the method of XML keys' vector matrix as windows, and vector product wavelet transform to multilevel decompose and refactor the XML streams series, that can fulfill real-time checking demand of XML quality, and ensure constraint, consist- ency and integrality. For even more adapting net load, it proposes a control strategy by weight and adaptive adjustment to ensure XML streams quality.

针对当前XML数据流质量检测存在的不足，提出构建XML键的矢量矩阵作为窗口，利用矢量积小波变换多级分解与重构XML数据流，再结合最小二乘支持向量机对XML数据流质量进行预测的一种方法，满足XML数据流质量重构时实时检测的要求，保证XML数据的约束性、一致性与完整性；为了更好的适应网络负载，采取加权与自适应窗口调整等调度策略充分保证XML数据流的质量检测。