遍历

基本解释 (translations)

traversal

与遍历相关的网络例句 [注：此内容来源于网络，仅供参考]

Layout segmentationand block recognition is combined in this algorithm which improves the processingefficiency.4 determination of logical order in layout based on directed graph.Space structure directed graph is set up from analysis the space structure of layoutobjects. This transfers the determination of logical order of layout objects into traversingsearch in directed graphs, from which the logical order of layout object is determined.

可以看出，该算法将版面分割与区域识别相结合，提高了算法的效率。4、基于有向图的版面对象顺序确定该算法利用版面对象的空间结构建立空间结构有向图，将版面对象之间的顺序确定，转换为在有向图空间进行遍历搜索的过程，通过图的遍历生成遍历树来确定版面对象顺序。

For algorithm complexity and trav- erse efficiency problems of a majority of intelligent cleaner traverse dust absorption,a mode of relative positioning by objects of reference to make certain relative position of intelligent cleaner in the room is proposed.

针对大部分智能吸尘器吸尘遍历的算法复杂和遍历效果不佳的问题，提出了以参照物相对定位的方式来确定智能吸尘器在房间的相对位置，以极坐标的形式实现在房间的100%遍历行走吸尘，实验采用超声波测距的方式实现智能吸尘器的相对位置确定。

Build and Traverse of Abstract Syntax Tree Based on Java Program;2. For algorithm complexity and trav- erse efficiency problems of a majority of intelligent cleaner traverse dust absorption,a mode of relative positioning by objects of reference to make certain relative position of intelligent cleaner in the room is proposed.

针对大部分智能吸尘器吸尘遍历的算法复杂和遍历效果不佳的问题，提出了以参照物相对定位的方式来确定智能吸尘器在房间的相对位置，以极坐标的形式实现在房间的100%遍历行走吸尘，实验采用超声波测距的方式实现智能吸尘器的相对位置确定。

In Figure 1 storage structure to achieve depth-first search traversal and breadth-first search traversal, and gives Ergodic results.

在图1 存储结构上实现深度优先搜索遍历和广度优先搜索遍历，并给出遍历结果。

Data mining for traversal patterns has been found useful in several applications. However, traditional model of traversal patterns mining only considered unweighted traversals.

遍历模式数据挖掘方法已经在多种应用中被提出，传统的遍历模式挖掘仅仅考虑了非加权遍历。

Master plan adjacency matrix storage structure; Implementation plans of the two traverse : depth-first traversal and breadth traversal priority.

掌握图的邻接矩阵的存储结构；实现图的两种遍历：深度优先遍历和广度优先遍历。

As Chapter 1 explains, the cull traversal stores references to geometry and state in a render graph for processing during the draw traversal. The osgViewer library supports many threading models, some of which run the cull and draw traversals in one or more threads.

如第一章中所说的，拣择遍历包含了在一个绘制遍历时衬着图形中对于geometry和state的引用。osgViewer库撑持多线程模型，此中包括单or多线程的拣择遍历及绘制遍历。

As Chapter 1 explains, the cull traversal stores references to geometry and state in a render graph for processing during the draw traversal. The osgViewer library supports many threading models, some of which run the cull and draw traversals in one or more threads.

如第一章中所说的，拣选遍历包含了在一个绘制遍历时渲染图形中对于geometry和state的引用。osgViewer库支持多线程模型，其中包括单or多线程的拣选遍历及绘制遍历。

This paper proposed a transformable model of EWDG (edge-weighted directed graph) and VWDG (vertex-weighted directed graph) to resolve the problem of weighted traversal patterns mining. Based on the model, developed a new algorithm, called LGTWFPMiner (local graph traversals-based weighted frequent patterns miner), and its local estimation of support/weight-hound to discover weighted frequent patterns from the traversals on graph with a level property.

为解决加权遍历模式挖掘问题，首先提出了一种从EWDG到VWDG的变换模型；基于这种模型，提出了在具有层次特性的局部图遍历中，挖掘加权频繁模式的LCTWFPMiner（局部图遍历加权频繁模式挖掘法）及其支持度／权值界的局部评枯方法。

The equal distance 3-improved-coverage number of beacon sending position is presented according the acreage of ROI.Then a simple method is put forward to calculate the coordinates of the sending positions in rectangular ROI.Aiming at the shortage of the existent sequence algorithm,when beacon moves according to the path and emits RF signals at every position,the ant colony algorithm is applied to the position sequence so as to get the beacon sending position.Further,in this algorithm the sensors could work out their position with trilateration.

根据ROI面积给出了等距三重优化覆盖此ROI所需要的信标发射位置数量计算方法；随后对矩形ROI提出了一种简单的信标发射位置确定方法；针对现有的遍历发射位置点的路径遍历算法的不足，提出了一种新的应用蚁群算法的信标发射位置点的遍历算法，并利用该算法对基于三边测量方法进行传感器节点定位。

与遍历相关的网络解释 [注：此内容来源于网络，仅供参考]

ergodic chain：遍历链

遍历理论|ergodic theory | 遍历链|ergodic chain | 遍历信源|ergodic source

ergodic markov chain：遍历马尔可夫链

ergodic hypothesis 遍历假说 | ergodic markov chain 遍历马尔可夫链 | ergodic property 遍历性

ergodic markov chain：遍历马尔科夫链

遍历 ergodic | 遍历马尔科夫链 ergodic Markov chain | 遍历随机过程 ergodic random process

ergodic hypothesis：遍历假说

ergodic chain 遍历马尔可夫链 | ergodic hypothesis 遍历假说 | ergodic markov chain 遍历马尔可夫链

ergodic property：遍历性

ergodic markov chain 遍历马尔可夫链 | ergodic property 遍历性 | ergodic state 遍历态

ergodic state：遍历态

ergodic property 遍历性 | ergodic state 遍历态 | ergodic theorem 遍历定理

ergodic state：遍历状态

ergodic process 遍历过程 | ergodic state 遍历状态 | ergodic theorem 遍历定理

ergodic theorem in the mean：平均遍历定理

ergodic theorem 遍历定理 | ergodic theorem in the mean 平均遍历定理 | ergodic theory 遍历理论

preorder traversal：先序遍历

子树记作 遍历根的左子树记作 L 遍历根的右子树记作 遍历根的右子树记作 R 则可能的遍历次序有 DLR DRL 逆先序 先序 LDR RDL 逆中序 中序 LRD RLD 逆后序 后序 先序遍历 (Preorder Traversal) 先序遍历二叉树算法的框架是 若二叉树为空,

postorder traversal：后序遍历

同理,森林的中序遍历(inorder traversal)与其对应的二叉树的中序遍历也会产生相同的结果,但森林的后序遍历(postorder traversal)与其对应的二叉树后序遍历的结果不会相同,因为二者的间没有自然对应的关系存在.