-
4G LTE 物理层相关协议 TS36.201――810
4G LTE 物理层相关协议 TS36.201――810-4G LTE physical layer related agreements TS36.201--810
- 2022-02-07 02:23:00下载
- 积分:1
-
一个用VC++实现基因算法的例子。基因算法是一种生物进化的算法,实际上是一种多目标的探索法....
一个用VC++实现基因算法的例子。基因算法是一种生物进化的算法,实际上是一种多目标的探索法.-One with VC realization of genetic algorithm example. Genetic algorithm is a kind of biological evolution algorithm, in fact, is a multi-objective exploration method.
- 2022-05-06 00:44:45下载
- 积分:1
-
Delphi中搜索
&模块:Delphi中的ADSI搜索
- 2022-06-18 14:26:18下载
- 积分:1
-
file are used for project development
file are used for project development
- 2022-08-03 12:05:19下载
- 积分:1
-
用MATLAB仿真实现卡尔曼滤波器,仿真效果非常好。
用MATLAB仿真实现卡尔曼滤波器,仿真效果非常好。-MATLAB simulation Kalman filter, the simulation results is very good.
- 2022-01-30 20:52:25下载
- 积分:1
-
这VB6代码时钟。
This the VB6 code for Clock.-This is the VB6 code for Clock.
- 2022-09-16 14:10:03下载
- 积分:1
-
请认真阅读您的文件包然后写出其具体功能(至少要20个字)。尽量不要让站长把时间都花费在为您修正说明上。压缩包解压时不能有密码...
请认真阅读您的文件包然后写出其具体功能(至少要20个字)。尽量不要让站长把时间都花费在为您修正说明上。压缩包解压时不能有密码-Please read them carefully before you write the document package to their specific functions (at least 20 words). Try not to let the station master at the time you spend on the amendment note. Package should not have a password when extracting
- 2022-01-26 00:17:09下载
- 积分:1
-
该函数实现了对二进制数字信号的QAM16调制与解调。下载后可以直接调用。...
该函数实现了对二进制数字信号的QAM16调制与解调。下载后可以直接调用。-Realize the function of the binary digital signal modulation and demodulation QAM16. After downloading can be directly called.
- 2022-03-09 23:26:40下载
- 积分:1
-
MD5是最常用的不可逆加密算法,广泛用于密码加密等不可逆的加密处理。本源码在c++ 6.0环境下编译通过。...
MD5是最常用的不可逆加密算法,广泛用于密码加密等不可逆的加密处理。本源码在c++ 6.0环境下编译通过。-MD5 is the most common non-reversible encryption algorithm, widely used in non-reversible password encryption is encrypted. The source code in c++ 6.0 environment, compiled by.
- 2023-04-08 21:20:04下载
- 积分:1
-
电路布线问题要确定将哪些连线安排在第一层上,使得该层上有尽可能多的连线。换句话说,该问题要求确定导线集Nets={(i,π(i)),1≤i≤n}的最大不相交子集...
电路布线问题要确定将哪些连线安排在第一层上,使得该层上有尽可能多的连线。换句话说,该问题要求确定导线集Nets={(i,π(i)),1≤i≤n}的最大不相交子集。-circuit wiring problem will be to determine which connections in the first layer, making this layer as much as possible on the log. In other words, the problem defined Traverse Set Nets = ((i, (i)), 1 i n) is not the largest subset of the intersection.
- 2022-01-25 16:10:18下载
- 积分:1