The priority first search algorithm (PFS algorithm for short) is discussed in this paper.
讨论了“优先度优先搜索”算法(简称PFS算法)。
In this paper, the breadth-first search algorithm on the interconnection network is given and applied to the twisted cube.
本文给出互连网络上的广度优先搜索算法，并将其应用到螺旋立方体上。
Diffuse water source routines for the implementation of the breadth first search algorithm of diffuse water easy language breadth first search.
易语言广度优先搜索实现漫水法源码例程程序通过广度优先搜索实现了漫水算法。可用于去除图像杂色，分割图像等。
The shortest topological distance between two atoms in a structure was designed according to the widely used breadth first search algorithm which uses a data structure called Queue.
分子结构中任意两个原子之间最短拓扑距离的求解是建立在采用队列数据结构的宽度优先搜索算法基础上的。
The system builds firstly the objective state of the container stack on the principle and then searches for the steps of turning box using the non-conventional breadth-first search algorithm.
混合优化策略首先根据堆箱规则构造集装箱堆栈目标状态，然后运用改进广度优先算法搜索搬箱步骤。
Making use of precomputation, algorithm ERAMC simplifies network topology and USES a breadth-first search algorithm with priority to find a transmission path that satisfies multiple constraints.
ERAMC算法利用预先计算来简化网络拓扑，然后采用带优先权的宽度优先搜索算法寻找满足多个限制条件的传输路径。
Obviously, the firm that obtains the algorithm first will propel all of their clients to the top of the search results with ease.
显然，第一个获得该算法的公司将会轻而易举地把自己的客户推到搜索结果的最顶端。
The first is Grover's search algorithm, also known as the reverse phone book search, where someone's number is known but not the name.
第一种是Grover的搜索算法，也被称为反向电话薄搜索，其中只有某人的电话号码，而没有记录名字。
A novel Unit Tree-based Breadth First Search (UTBFS) algorithm is proposed.
提出基于单元树结构的广度优先搜索算法utbfs。
The algorithm adopts a hierarchical structure in knowledge rule while the breadth and depth, first search is integrated in reasoning strategy.
该算法应用的知识规则采用分层结构，在推理策略上综合应用深度和广度优先搜索。
The basic idea of the algorithm is this: a depth-first search begins from an arbitrary start node (and subsequent depth-first searches are conducted on any nodes that have not yet been found).
基本思想是：从任意一个结点出发深搜（后续的深搜要在未访问过的结点上进行）。
Google on Monday 's official blog announced the site search ranking process details, and first released a series of related search algorithm of the latest improvements.
周一谷歌在官方博客上公布了有关网站搜索排名过程的细节，并首次发布一系列有关搜索算法的最新改进。
The search strategy of our algorithm integrates a depth-first traversal of the prefix sequence lattice with two effective pruning mechanisms.
算法采用了深度优先挖掘策略，并将基于前缀序列格的深度优先遍历与两种高效的剪枝策略相结合。
Previously, it has been revealed Google search algorithm to improve, but Monday's blog is the first release of this level of a series of improved details.
以前，谷歌也曾透露过搜索算法的改进，但周一的博客是第一次发布这种级别的一系列改进细节。
BWFSF algorithm partition synchronous sequential circuit to many big function blocks by backward width-first search with fli.
面向逻辑级描述的同步时序电路，以触发器为核的电路划分算法BWFSF将电路划分为大功能块。
The second algorithm is also derived from the breadth-first search method.
第二个算法也是基于广度优先搜索策略。
Beam search is a heuristic search algorithm that is an optimization of best-first search that reduces its memory requirement.
定向搜索是一种启发式搜索算法，它是对减少内存需求的最佳优先搜索的优化算法。
The result reflects the Vertex substitution search algorithm performs best in both speed and result aspect, it is the first choice when policy-maker selects algorithm.
研究得到结论是节点交换搜索算法在速度和结果方面都表现最好，是决策者进行决策时首选算法。
According to this hybrid trust model, it presents an algorithm constructing a path base on a depth first search, and summarizes the path validation algorithm.
针对该信任模型，提出一种深度优先搜索的路径构建算法，并对路径验证算法进行了概述。
A method to mark transitive predecessors and transitive successors by using depth first search is provided with a description of the algorithm based on stack.
给出了先序活动和后序活动的基本定义，讨论了运用深度优先搜索进行先序活动和后序活动标定的基本原理，提出了基于堆栈机制的标定算法。
This paper proposes a breath-first search based data collection tree algorithm that taking in account size of backbone, energy of node and path. The data collection tree is maintained locally.
本文综合考虑骨干网的大小、节点能量及路径，提出了一种基于广度优先搜索的数据收集树算法，并采用局部式方法进行维护。
This method USES intermediate nodes' location information to create undirected graph at destination node, and USES Breath-First Search (BFS) algorithm to find another disjoint path.
本文提出的方法在目的端利用获得的中间节点位置信息来生成无向图，再利用广度优先遍历算法BFS计算出另外一条不相交路径。
This method USES intermediate nodes' location information to create undirected graph at destination node, and USES Breath-First Search (BFS) algorithm to find another disjoint path.
本文提出的方法在目的端利用获得的中间节点位置信息来生成无向图，再利用广度优先遍历算法BFS计算出另外一条不相交路径。
应用推荐