网站首页

MATLAB_to_C_Code-Samples

于 2010-06-17 发布文件大小:2KB

 0  154

下载积分: 1 下载次数: 3

我要下载

代码说明：

Six matlab example codes for demonstration of matlab to c code conversion

文件列表：

MATLAB_to_C_Code-Samples
........................\euclidean.m,381,2009-08-13
........................\euclidean_optimized.m,369,2009-08-13
........................\euclidean_varsize.m,384,2009-11-02
........................\nullcopy_example.m,122,2009-08-18
........................\plot_distances.m,203,2009-08-13
........................\varsize_reuse.m,129,2009-08-13

下载说明：请别用迅雷下载，失败请重下，重下不扣分！

发表评论

0 个回复

Desktop
simulink自适应程序s函数和模型，可以用到噪声控制等方向(simulink adaptive program s functions and models, and so can be used to control the direction of the noise)

2014-12-14 16:13:00下载

积分：1
csmusic23
对阵列信号进行维数的压缩，并用music算法估计出原始信号的DOA。(Array signal compression dimension, and estimate the DOA music algorithm with the original signal.)

2014-12-15 10:00:03下载

积分：1
nlfmbk
非线性调频信号的产生，画出了群延迟与调频曲线图，并做了脉冲压缩处理，比较了加窗处理与不加窗处理的区别(Nlfm signal generation, draw the group delay and frequency curve, and the pulse compression processing, compared with windows and window processing difference )

2020-07-02 23:20:01下载

积分：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
imgsteg
IMAGE STEGNOGRAPHY LKE THIS CHEC IT ADVANTAGE USING ATLAB.VERY USEFULL

2013-11-28 22:20:22下载

积分：1
stochastic-competition-model
stochastic competition model

2012-05-02 19:11:24下载

积分：1
siso-ofdm-pilot-based-channel-estimation
matlab code for siso-ofdm matlab code using pilot symbols

2015-01-02 13:50:39下载

积分：1
ACS3-1
说明：最优路径问题，蚁群算法,仓储系统的货位拣选路径优化仿真(Optimal path problem, ant colony algorithm, optimization simulation of cargo location picking path for warehouse system)

2019-03-26 13:29:22下载

积分：1
xiyiji
智能洗衣机的模糊控制法则及隶属函数，可载入模块中进行使用(Fuzzy control rules and membership functions of the smart washing machines, you can load the module using the)

2012-08-10 12:39:52下载

积分：1
TorontoDeepLearning-convnet-981771b
深度学习模型代码，包括rbm,grbm,卷积rbm，学习深度模型的好材料(Deep learning model code, including RBM, grbm, RBM convolutional depth model, a good learning materials)

2014-12-01 13:47:14下载

积分：1

696518资源总数
105570会员总数
13今日下载

MATLAB_to_C_Code-Samples

0 个回复

热门标签

热门下载