-
dfafasfaleach
leach 源码 c++编写名字怎么要这么长啊 (leach source c++ how to write the name so long ah)
- 2010-05-17 11:10:00下载
- 积分:1
-
New-Folder
program for lms.it is the lms algorithm for bpsk modulated sound wave
- 2011-07-24 00:41:04下载
- 积分:1
-
sim
simulation of bubble dynamic with Rayleigh Plesset equation inertially controlled
- 2021-04-20 00:38:51下载
- 积分:1
-
PPL
关于锁相环路的相关仿真,描绘的是一阶锁相环,二阶及三阶的各个特性。(PLL simulation, depicted is a first-order phase-locked loop, the second-order and third-order characteristics.)
- 2013-03-04 21:24:28下载
- 积分:1
-
Tinnery
Tinnery 算法主要针对节点优化方面的计算和编程(Tinnery optimization algorithm targeted node calculation and programming)
- 2014-10-24 09:58:26下载
- 积分:1
-
MATLAB虚拟信号发生器
说明: 基于Matlab的仿真,虚拟信号发生器,实现各种信号(sin cos ... )的发生(Matlab based simulation, virtual signal generator based on Matlab simulation, virtual signal generator, achieve various signals (sin...The occurrence of))
- 2019-07-10 15:29:19下载
- 积分:1
-
speech_mfcc
Speech melbank,energy sectrum,Computes and returns the mfcc coefficients for a speech signal
- 2009-03-21 06:08:27下载
- 积分:1
-
分支定界法
说明: 分支定界法(branch and bound)是一种求解整数规划问题的最常用算法。这种方法不但可以求解纯整数规划,还可以求解混合整数规划问题。分支定界法是一种搜索与迭代的方法,选择不同的分支变量和子问题进行分支。
对于两个变量的整数规划问题,使用网格的方法有时更为简单。 [1]
通常,把全部可行解空间反复地分割为越来越小的子集,称为分支;并且对每个子集内的解集计算一个目标下界(对于最小值问题),这称为定界。在每次分枝后,凡是界限超出已知可行解集目标值的那些子集不再进一步分枝,这样,许多子集可不予考虑,这称剪枝。这就是分枝定界法的主要思路。(Branch and bound method is one of the most commonly used algorithms to solve integer programming problems. This method can solve not only pure integer programming but also mixed integer programming. Branch and bound algorithm is a method of search and iteration, which selects branches with different branch variables and sub problems.
For integer programming problems with two variables, the grid method is sometimes simpler[ 1]
Generally, all feasible solution spaces are divided into smaller and smaller subsets repeatedly, which is called bifurcation; And a lower bound of the objective (for the minimum value problem) is calculated for the solution set in each subset, which is called the bound. After each branch, those subsets whose bounds exceed the objective value of the known feasible solution set will not be further branched, so many subsets can not be considered, which is called pruning. This is the main idea of branch and bound method.)
- 2021-04-26 12:21:14下载
- 积分:1
-
MATLAB-TUTOTIAL
Matlab的创始人 C. Moler编写,网上鲜见。
诚乃大家之作,为英文版,内附70多个M文件实例解释,对于编码的品质提高很有好处(Matlab' s founder C. Moler preparation, on-line rare. We shall be sincere is for English, included more than 70 instances of M documents to explain, for improving the quality of coding is very good for)
- 2009-12-08 22:56:56下载
- 积分:1
-
SISO-Viterbi
正需要这方面的资料,Viterbi算法在业界很强,和大家一起分享交流(Is in need of this information, Viterbi algorithm in the industry is very strong, and we share exchange)
- 2014-09-18 10:57:05下载
- 积分:1