资源列表
GS
- Gauss seidal method to solve the system of equations
BPN
- BP人工智能的源程序，希望能对大家有用，帮助大家学习-BP artificial intelligence source, the hope that useful
12-01bag
- 01背包问题 问题陈述：给定n种物品和一背包，物品i的重量是wi，其价值为vi，背包的容量为C。合理选择物品装入背包，使得装入背包中物品的总价值最大。在选择装入背包的物品时，对每种物品i只有两种选择，即装入背包或不装入背包。不能将物品i装入背包多次，也不能只装入部分的物品i。 问题分析：0 1背包问题是一个子集选取问题，适合于用子集树表示0 1背包问题的解空间。在搜索解空间树时，只要其左儿子结点是一个可行结点，搜索就进入左子树，在右子树中有可能包含最优解时才进入右子树搜索；否则将右子树
5240980100009119
- ofdm signal generation
1-ETS
- 问题陈述：有一推销员，欲到n(n<=10)个城市推销产品。为了节省旅行费用，在出发前他查清了任意两个城市间的旅行费用，想找到一条旅行路线，仅经过每个城市一次，且使旅行费用最少。-Problem Statement: a salesman, n (n < = 10) cities want to sell products. Before departure in order to save travel expenses, he find out the cost of travel
lapack-3.4.2
- LAPACK, version 3.4.2 LAPACK is written in Fortran 90 and provides routines for solving systems of simultaneous linear equations, least-squares solutions of linear systems of equations, eigenvalue problems, and singular value problems.
calculadora
- implementation of the calculator in language assembler for MIPS 32 bits in simulator MARS, the program was developed in portuguese
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 certain number, so that their eq
n7102-cwm6.0.1.9-root
- 三星n7102-cwm6.0.1.9-root工具-Samsung n7102-cwm6.0.1.9-root tool
8Queen
- 用递归解决八皇后问题。3种做法。面向对象和面向过程。-8queen problem solved in recursive algorithm。
ALGORITMA-bil-klipatan-7
- Algoritma Bilangan Kelipatan tujuh (Bahasa Indonesia)
beibao
- 解决算法中的数组问题，很详细很精确的解法，让你一看就明白-Solve an array of problems in the algorithm, very detailed and very accurate solution, let you see at a