-
mako
solutions to linear systems numerical analysis
- 2012-11-30 19:45:09下载
- 积分：1
-
Adaptnoise
c_语言，代码，用于数字信号处理开发板
TMS3206713
自适应滤波器，LMS 算法去除噪声。(LMS adaptive filter cancel noise)
- 2011-07-04 11:15:37下载
- 积分：1
-
largest_lyapunov
混沌时间序列算法中求解最大李雅谱诺夫常数。(Chaotic time series algorithm to solve the maximum lyapunov constant.)
- 2012-09-17 11:03:39下载
- 积分：1
-
NetPowers3Ph
Network Powers 3 Phases
- 2013-04-17 11:27:05下载
- 积分：1
-
som-bp混合神经网络的matlab程序
说明： 本文件包含som-bp串联神经网络的代码和数据，可用来做数据拟合，改成你自己的数据即可(This file contains the code and data for the som-bp series neural network, which can be used for data fitting and changed to your own data)
- 2020-07-02 13:00:01下载
- 积分：1
-
chaper6
非常不错的书籍，《微粒群算法》供8章和2个附录，依次上传第6章绪论(Very good books, Particle Swarm Optimization for 8 chapters and two appendices, followed by From Chapter 6 Introduction)
- 2008-12-20 11:38:11下载
- 积分：1
-
hhk
program finding of points
- 2010-10-10 23:27:02下载
- 积分：1
-
antenna
antenna, dipole.. simulations about that.. enter the information required and it resolves
- 2009-10-31 11:46:52下载
- 积分：1
-
MATLABHuffman3
说明：
- 2006-06-08 12:26:45下载
- 积分：1
-
cebk_tsp
用离散数学或图论的术语来说，假设有一个图g=(v,e)，其中v是顶点集，e是边集，设d=(dij)是由顶点i和顶点j之间的距离所组成的距离矩阵，旅行商问题就是求出一条通过所有顶点且每个顶点只通过一次的具有最短距离的回路。
(Discrete Mathematics or use the terminology of graph theory, assume that a graph g = (v, e), where v is the vertex set, e is the edge set, let d = (dij) is a vertex between i and vertex j formed from the distance matrix, a traveling salesman problem is obtained through all the vertices and each vertex only once has the shortest distance through the loop.)
- 2011-05-22 08:12:37下载
- 积分：1
