位置路径用于选择源树中的节点。
要选择文档的某一部分，必须规定起始节点(称为上下文节点)和所选内容之间的路径。
To select some parts of a document, you specify a path between a starting node (called the context node) and the contents to be selected.
当选择树中的一个节点时，就会生成那个节点的路径，并添加到过滤条件的左侧。
When any node in the tree is selected, a path to that node is generated and added to the left side of the filter condition.
到目前为止，看到的路径都是选择一个节点，并假设您知道该节点在何处。
So far, all the paths you've seen have been about selecting a node, assuming you know exactly where that node is.
在路径分解和查询计划选择的过程中，利用查询树中的目标节点来避免中间结果的传递。
In the procedure of path decomposition and query plan selection, target node in the query tree is utilized to avoid the transfer of the intermediate results.
算法采用探测包并行地搜索可行路径，并使用启发式函数随机选择下一跳节点。
This algorithm employs probes to search feasible paths in parallel, and USES heuristic functions to randomly select a suitable next node.
我们提出了一种基于动态链路参数的M -QOS路由协议，节点根据情报类型的不同选择能够满足QOS需求的路径。
Different information need different QOS requirement. Thus we suggest a dynamic link parameter based routing protocol M-QOS, which selects route based on the information types.
将最短路径的信息反馈到系统中作为搜索的指导信号，并改进节点选择方法，以提高应用蚁群算法搜索无人机三维航路的效率。
To improve the efficiency of path planning, the message of the shortest path was introduced in the system as a searching guidance signal, and a modified nodes selection method was also given.
同时为了选择与最短路径相似的稳定多路由，RNDMRA应用相似性因子选择相似的稳定节点不相交多路径路由。
And in order to select stable multiple routes similar with the shortest path, RNDMRA USES similarity factor to select similar stable node-disjoint multipath routes.
针对以上问题，本文引入节点的空闲度和连接时间的概念，并将二者的加权和作为路径选择的依据。
To solve these questions, this thesis lead into the concept of Leisure Degree and Link Expiration Time of the nodes, and take the weight of both as the condition for path choosing.
每个节点在进行父节点的选择时，可以使用不同的标准，如路径跳数、端到端延时、端到端可用带宽。
Each new node can use different metrics such as number of hops, end-to-end delay, available bandwidth in selecting parent nodes.
不能冻结变换，因为你用了一个长度节点在这个选择的路径上。
Freeze Transform was not applied because you have instanced nodes in the selected path.
该协议中定义了一个有关节点剩余生命期与路由路径跳数的函数，并以该函数值作为路由选择参数进行最优路径的选择，从而使能量充足的节点获得更多参与通信的机会。
A route select parameter computed by residual lifetime of nodes and hop count of route is used to be selected the best route, the nodes that have more energy have more probability of chosen.
节点根据能量消耗的代价来选择至簇头的路由，通过扩散算法来广播代价消息，采用贪婪算法来选择能量消耗最小的路径；
The new protocol finds the path to the cluster head with the minimum cost, using an algorithm similar to flooding to propagate the cost information and greedy algorithm to find the lowest cost link;
节点根据能量消耗的代价来选择至簇头的路由，通过扩散算法来广播代价消息，采用贪婪算法来选择能量消耗最小的路径；
The new protocol finds the path to the cluster head with the minimum cost, using an algorithm similar to flooding to propagate the cost information and greedy algorithm to find the lowest cost link;
应用推荐