A novel trajectory pattern learning method based on vector quantization and depth first search;
基于矢量量化和深度优先搜索的轨迹分布模式学习算法
Coordinate transformation model Ⅰ by coordinate transformation and computer simulation, depth first search model Ⅱ and dynamic model.
针对截断切割的加工费用最少的问题，建立了４个模型，模型Ⅰ是利用坐标变换的方法和计算机模拟对所有加工方式枚举得出了加工费用最省的方法；考虑到算法的优化，给出了深度优先搜索模型Ⅱ；当调整刀具需额外费用ｅ≠０时，建立了动态规划模型Ⅲ；最后为解决实际中的精加工或超精加工的磨削余量问题建立了模糊线性规划模型Ⅳ，从而完满的解决了问题。
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.
给出了先序活动和后序活动的基本定义,讨论了运用深度优先搜索进行先序活动和后序活动标定的基本原理,提出了基于堆栈机制的标定算法。
Application of the depth-first search method in the calculation of water supply pipe networks;
深度优先搜索在给水管网计算中的应用
Improved depth-first search algorithm for valued constraint satisfaction problem;
加权约束满足问题的改进深度优先搜索算法
Survey of quick thinning algorithm based on depth-first search;
基于深度优先搜索的快速指纹细化算法改进
An elicitation DFS arithmetic based on C++ class object is put forward and used for writing the program of orbit simulator.
采用 C++的类对象对递归算法进行改进 ,提出了一种基于 C++类对象递归带启发的深度优先搜索算法 ,并将其应用于轨道模拟盘软件的研制
(3) By analysis of the graph-based Depth First Search(abbreviation for DFS) of network division,we propose a method to access the network topology based on the algorithm.
(3)通过对图的深度优先搜索(缩写为DFS)划分算法的分析,提出利用基于DFS的网络分割算法进行网络拓扑的方法,从而获得了一个描述网络连接情况的无向连通图G(V,E)。
Firstly the judge-algorithm whether a digraph is complete connected graph is designed by the depth-first-search algorithm of digraph.
首先利用图的深度优先搜索方法给出了有向图为强连通图的判定算法,然后利用图的广度优先搜索方法给出了有向图是欧拉图和有向边是桥的判定算法,最后给出了求有向图的所有欧拉回路算法,并通过实例验证了算法的有效性。
This paper presents a program which can calculate normal form automatically by computer,where the depth-first-search of artificial intelligence and powerful symbolic operation provided by Maple software are employed.
利用人工智能中的深度优先搜索算法以及Maple数学软件强大的符号运算功能,给出一个Maple程序,用它可以实现规范型的计算机自动计算。
As a very important decision algorithm in graph theory, the optimization of the algorithm of depth first search tree will give an advantage to dealing with algorithm of other graph theory efficiently.
深度优先搜索树的判定是图论中的一个重要算法,它的算法的优化将给一些其它的图论算法带来高效解决的契机。
breadth-and-depth-first search
宽度与深度优先搜索
depth-first search with automatic backup
具有自动回溯的深度优先搜索
queue-oriented depth-first search program
面向队列的深度优先搜索程序
Depth-first search algorithm based on special properties of PFSP
一种基于PFSP性质的深度优先搜索算法
depth-first graph-search control strategy
深度优先图搜索控制策略
A Scan Line Seed Filling Algorithm Based on Deep Prior Search
基于广度优先搜索的扫描线填充算法
9.1.2 Search Qualifier Precedence
9.1.2 搜索修饰符的优先级
Random Depth-first Search Algorithm used in optimal path problem of large transport network
大型交通网络最优路径的随机深度搜索算法
Using Improved Extent Preferential Search Algorithm to Compute Travel Range of Any Point in the Map;
用改进的广度优先搜索算法计算点的出行范围
Analysis and Implementation of Breadth-first Search Traversing Graph Algorithm
图的广度优先搜索遍历算法的分析与实现
Applied Research on Breadth-first Path Search Method in Fluid Network
广度优先路径搜索法在流体网络中的应用研究
A Novel Method of BFS with AI-Properties of VCN
一种基于VCN智能特性的宽度优先搜索法(英文)
A Breadth-first-search Algorithm for Deriving Minimal Unsatisfiable Subformulae in Satisfiability Modulo Theories
求解极小SMT不可满足子式的宽度优先搜索算法
Effects of Prior Knowledge, Hierarchy Depth and Type of Hypertext on the Search Performances of Chinese Information with a Low Structure Level
先前知识、超文本层次深度和类型对低结构化信息搜索的影响
Distribution System Reliability Assessment Minimal Path Method-BFS;
应用最小路—广度优先搜索的配电系统可靠性评估
Realization and Application of Fast Dynamic Priority Search Tree
快速动态优先搜索树的实现及其应用
Delaminating deepness searching tree anti-collision algorithm in RFID system
分层深度搜索树型RFID防碰撞算法设计
depth-first minimax procedure
深度优先最小最大过程
