1) two-level method with backtracking
回溯二重水平法
2) backtracking n.
回溯法;回溯
3) duple-back-tracing searching algorithm
双重回溯搜索算法
4) backtracking
[英]['bæktræk] [美]['bæk,træk]
回溯法
1.
Improving the efficiency of backtracking;
不同数据结构下回溯法效率的比较
2.
dynamic programming,recursion and backtracking are three kinds of typical algorithms to solve the 0/1 knapsack problem.
动态规划法,递归法,回溯法是求解该问题的三种典型方法,使用这三种方法求解0/1背包问题,并对各算法进行了理论分析。
3.
This paper will introduce five algorithm design methods, which are Greedy method, Dynamic programming, Backtracking, Branch and bound, Genetic algorithm, summarize their basic tenets, give the solving algorithm thought to 0/1 knapsack problem, analyse the algorithms and put forward the improving methods.
本文分别从贪心方法、动态规划、回溯法、分枝-限界法,遗传算法这五种算法设计方法入手,概述了各种设计方法的基本原理,提出了求解0/1背包问题的算法思想,并对算法进行分析,提出了改进方法。
5) backtracking algorithm
回溯算法
1.
Application and research of backtracking algorithm based on matrix storage in multi-constraint assignment problem;
基于矩阵存储的回溯算法在多约束分配问题中的应用探讨
2.
Discussion about Backtracking Algorithm of n-Queen Problem;
N皇后问题回溯算法探讨
3.
Problems search algorithm based on the broad first backtracking algorithm;
基于广度优先回溯算法的试题搜索算法
6) backdating method
回溯法
1.
The method of determining the paths based on backdating method according to the network is given,and the method of computing the path reliability is proposed.
针对该网络给出了基于回溯法的通路确定方法,进而给出了通路可靠性的计算方法。
补充资料：水平布里奇曼法(见布里奇曼法生长单晶)
水平布里奇曼法(见布里奇曼法生长单晶)
horizontal Bridgman method
小十巾里苛曼法ho见布里奇曼法生长单晶。rlzontal Br主dglllan method
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条