We provide a polynomial time algorithm to solve the problem.
给出了多项式时间的最优算法。
A new real-time algorithm for detecting moving objects is presented.
设计了一种快速有效的运动目标检测算法。
We introduce a platform for real-time algorithm verification of video processing.
本文介绍了一种实时视频处理的验证平台。
Finally, a polynomial time algorithm for solving an optimal cover of FD set is given.
最后给出了一个求f D集最优覆盖的多项式时间算法。
The marching-on-in-time algorithm (MOT) is described and some temporal bases are discussed.
详细讨论了时域积分方程的时间步进算法（MOT）。
The application results show that this scheme and its real time algorithm are reasonable and feasible.
经实际应用表明，应用方案及其实时算法是合理、可行的。
A polynomial time algorithm for the scheduling problem of identical coupled-task jobs is presented in.
研究了一个特殊的整数瓶颈问题并给出了两个求最优解的多项式算法程序。
Because the judgment criteria on the escape time algorithm is improved, the object set is the boundary set.
因为改进了逃逸时间算法的判别标准，因此，目标集合是边界点集。
This paper presents a polynomial time algorithm for finding Rectilinear-Steiner-Trees by statistical analysis.
本文利用统计分析法，提出求解矩形斯坦纳树问题的多项式时间算法。
Both theoretic analyses and testing results show that the new method is a deterministic polynomial time algorithm.
理论分析与实验结果表明该方法是确定性的多项式时间算法。
SDNM is a polynomial time algorithm with the Newtons method, so that SDNM can solve large-scale linear inequalities.
它在理论上是多项式算法，并可以从任意点启动，可以应用共轭梯度方法有效地求解大规模线性不等式组问题。
Based on the definitions of the unfounded set and the greatest unfounded set, it proposes a polynomial time algorithm.
以无基集为基础，结合最大无基集的定义，提出一个多项式时间算法。
Then educes the real time algorithm of dynamic level of detail terrain rendering and gives out its realizing process in detail.
进而引出了动态多细节水平地形渲染的实时算法，并给出其实现过程及实验结果。
Then educes the real time algorithm of dynamic level of detail terrain rendering and gives out its realizing process in detail.
大规模的地形渲染算法需要采用细节层次来减少实际需要绘制的地形数据。
A dwell time algorithm for the magnetorheological finishing (MRF) of the small axis-symmetrical aspherical surfaces is described.
介绍了一种基于代数算法的回转对称非球面计算机控制表面成形的驻留时间算法。
Triangular patch model (TPM) is usually employed in marching-on-in-time algorithm to analyze the scattered electromagnetic fields.
三角贴片模型(TPM)常用于研究电磁散射的时域推进算法中。
Basing on the optimal properties, this paper proposes a polynomial time algorithm which is suitable to solve the large scale scheduling problem.
本文在利用优化性质的基础上，提出了一种适于大规模优化调度问题的多项式时间算法。
Based on the algorithm to find strongly connected nodes of a graph, this paper presents a linear time algorithm to detect modules of a fault tree.
基于在图中寻找强连接节点的算法，给出一种线性时间复杂度算法来检测故障树中的模块。
Based on the steady flow module of the TRIP software, the unsteady flow module is developed, using a dual time algorithm and a dynamic grid technique.
在TRIP软件定常模块的基础上，采用双时间法和动网格技术开发了非定常模块。
The results indicate that this equivalent model can improve the atomic time calculation speed and fit for the fast calculation of atomic time algorithm.
结果表明，该模型可以提高原子时计算的速度，适合于原子时算法的快速计算。
Multi-properties match algorithm is presented and applied in NIDS by introducing G-T algorithm and linear-time algorithm based on biological immune theory.
通过对基于生物免疫理论的G-T算法和线性时间算法的介绍，提出了多特征匹配算法并将其应用于网络入侵检测系统中。
The interior point method is a polynomial time algorithm for solving linear programming problem, and its number of iterations is independent on the size of system.
内点法是一种求解线性规划问题的多项式时间算法，其显著特征是其迭代次数与系统规模关系不大。
In this paper, we present a new match protocol. It is of semantic security: there exists no probabilistic polynomial time algorithm to distinguish two guessed inputs.
本文给出了一个新的匹配协议，该协议是语义安全的，不存在概率多项式时间算法区分对两个输入的猜测值。
This paper presents a infeasible interior-point primal -dual affine scaling algorithm for linear programming. it is shown that the method is polynomial-time algorithm.
摘要本文对线性规划提出了一个不可行内点原始-对偶仿射尺度算法，并证明了算法是一个多项式时间算法。
The radix-2 decimation-in-time algorithm based on 16-bit fixed-point operation and pipeline architecture are adopted in the core module IFFT(Inverse Fast Fourier Transform).
核心模块快速傅立叶逆变换（IFFT）采用基于16位定点运算的基-2时间抽取算法和流水线结构。
The Joint Probabilistic data association algorithm (JPDA) is the accepted effective data association algorithm, but it has high computational load, and it's not a Real-time algorithm.
联合概率数据关联算法是公认的多目标跟踪中有效的数据关联算法，但它的计算量过大，实时性不好。
Based on the analyses and study of the constructing fractal image's escape time algorithm, this article redefined the escape time function and provides the accelerated escape time algorithm.
本文在对生成分形图形的逃逸时间算法进行分析和研究的基础上，重新定义了逃逸时间函数，提出了加速逃逸时间算法。
The capacities are required to be as large as possible, while the costs are needed to be as low as possible. To solve this problem, the authors present an efficient polynomial-time algorithm.
要求容量尽可能地大，而费用尽可能地小，并就此问题提出了一个有效的多项式算法。
Some numerical results for a large number of random convex quadratic programming problems show that the new algorithm is efficient and might be a polynomial-time algorithm under some conditions.
大量的关于随机的凸二次规划问题的数值实验结果表明它的计算效率是高的，在某些条件下可能是多项式时间算法。
Some numerical results for a large number of random convex quadratic programming problems show that the new algorithm is efficient and might be a polynomial-time algorithm under some conditions.
大量的关于随机的凸二次规划问题的数值实验结果表明它的计算效率是高的，在某些条件下可能是多项式时间算法。
应用推荐