查询词典 solution tree

Firstly,a node-based topology relationship model of transport network is presented,in which the physical connection and the logical connection are described.Secondly,the structure of search node is defined in the sight of dual graph theory as a solution for turn prohibitions and delays in road intersections.

提出了基于节点的交通网络拓扑关系模型，描述交通网络的物理连通性以及逻辑连通性；根据对偶图的思想，定义搜索节点结构，处理交叉口转向限制和延误；改进传统的Dijkstra算法，提出了基于搜索节点的双向启发式A*算法，使用二叉堆优先级队列存储扩展节点，RB-tree存储标记节点。

In other words, they are one level below the selected item in the solution tree.

换句话说，他们是一个低于所选项目的水平在溶液中树。

We also present a newlearning algorithm,which adjusts criticality values based on solution tree.

还提出一学习算法，根据解树对临界值进行学习校正指派，以求解MABSTRIPS 不能求解的问题。

The known solutions are arranged systematically in a solution tree,so that approaches to new systems can be found by identifying the gaps.

已知的各种解决方法可系统地排列成一棵"方法树"，因此所采用的新系统将从该树的间隙中寻找。

In order to facilitate the first step of the transition, the thesis defines and constructs a Domain Solution Tree, then determines the dimensions and design rules of the Design Space according to the elements of the Domain Solution Tree.

进而以测试领域为例，研究了问题空间元素（领域解题树中的各类节点）与设计空间元素之间的对应关系，为实现由分析到设计的无缝转换奠定了基础。

In the conclusion, it was pointed out that more efficient verification algorithms of WAR could be acquired or a best solution tree could be generated speedily based on the proposed And/Or tree and the special heuristic function.

在与／或树基础上，通过选择合适的启发函数，可以进一步提高验证效率，或快速生成适合问题需求的最佳解树。

Some experiments show that,with a clauses ontology,some clauses which do not match current goals are not considered early enough,and, therefore, the size of the goal solution tree may be reduced.

实验表明，通过对Prolog子句建立本体，可以尽早地去除与当前目标明显不匹配的子句，从而使得目标求解树的规模减小。

The backward heuristic search algorithm BHAO for general AND/OR graphs is presented, in terms of newly-defined heuristic function h and the principle that every subtree of the optimum solution tree is also optimum solution one.

根据新定义的启发式函数h以及广义AND／OR图的最佳解树之所有子树亦是最佳子解树的原理，提出了广义AND／OR图的自底向上的启发式搜索算法BHAO。

It is proved that if the optimal solution tree has an inter-node, the necessary and sufficient condition that tree structure GAs are solution foundable is that the initial population contains an inter-node; the upper limit of solution foundable probability is also calculated and the population size is proved to increase at most in a polynomial of increasing problem complexity and the probability upper limit.

本文接着给出了当初始群体随机产生，只有杂交算符作用或只有复制与杂交算符作用的遗传算法有解的充要条件，并加以证明；而且求出了这时有解的概率上限，并证明群体大小的增加不超过问题复杂性和有解概率上限的某个多项式。

Using different concentrations of PEG solution simulated drought stress, measured PB86, PR107, RRIM600 and GT1 rubber tree seedling leaves relative water content, the relative conductivity, malondialdehyde, soluble sugar content, superoxide dismutase, 8 physiological indicators, and their changes in the law, and using principal component analysis, membership function analysis, correlation analysis grey mathematical statistical methods, such as the evaluation of four strains of rubber tree seedlings and with the drought resistance the relevance of indicators; at the same time analysing the use of hypertonic solution screening rubber tree seeds and the drought resistance of different rootstocks on 7-33-97 budding seedlings of the impact of drought that rubber tree planting material and rootstocks drought assessment, and provide a theoretical basis choice.

利用不同浓度的PEG溶液模拟干旱胁迫，测定了PB86、PR107、RRIM600和GT1橡胶树实生苗叶片相对含水量、相对电导率、丙二醛、可溶性糖含量、超氧化物歧化酶等8项生理指标，研究了它们的变化规律，并利用主成分分析、隶属函数分析、灰色关联分析等数理统计方法评价了4个品系橡胶树实生苗的抗旱性及其与各指标的相关性；同时分析了利用高渗溶液筛选的橡胶树种子的抗旱性以及不同砧木对热研7－33－97芽接苗抗旱性的影响，以为橡胶树抗旱砧木和种植材料的评价、选择提供理论依据。

The split between the two groups can hardly be papered over.

这两个团体间的分歧难以掩饰。

This approach not only encourages a greater number of responses, but minimizes the likelihood of stale groupthink.

这种做法不仅鼓励了更多的反应，而且减少跟风的可能性。