在理论方面，提出了一个上下文无关语言句子枚举算法。
In theory, an algorithm of enumerating sentences of CFG is presented.
算例证明该算法的求解质量好于目前该领域常用的隐枚举算法。
An illustration of the method showed that the solution quality by the HGA is better than that by Implicit Enumeration most in use.
算例证明，该算法的求解质量优于目前该领域常用的隐枚举算法。
An illustration of the method shows that the solution quality by the HGA is better than that by Implicit Enumeration most in use.
提出了关于最大团问题的一种新思路基于平均度排序的局部枚举算法。
A new algorithm for the maximum clique problem has been presented in this paper, the local enumerative algorithm based on average degree sorting.
与其它算法（例单纯形法、割平面法）不同，本文提出的启发式隐枚举算法能很好的解决此类问题。
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.
着重研究了系统的连通性、状态切换等几个问题，并结合电网模型对状态枚举算法提出了优化策略。
Mainly studied the system connectivity, the status switching and so on, and putting forward the optimization algorithm for state enumeration method combined with the power network model.
这个枚举器将使用比较器作为排序算法，从记录存储创建一个记录结果集。
The enumerator will create a result set of records from the record store, using the comparator as the sorting algorithm.
使得特性检查在业界获得成功的因素是象征遍历算法，它无保留地枚举状态空间。
What makes property checking a success in industry are symbolic traversal algorithms that enumerate the state space implicitly.
该算法基于行枚举，通过长事务的交集运算，直接得到长项集，不必从短项集逐步扩展得到长项集。
The algorithm is based on row enumeration, which can find high-utility long itemsets directly by intersecting long transactions, without extending short itemsets step by step.
这个算法本质上是通过系统地枚举网络的一类特殊子网络而计算其ST可靠性或生成可靠性表达式。
An algorithm for computing ST reliability was presented, it computed ST reliability or produced a ST reliability expression by enumerating a class of special subnetworks of given.
这个算法本质上是通过系统地枚举网络的一类特殊子网络而计算其ST可靠性或生成可靠性表达式。
An algorithm for computing ST reliability was presented, it computed ST reliability or produced a ST reliability expression by enumerating a class of special subnetworks of given networks.
本文提出用0 - 1整数规划的隐枚举法，求解网络的多中心问题，算法简单，容易实现。
In this paper, the problem of multi-centres in a network is solved using implicit enumeration method for 0-1 integer programming. The algorithm is simple and can be easily realized.
阐述割平面方法、整基方法、枚举和启发式方法和逼近算法。
Develops cutting plane methods, integral basis methods, enumerative and heuristic methods and approximation algorithms.
这个算法本质上是通过系统地枚举网络的一类特殊子网络而计算其ST可靠性或生成可靠性表达式。
It computes ST reliability or produces a ST reliability expression by enumerating a class of special subnetworks of given networks.
在求解算法上，提出隐枚举法与网络单纯形法相结合的求解方法。
We also present an algorithm based on implicit enumeration and simplex method on network.
根据限流措施优化配置问题的特点，提出先对候选可开断支路采用枚举法求解支路开断的优化方案，再采用改进离散粒子群算法(MDPSO)求解综合限流方案。
An enumeration method was used to get the optimal splitting of the candidate branches. A modified discrete particle swarm optimization algorithm (MDPSO) was used to get the final strategy.
本文深入探讨了每类算法中的代表算法，其中根据数据挖掘中枚举树相关技术提出了一种可能的公共子树查找算法的思想。
Among these three categories a possible common subtree algorithm is presented based on the enumeration tree technique of data mining domain.
文中最主要的成果是两种从最大未标记信标中查找所有严格极小信标的算法，枚举法和回溯法。
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.
文中最主要的成果是两种从最大未标记信标中查找所有严格极小信标的算法，枚举法和回溯法。
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.
应用推荐