In proc . the 4th workshop on advances in geographic information systems , rockville , maryland , 1996 , pp . 35 - 43 Iii提出了一系列有效的剪枝策略，以便节省内存消耗和进一步减少cpu代价。
Ansi z133 . 1 - 1994 safety requirements for tree care operations - pruning , trimming , repairing , maintaining and removing trees , and cutting brush 树木养护操作安全要求.修剪,削减,修整,保养和移动树木及剪枝
Forest machinery . backpack power units for brush - cutters , grass - trimmers , pole - cutters and similar appliances . safety requirements and testing 森林机械.灌木铲除机,草修剪机,剪枝机和类似用具的背负式动力装置
At first , heuristic information was used to prune lane and then planning result information was introduced to improve the speed of planning 首先引入了启发式信息，依此求得对航线进行剪枝，然后引入规划结果信息，使得规划的速度更为迅速、快捷。
This avoid high cost by using post - pruning measure which require many times for scanning disk data and amount of cpu time . so we gain a high efficiency 这避免了后剪枝策略所需的高昂代价，减少了扫描磁盘数据的次数和大量的cpu时间，进一步提高了算法的效率。
( 4 ) on the above basis , we propose a " priming " algorithm of multi - dimension assignment problem and analyze its mechanism and computation burden 在上述基础上，提出了多维分配问题的一种“剪枝”求解方法，并对该方法的“剪枝”机理及计算量进行了详细分析。
At last , we get a new algorithm named gen _ dt _ er ( ) which equipped with exception rule extraction and pre - pruning method by referring to typical algorithm ids 最后我们以典型的建树算法id3为例，使用预剪枝技术，加入异常规则的提取，形成新的算法gen一dteeer ( ) 。
On this basis , we give three " pruning " theorems by transformation of the solution matrix using corresponding cost matrix , and give their theoretical proving process 在此基础上，利用代价矩阵对解矩阵进行变换，给出了三个“剪枝”定理，并对定理进行了详细的理论证明。
That the deepening and the widening , the planting and the pruning , the digging up and the covering up ? the gardening ? would never stop , could never stop , so long as i was there 只要我在，深耕、拓园、种植、剪枝、挖掘和填土，所有这些园艺活动就永远不会停止，也永远不能停止。
