广度优先算法,breadth-first search algorithm
1)breadth-first search algorithm广度优先算法
1.Based on the breadth-first search algorithm for three-dimensional parking storehouse,the paper introduces a kind of management algorithm,which could be applied to all kinds of parking storehouse.文章介绍了基于广度优先算法的升降横移式立体车库调度算法,该算法适用于某公司生产的所有立体停车库,解决了不同层数(型号)车库的调度算法不能统一化、智能化的问题,提高了系统的可靠性、可扩展性和可维护性,降低了生产成本和维护成本。
2)depth-breadth priority searching method深度-广度优先算法
3)the breadth-first search(BFS) algorithm广度优先搜索算法(BFS)
4)breadth-first traversal广度优先生成法
5)breadth-first广度优先
1.Based on breadth-first search,through the Breadth-First search and the ADT stack,the layer structure and the node order of back/forward sweep are formed.针对辐射状配电网的结构特点,应用前推回代法进行潮流计算,以广度优先搜索策略为理论基础,通过广度优先搜索遍历并借用ADT栈形成网络层次结构,来确定前推回代的节点顺序,形成一种实用的配电网潮流计算方法。
2.A network topology discovery algorithm based on breadth-first is introduced.介绍了一种基于广度优先的网络拓扑发现算法。
3.A new search method was given for a game-tree with breadth-first in the first layer nodes and continuously minimal window test by deep analysis on game-tree search algorithms.通过对机器博弈主要搜索算法的深入分析和实践,提出了在博弈树一层结点中以广度优先方式,运用接力式空窗探测技术反复淘汰到只剩一个结点的新搜索方法。
英文短句/例句

1.A Scan Line Seed Filling Algorithm Based on Deep Prior Search基于广度优先搜索的扫描线填充算法
2.Research and application of breadth-first reasoning method based on match degree基于匹配度的广度优先推理方法的应用研究
3.Using Improved Extent Preferential Search Algorithm to Compute Travel Range of Any Point in the Map;用改进的广度优先搜索算法计算点的出行范围
4.Analysis and Implementation of Breadth-first Search Traversing Graph Algorithm图的广度优先搜索遍历算法的分析与实现
5.Applied Research on Breadth-first Path Search Method in Fluid Network广度优先路径搜索法在流体网络中的应用研究
6.Distribution System Reliability Assessment Minimal Path Method-BFS;应用最小路—广度优先搜索的配电系统可靠性评估
7.A study on creativity in priority system of developing hi-tech industry in Guangzhou;广州高新技术产业优先发展的制度创新研究
8.breadth-and-depth-first search宽度与深度优先搜索
9.depth-first minimax procedure深度优先最小最大过程
10.depth-first minimax深度优先最小最大法
11.(amount of)advantage gained or allowed in starting;advantageous position起始时的领先(程度);起始优势;优势地位
12.Precedence, especially established by order of importance or urgency.领先,优先尤指按重要性或紧急程度的顺序建立的优先地位
13.For the machines selecting algorithm, the detailed steps are designed.在机床优先调度算法中,设计了机床优先调度算法的步骤。
14.Advertising agency , financial service industry experience a plus.有广告公司、金融服务公司工作经验者优先考虑。
15.Preferred Argument Structure in English Broadcast News Discourse;英语广播新闻语篇中的优先主目结构分析
16.The Priority of Business Starting:A New Practical and Generalized Thought on Vocational Higher Education;创业优先:高职教育的一种现实性广义思维
17.More important than SEO is link popularity.比搜索引擎优化更重要的是链接广度。
18.A Goodness of Fit Test for General Power Law Process广义幂律过程的一个拟合优度检验法
相关短句/例句

depth-breadth priority searching method深度-广度优先算法
3)the breadth-first search(BFS) algorithm广度优先搜索算法(BFS)
4)breadth-first traversal广度优先生成法
5)breadth-first广度优先
1.Based on breadth-first search,through the Breadth-First search and the ADT stack,the layer structure and the node order of back/forward sweep are formed.针对辐射状配电网的结构特点,应用前推回代法进行潮流计算,以广度优先搜索策略为理论基础,通过广度优先搜索遍历并借用ADT栈形成网络层次结构,来确定前推回代的节点顺序,形成一种实用的配电网潮流计算方法。
2.A network topology discovery algorithm based on breadth-first is introduced.介绍了一种基于广度优先的网络拓扑发现算法。
3.A new search method was given for a game-tree with breadth-first in the first layer nodes and continuously minimal window test by deep analysis on game-tree search algorithms.通过对机器博弈主要搜索算法的深入分析和实践,提出了在博弈树一层结点中以广度优先方式,运用接力式空窗探测技术反复淘汰到只剩一个结点的新搜索方法。
6)width-priority广度优先
1.A New Topology Processor based on Width-Priority;基于广度优先的快速拓朴分析法
2.This paper describes a new topology processor based on width-priority for dynamic simulation in dispatcher training simulator (DTS).提出一种用于调度员培训仿真器(DTS)动态过程仿真的、广度优先的快速拓扑搜索以及跟踪、修正算法。
延伸阅读

表优先级算法表优先级算法list priority algorithm b 100 youx一anli suanfa表优先级算法(list priority al即rithm)按照物体离视点的远近进行优先级排序从而对图形实施有序绘制的一种消隐算法。该算法的处理过程与画家创作一幅油画类似,先画远景,再画中景,最后画近景。因而该算法在处理简单元素(如多边形)时常被称为油画算法。 表优先级算法首先根据物体深度进行排序,按照环境中各元素离视点的远近确定一个深度优先级表。然后按照表中元素的先后次序,从离视点最远的图形元素开始,依次将每个元素绘制到屏幕画面中。这样,表中离视点较近的元素在绘制时会通过在帧缓冲器中写人新的内容而覆盖离视点较远的元素,从而达到消隐的目的。 当环境中各元素具有确定的深度次序时,该算法能准确地实现面消隐。但如果图形元素之间存在不确定的优先次序(比如元素之间在深度方向上交叉覆盖)时,则可以对物体元素进行一定的预处理,比如对交叉祝盖的元素进行分割,从而使之具有确定的优先次序。