您要查找的是不是：
- Polyhomial time algorithm 多项式时间算法
- A linear time algorithm for producing such a coloring is presented also. 论文还给出了寻找这样一种着色的线性时间的算法。
- In this paper, we study the minimum-weight feedback vertex set problem in outerplanar graphs and present a linear time algorithm to solve it. 本文主要考虑外平面图中的反馈点集并给出了一个求外平面图最小顶点赋权反馈点集的线性时间算法。
- The paper offers polynomial time algorithm of the functional all-terminal reliability of cordal ring. 给出了弦环的实用全终端可靠度的一种计算方法;此方法是多项式时间的.
- A real time algorithm is proposed here, which uses a TRIE structure as the carrier of dictionary. 对此，本文提出一种应用在中文垃圾邮件过滤系统中的实时分词算法。
- Finally, a polynomial time algorithm for solving an optimal cover of FD set is given. 最后给出了一个求FD集最优覆盖的多项式时间算法。
- A dwell time algorithm for the magnetorheological finishing (MRF) of the small axis-symmetrical aspherical surfaces is described. 介绍了一种基于代数算法的回转对称非球面计算机控制表面成形的驻留时间算法。
- Meantime,the polynomial time algorithm is suggested.The method provides a new way for the bilevel decision problem and multi-level decision making. 同时，在上下层问题独立求解时，引入了一种多项式的时间算法，为两层以及多层决策问题提供了新的求解途径。
- With the result of real image data experiments, it can be pointed out that it is a simple, less memory, parallelizable and real time algorithm. 使用此算法对两组真实图像序列中运动小目标进行检测，根据对检测结果的分析，指出此算法可有效地完成检测任务，并且具有运算简单、存储量小、可并行实现、即时性好等特点。
- In this paper, we study the undirected minimum-cardinality feedback vertex set problem in outer-planar graphs and present a polynomial time algorithm to solve it. 本文讨论外平面图的反馈点集并给出了一个求外平面图最小反馈点集的多项式时间算法。
- Devise a genetic algorithm to solve the Economic Lot and Delivery Scheduling Problem-ELDSP, and compared with heuristic algorithm and polynomial time algorithm. 设计了基于经济批量与交货期问题(ELDSP)的遗传算法。
- 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. 内点法是一种求解线性规划问题的多项式时间算法,其显著特征是其迭代次数与系统规模关系不大。
- Describe a O(n lgn) - time algorithm that, given a set S of n integers and another integer x, determines whether or not there exist two elements in S whose sum is exactly x. 因为无聊;准备细细再琢磨一番;上面是第二章一超级入门题目;愣是不会做.
- Fruit juices ferment if they are kept a long time. 果汁若是放置很久，就会发酵。
- Time is sometimes called the fourth dimension. 时间有时被称为第四度空间。
- I think the work can be completed ahead of time. 我认为这项工作能提前完成。
- He will come on time even though it rains. 即使下雨，他还是会准时来的。
- Reading occupies most of my free time. 阅读占去了我大部分的闲暇时间。
- Luebke and Provan proved that the Euclidean 2-connected Steiner network problem is NP-hard, which means that there are few possibilities of existing a polynomial time algorithm for a general finite set P of points in the Euclidean plane. Luebke和Provan证明了欧几里德2-连通Steiner网络问题是NP-困难的。 这意味着对一般的平面有限点集而言,不大可能存在求解这个问题的多项式时间算法。
- I need some time to orient my thinking. 我需要一些时间来使我的思想适应。
