For the parsimony this paper presents model a polynomial time greedy algorithm and a compound algorithm that combines the greedy policy with the branch-and-bound strategy in a uniform framework.

提出了节约原则模型的一个多项式时间的贪心算法以及一种把贪心策略和分支限界策略集合在统一框架下的复合算法。

youdao

Also developed for the PRA tree is an enhanced predictive range aggregate (EPRA) query algorithm which USES a more precise branch and bound searching strategy, reducing the disk I?

提出了一种增强预测范围聚集查询epra算法，采用更精确的剪枝搜索准则，减少了查询所需要访问的节点代价。

youdao

Concerning path search in the motion graph, this paper used the area between two curves as the target function and improved the strategy of incremental search and the strategy of branch and bound.

针对运动图上的路径搜索，提出了基于路径曲线所夹面积的目标函数并改进了分段搜索算法和剪枝策略。

youdao