... cultural algorithms 文化算法 enumeration algorithms 枚举算法 equalization algorithms 均衡算法 ...
基于12个网页-相关网页
The heuristic implicit enumeration presented in this thesis can effectively solve this kind of problems. It is different from other algorithms, such as simplex, cutting plane method, etc.
与其它算法（例单纯形法、割平面法）不同，本文提出的启发式隐枚举算法能很好的解决此类问题。
This article gives three algorithms for all permutations of 1 to N, analyzing the application of this problem in stack and enumeration of binary tree.
文章给出了1至N全排列问题的三种求解算法，分析了该问题在栈及二叉树计数中的应用。
The main achievements of the research are the two algorithms that can search all SMS from a maximal unmarked siphon as well as enumeration and backtracking methods of siphon computation.
文中最主要的成果是两种从最大未标记信标中查找所有严格极小信标的算法，枚举法和回溯法。
应用推荐