主体规划使用HTN方法，形成偏序规划树。
The agent's planning forms a partial ordered plan tree using HTN method.
在应用所有转换之后，规划树已经演变成一个运行树，且准备执行。
When all transformations have been applied, the plan tree has morphed into a run tree, and is now ready for execution.
启用或禁用查询规划跟踪，也称为规划树，它捕获一个查询的转换流程。
Enables or disables query plan tracing, also known as a plan tree, which captures the transformation process of a query.
传入dynamicQueryMode的一个报表请求首先会被解析成一个规划树。
A report request coming in to the Dynamic Query Mode will initially be parsed into a plan tree.
基于规划树概念，本文给出了能力概念的形式化语义定义，获取和描述了它的一些重要属性。
Based on the concept of plan tree, the formal semantics of the capability is defined and some important properties are obtained.
转换层将应用一个推理过程(类似于前推链接法)，并检查规划树中的每个节点，看哪些查询转换适用于该节点。
The transformation layer will apply an inference process (similar to forward-chaining) and check for each node in the plan tree to see which query transformations apply to that node.
有了树之后，规划流程就可以开始了。
在整个规划设计阶段，我让他们爬上梯子在树干上标记下将要架设树屋地板的地方。
During the planning phase, I let them climb a ladder to the mark on the trunk where the floor would go.
将工作流树限制到规划者（planner）或贡献者（contributor）级别，同时不在树中显示规划对象。
Limit the work-flow tree to the level of planners or contributors while not showing planning objects in the tree.
而且规划师放弃一个显而易见的，结构性的边界，并以棕榈树作为一种天然的绿色标记。
The Planners, moreover, renounced an obvious, structural boundary and relied on palms as a natural green marker.
将线性规划方法与电路的树分解技术结合，实现大型线性动态电路中故障的迅速定位。
Linear programming approach combines with technique in tree of decomposition to realize fault location of large linear dynamic circuits quickly.
改进了传统的树匹配和动态规划算法。
Improved on the traditional tree matching with dynamic programming algorithm.
算法对信号进行局部余弦变换时采用动态规划算法计算最佳局部余弦树，通过获得信号在时间轴上的最佳划分来获得信号的最优嫡编码。
In this algorithm, dynamic programming is used to calculate optimal local cosine tree during the LCT for signals, and the optimal entropy code is gained by the best partition of time axes.
分析了现有装配序列规划方法和装配序列表达模型的缺陷，提出了一种合理的装配工艺APS树模型，并用这种模型表达非线性的装配序列。
To express nonlinear assembly sequences, an assembly process APS-tree model was proposed after analyzing disadvantages of the existing planning methods and expressions of assembly sequence.
在典型的参数算法中，有界搜索树和动态规划是常用技术。
Bounded search tree and dynamic programming are frequently-used techniques in parameterized algorithm.
本文提出并实现了两种基于快速扩展随机树的路径规划器。
This thesis presents two path planner based on the RRTs and has realized them.
下一步我们将概述一些灾难的死亡骑士天赋树的变化，我们正在规划中。
Next we'll outline some of the death knight talent-tree changes we're planning in Cataclysm.
第一是基于人工势场的方法，第二是快速随机搜索树和滚动规划的结合方法。
The first method is based on the artificial potential field. And the second one is suggested by Rapidly-exploring Random Tree (RRT) and rolling windows planning.
给出了实现该系统时用到的诊断树、资源关系模型和资源调整规划算法。
It also puts forward the dialog tree, model of relationship of resource, and the arithmetic used to make tinning plan.
我们可以使用树分解的动态规划在线性时间内找到最优解。
We can use dynamic programming on the tree decomposition to find an optimal solution in linear time.
阐明了系统目标的确定是系统规划设计的重点，并具体地给出了智能大厦系统工程一般目标树，供作规划时参考。
It clarifies that the establishment of system target is the design emphasis of system Planning, specifying the general target tree of intelligent building system engineering in detail for reference.
基于前缀树和动态规划，该算法提高了中文分词速度，同时保持了相对较高的分词准确性。
Using prefix tree and dynamic programming, this algorithm boosts the speed of Chinese word segmentation and guarantees relatively high precision.
企业订单实例表明，引入导航树路径规划机制可以使迁移实例获得更有针对性的迁移路线，避免盲目迁移。
The order form example shows that migrating instance can acquire an effective migrating path and avoid vain migration by means of the migrating instance path planning mechanism.
决策者可以对价值树中的目标权重和方案结果进行区间估计，并通过线性规划方法把有关权重区间和方案结果的不完整信息处理为价值区间和控制关系。
The decision maker can enter interval judgements which indicate relative importance of the attributes and the possibly range valued information about the outcomes of the alternatives into value tree.
迄今为止迪拜已经建造了两座棕榈树形状的人工群岛，每棵“树”上还都有新月状的条纹环绕。第三座岛的建设也在规划之中。
To date, there are two palm-tree-shaped islands crowned with sandy crescent strips with a planned third one on the way.
本文利用树根和节点级数的概念，借助于LINGO建立了求解最小生成树的整数规划模型，并对模型中的难点给出了详细的注释。
The integer program model of minimal spanning tree was built up by the concepts of root and level of node in LINGO. There are particular notes to the difficulties of the model.
在此基础上，提出了采用虚拟矩阵匹配搜索二叉树以确定领域式规划空间中邻接关系的方法，并描述了启发式方法和概率方法相结合的路径搜索算法。
And then associating with the virtual array elements, this article improves the algorithm and an improved space-time virtual DOA array method has been made.
在此基础上，提出了采用虚拟矩阵匹配搜索二叉树以确定领域式规划空间中邻接关系的方法，并描述了启发式方法和概率方法相结合的路径搜索算法。
And then associating with the virtual array elements, this article improves the algorithm and an improved space-time virtual DOA array method has been made.
应用推荐