您要查找的是不是:
- depth first search tree 深度优先搜索树
- A hybrid algorithm combined with dynamic programming and the lower bound (or upper bound) algorithm is proposed. It is on the basis of analysing the depth first search (DFS) and the breadth first search (BFS) methods. 本文分析了深度优先搜索方法 (DFS)和广度优先搜索 (BFS)方法的特点 ,提出了一种混合使用动态规划方法和下界 (上界 )算法的精确求解方法求解组合优化问题。
- By making use of these rules, graph's depth first search recursive algorithm and n-order Legendre polynomial recursive algorithm are (converted) to equivalent non-recursive algorithms. 利用该组规则将图的深度优先搜索(DFS)和n阶勒让德多项式的递归算法转换成了等价的非递归算法.
- Combined with AI theory, an algorithm for recognizing the energized state of telecontrol system of electric railway feeding lines is proposed based on a heuristic depth first search approach. 算法实现了牵引供电远动系统线路带电推导,对该算法进行了理论分析,并给出了实现该算法的控制策略及软件框图。
- A novel trajectory pattern learning method based on vector quantization and depth first search 基于矢量量化和深度优先搜索的轨迹分布模式学习算法
- Application of Depth First Search(DFS)in Large-scale Digital Information Processing System DFS搜索法在大规模开关信息处理系统中的应用
- Keywords ventilation network;network flow;extremal flow;independent paths;augmented path;depth first search algorithm; 通风网络;网络流;极值流;独立通路;增广路;深度优先搜索法;
- adaptive depth first search 深度优先搜索
- depth first search 深度优先搜索
- The gridding arithmetic of search tree of robotic path is derived. 同时,还推导了机器人路径搜索树网格算法。
- Generalized Search Trees for Database Systems. 数据库普通查询树。
- Will first search the name table and container for an object of the same name. 将首先在名称表和容器中搜索同名的对象。
- Some limit laws for the branches and subtrees in a random recursive tree and binary search tree are established in this dissertation. 本文主要研究随机递归树和随机二叉搜索树上与分支和子树相关的极限定理。
- The experimentation proves that the game procedure designed by genetic algorithm outweighs that designed by search tree. 实验表明,用遗传算法所设计的对弈程序优于搜索树法。
- In this paper, we put forward a region representation data structure-digital search tree(DST) and its lineal encoding (LDST). 一、引言 区城表示在图象处理、计算机图形学、景物分析中有重要的应用。
- This chapter will introduce a balanced AVL search tree, to discuss its information structure, function, and design program to use it. 本章将介绍平衡的 AVL 搜寻树,讨论它的资料结构、函式,并设计程式使用它。
- Then, in spite of the failure of his first search, he began a second, after having told Gaetano to roast one of the two kids. 他叫盖太诺在两只小山羊里挑一只来烤着吃,然后,不顾第一次的失败,他又开始了第二次搜索。
- Using a binary search tree or dividing the string into segments as long as the square root of the length of the string will solve the problem. 用一个二叉搜索树或者将串切分成长度的平方根那么长的小段都可以解决这个问题。
- He first searched for remains of early man in Jehol, then in Thailand. 他先在热河省,后来又在泰国寻找早期人类的化石遗存。
- He first searched for remains of early man in Jehol, then in Thailand . 他先在热河省,后来又在泰国寻找早期人类的化石遗存。