-
LBGalogrithm
这是在 c + + 中的 LBG 算法仿真程序。
LBG 算法被用来估计通信信号的初始阶段。
- 2022-10-15 03:00:04下载
- 积分:1
-
Programa com uso do microprocessador 8051
Programa com uso do microprocessador 8051
- 2022-11-30 07:35:04下载
- 积分:1
-
*对buildequalizer <;输入:
** Aufruf: BuildEqualizer
** Das Werkzeug BuildEqualizer erzeugt aus einem ASCII
** das PGF-FILE EQUALIZER.PGF
**
** Syntax: Tokentrenner ist "
"
** Format :
** Dummy-Tok x0 x1 ... xn
** y0 z00 z01 ... z0n
** y0 z10 z11 ... z1n
** : : : :
** ym zm0 zm1 ... zmn
-** Aufruf: BuildEqualizer
**
** Das Werkzeug BuildEqualizer erzeugt aus einem ASCII
** das PGF-FILE EQUALIZER.PGF
**
** Syntax: Tokentrenner ist "
"
** Format :
** Dummy-Tok x0 x1 ... xn
** y0 z00 z01 ... z0n
** y0 z10 z11 ... z1n
** : : : :
** ym zm0 zm1 ... zmn
- 2022-08-03 10:51:43下载
- 积分:1
-
an Intel Dialogic card version of dial
一个Intel的Dialogic版卡的编程拨号-an Intel Dialogic card version of dial-up programming
- 2022-03-31 00:37:18下载
- 积分:1
-
VC二叉排序树和平衡二叉树计算程序
VC二叉排序树和平衡二叉树计算程序-VC binary sort tree and balanced binary tree program
- 2022-03-18 13:24:16下载
- 积分:1
-
图形识别+颜色识别
在vs2010平台下利用opencv2.4.9识别图片中的多边形,基于SVM分类器识别多边形包括圆形,矩形,菱形,三角形灯基本图像,并将结果保存在图片中,是被结果信息打印包括形状,颜色,中心坐标,面积打印在结果图中。
- 2022-04-30 13:42:06下载
- 积分:1
-
acm.zju.com 中1002的第一个输入的答案 城堡中放堡垒的问题
acm.zju.com 中1002的第一个输入的答案 城堡中放堡垒的问题-acm.zju.com 1002 were the first to import the answer to a castle fortress of release
- 2023-03-28 11:50:03下载
- 积分:1
-
Windows核心编程配套代码 Windows核心编程配套代码.
Windows核心编程配套代码 Windows核心编程配套代码.-core Windows programming code supporting core Windows programming code matching.
- 2022-07-04 15:16:20下载
- 积分:1
-
Multi
遗传算法中多点交叉算法来优化最小值函数所对应的解--编码过程-Multi-point genetic algorithm to optimize the cross-algorithm corresponding to the minimum function of the solution- the process of encoding
- 2022-01-26 00:40:34下载
- 积分:1
-
K r u s k a l算法每次选择n
K r u s k a l算法每次选择n- 1条边,所使用的贪婪准则是:从剩下的
边中选择一条不会产生环路的具有最小耗费的边加入已选择的边的集合中。注意到所选
取的边若产生环路则不可能形成一棵生成树。K r u s k a l算法分e 步,其中e 是网络中
边的数目。按耗费递增的顺序来考虑这e 条边,每次考虑一条边。当考虑某条边时,若将其
加入到已选边的集合中会出现环路,则将其抛弃,否则,将它选入。-K ruskal algorithm for each choice of n-1 edges, the greed of the criteria used are: from the left edge select does not produce a loop with the smallest cost edge has been selected to join the edge of the collection. Taking note of the selected edges have a loop if it can not form a spanning tree. K ruskal algorithm sub-e-step, in which e is the number of network edge. According to the order of incremental cost to consider this e edges, each taking a side. When considering a certain edge when, if its added to a collection of selected edge loop will appear, will be its discarded, otherwise, it selected.
- 2023-02-08 08:10:04下载
- 积分:1