资源列表
4
- 输入n个数，求这n个数构成的集合的所有子集-Enter the number n, find the n number of the set of all subsets
lingo_from_entry_to_the_master
- LINGO是用来求解线性和非线性优化问题的简易工具。LINGO内置了一种建立最优化模型的语言，可以简便地表达大规模问题，利用LINGO高效的求解器可快速求解并分析结果。-LINGO is used to solve linear and nonlinear optimization problems simple tools. LINGO built an optimization model to establish the language, you can easily express
mtklppt
- 这个ppt详细介绍了Monte carlo 算法 ，并且附有简单的实例，便于更好的理解。-The ppt Monte carlo algorithm described in detail, and with a simple example, to facilitate better understanding.
IT
- 详细介绍了一种新的仿真软件IT++ 比matlab有更快的执行效率 -Introduced a new simulation software IT++ faster than the efficiency with matlab
DNA_sort
- 这是一道程序设计题目，DNA排序问题。具有一定的借鉴价值-This is a subject of program design, DNA sequencing problems
optimization
- 基于最速下降法、牛顿法、共轭梯度法的matlab程序 -Steepest descent Newton conjugate gradient method
matrixmult2
- CUDA Fast matrix multiplication and with shared memory.
FastKalmanAlgorthm
- 快速卡尔曼算法是递推最小二乘算法中的一种, 它的收敛速度比梯度算法快得多, 其计算量又比常规卡尔曼算法少得多, 特别适合于跟踪像电离层这样的快变化时变信道。 本文对 用于自适应均衡的快速卡尔曼算法进行了详细研究。-Fast Kalman algo r ithm is one of recursive least squares algo r ithm s . It has much faster equalizer convergence than the gradient algo
gedecaixiang
- “歌德巴赫猜想”指出，每个大于6的偶数，都可以表示为两个素数之和。试用程序将6~100内的所有偶数表示为两个素数的和-" Goldbach conjecture" that every even number greater than 6, can be expressed as the sum of two primes. Trial procedure within the 6 to 100 all even said the two prime numbers and
xiangqin
- 1、 求1000以内的“相亲数”。所谓相亲数是指这样的一对数：甲数的约数之和等于乙数，而乙数的约数之和等于甲数。-1, find the 1000 within the " amicable number." The number of so-called blind date is like a pair of numbers: the number of divisors of A and B is equal to the number, the approximate
4B_BCD2HEX
- 8 digits bcd to hex converter
ACM_alio
- ACM 国际大学生 程序设计的典型数学方面的函数 包括一部分的数值计算-ACM International Collegiate Programming typical mathematical functions, including part of the numerical calculation