搜索资源列表
subset
- 用回朔算法解决子集和问题 输出整数集的所有子集，使子集的各元素之和为S-Schomburg algorithm used to solve the problem and the subset of output Integer Set subset of all, the subset of the elements and as S
20051121
- 利用 lex 和yacc自动生成C语言子集的词法分析和语法分析程序的源程序-using lex and generates automatic generation of C language subset of lexical analysis and parsing the source code of procedure
subset
- 用回朔算法解决子集和问题 输出整数集的所有子集，使子集的各元素之和为S-Schomburg algorithm used to solve the problem and the subset of output Integer Set subset of all, the subset of the elements and as S
subset
- 利用回溯法求解子集和问题的C++实现 给定正整数集合S和正整数c计算出子集和s1使得子集合之和为c-The use of retrospective method and problems in a subset of the C++ Achieve a given positive integer set S and positive integer c calculated subset and makes a subset o
subset
- 求一个集合的子集的非递归解法，模拟的栈的进出。-For a subset of a collection of non-recursive method to simulate the stack and out.
subset
- 子集和问题的一个实例（s，t).其中s是一个正整数集合，t是一个正整数。子集和问题判断是否存在s中的一个子集s1，使得s1的和等于t-And problems in a subset of an instance (s, t). Which is a positive integer s collection, t is a positive integer. Subset and to determine whether proble
NRS_FW_FS
- Neighborhood rough set based heterogeneous feature subset selection
Subset
- 这是一个关于用递推法解决求某一个集合的所有的子集。非常适合初学数据结构的同胞阅读。-It is a recursive method used to solve a set for a subset of all. Data structure is very suitable for beginners to read compatriots.
Sample-subset-partitioning
- 近红外光谱分析中要从复杂的信息中有效地提取相关信息建立可靠的模型，选择的训练集要具有较好的代表性。目前．样本的选择方法主要包括random sampling(RS)，Kennard—Stone(KS)．sample set partitioning based on joint x-y distance(SPXY)等方法 。-selecting a representative subset in NIR data using SPXY
SUBSET
- Subset construction... Subset construction done in compiler design
Subset
- 子集和数问题.rar，用C++写的，可以运行-Subset of several problems. Rar, written in C++, you can run
subset
- 组合数学中，求一个集合的子集的算法源码，很实用。-Combinatorial Mathematics, find a subset of a collection algorithm source code
Pascal-subset-compile
- 按照Pascal子集的语法，并参考Pascal语言的语义，设计并实现Pascal子集的编译程序，给出各阶段的设计资料和实现成果-Subsets according to the syntax of Pascal and Pascal language reference semantics, design and implementation of a subset of the Pascal compiler, given the v
iterative--subset-sum
- 子集和的迭代算法,一个序列，序列中得子集和等于给定数的所有解答-subset sum ：iterative method
Maximum-Subset-Intersection
- Maximum Subset Intersection Rapha¨el Cliff ord and Alexandru Popa University of Bristol, Department of Computer Science, Merchant Venturer’s Building, Woodland Road Bristol, BS8 1UB, United Kingdom
Subset-repartition
- 改程序涉及的是子集划分问题。将已知集合划分成不相交的子集，任何子集上的元素满足互不冲突。-Subset repartition
Subset-of-the-algorithm-and-back
- 子集和数的回溯法，用C++编写程序并运行得到结果。-Subset of the algorithm and back
subset-of-solving
- C语言中采用位运算进行真子集的求解，主要作为位运算的例程或者引导学生的利用位运算的解题思路-Solving ideas using bitwise operations in C language proper subset solving, primarily as a bit arithmetic routines or guide students in the use of bit operations
13-Subset-and-Number
- 问题陈述：给定N个数，和一个数T，判定是否可以从N个数中取出若干个数，使它们的和等于T。输出：YES或者NO。把N个数看成一个集合，问题就是从这个集合中选出一个子集，使这个子集满足和是T-Problem Statement: a given number N, and a number of T, and determines whether or not can be removed from the number N of a ce
subset simulation
- 可靠性分析中的数值模拟算法，子集模拟，可以解决高维小失效概率问题。(the method of reliability analysis-subset simulation.)