-
matlab-C4.5
说明： C4.5 决策树算法源码。C4.5决策树是决策树领域的经典算法。以其为内容的书籍引用率已经达到一万次以上(C4.5 decision tree)
- 2009-08-05 16:14:08下载
- 积分：1
-
2500011
IP地址映射表源码，例程程序结合易语言多线程支持库，调用API函数实现枚举IP地址映射表。(Source IP address mapping table , a routine procedure combining easy language support for multithreading library , call the API functions to enumerate IP address mapping table.)
- 2015-06-19 11:12:38下载
- 积分：1
-
beam
波束形成的几种常用准则，SNR，MSE,LCMV准则。信号+干扰+噪声环境。在干扰方向形成零陷。(Several commonly used criteria of beamforming, SNR, MSE, Suppression for LCMV guidelines. Signal+ interference+ noise environments. Formed in the direction of the interference nulling.)
- 2012-04-19 20:54:57下载
- 积分：1
-
mempool
分页式内存管理，主要用于服务端管理内存，申请内存，释放内存。(Paging memory management, mainly used for server management of memory, the application of memory, the release of memory.)
- 2016-01-29 11:33:40下载
- 积分：1
-
A_Stochastic_Network_Calculus_1
随机网络演算的代表性书籍的前一章，对于了解随机网络演算很有意义(Representative random network calculus books, it makes sense to understand the stochastic network calculus)
- 2014-09-24 14:12:13下载
- 积分：1
-
zoj1094
zoj094
Matrix multiplication problem is a typical example of dynamical programming.
Suppose you have to evaluate an expression like A*B*C*D*E where A,B,C,D and E are matrices. Since matrix multiplication is associative, the order in which multiplications are performed is arbitrary. However, the number of elementary multiplications needed strongly depends on the evaluation order you choose.
For example, let A be a 50*10 matrix, B a 10*20 matrix and C a 20*5 matrix.
There are two different strategies to compute A*B*C, namely (A*B)*C and A*(B*C).
The first one takes 15000 elementary multiplications, but the second one only 3500.
Your job is to write a program that determines the number of elementary multiplications needed for a given evaluation strategy.
(Matrix multiplication problem is a typical example of dynamical programming.
Suppose you have to evaluate an expression like A*B*C*D*E where A,B,C,D and E are matrices. Since matrix multiplication is associative, the order in which multiplications are performed is arbitrary. However, the number of elementary multiplications needed strongly depends on the evaluation order you choose.
For example, let A be a 50*10 matrix, B a 10*20 matrix and C a 20*5 matrix.
There are two different strategies to compute A*B*C, namely (A*B)*C and A*(B*C).
The first one takes 15000 elementary multiplications, but the second one only 3500.
Your job is to write a program that determines the number of elementary multiplications needed for a given evaluation strategy.
)
- 2012-06-10 10:38:53下载
- 积分：1
-
车流量预测
说明： 在keras神经网络框架下，训练提前收集的车流量数据，对未来车流量预测。(Under the framework of keras neural network, train the traffic data collected in advance to predict the future traffic.)
- 2020-06-08 20:12:01下载
- 积分：1
-
online access to the VC neighbors, through access to Socket Programming
获得网上邻居的VC实现,通过SOCKET编程获得-online access to the VC neighbors, through access to Socket Programming
- 2022-08-15 13:04:18下载
- 积分：1
-
BPSK
说明： 用matlab实现简单的bpsk系统，熟悉bpsk系统的特性(Implementing BPSK with MATLAB)
- 2019-01-26 16:56:31下载
- 积分：1
-
fakeQQ123
全面模仿QQ，基本具备QQ功能，非常值得学习(Fully mimic QQ, with QQ basic functions that are worth learning)
- 2009-02-09 12:46:41下载
- 积分：1
