-
VC_MATLAB_DLL
VC调用MATLAB编译的D(VC Calling MATLAB Compiler DLL )
- 2006-11-29 20:05:40下载
- 积分：1
-
demo
lte中turbo编译码的源代码，使用c语言开发，可用(turbo encode and decode)
- 2013-12-30 15:14:43下载
- 积分：1
-
K-shortest-Path-tracking
参考《Multiple Object Tracker Using K-Shortest Paths》实现的代码，使用K最短路径实现多目标追踪功能。(Reference " Multiple Object Tracker Using K-Shortest Paths" to achieve code, use the shortest path K multi-target tracking capabilities.)
- 2014-12-22 09:15:06下载
- 积分：1
-
Canon
用Matlab程序， 播放世界名曲卡农
播放世界名曲卡农播放世界名曲卡农
(Matlab play world music canon)
- 2013-08-13 21:41:04下载
- 积分：1
-
directcountcond
file very impoortant to run spike under matlab code.
- 2010-12-14 14:56:39下载
- 积分：1
-
33
说明： systemvue对通信系统仿真，并进行对数字信号的载波传输仿真实验(systemvue the communications system simulation and digital signal carrier transmission simulation)
- 2013-10-22 10:43:22下载
- 积分：1
-
yasuochuli
实现雷达点目标在距离向和方位向的压缩处理(Radar point target in the distance and direction to the compression to)
- 2021-04-28 09:58:44下载
- 积分：1
-
yiqunsuanfa
蚁群算法最短路径通用Matlab程序.rar
- 2010-08-20 22:02:50下载
- 积分：1
-
TS1
基于禁忌搜索算法的配电网无功补偿优化规划的 禁忌搜索部分(Optimize the planning of reactive power compensation based on the tabu search algorithm with tabu search part)
- 2012-04-20 19:34:36下载
- 积分：1
-
2
说明： 有一个长度为整数L(1<=L<=10000)的马路，可以想象成数轴上长度为L的一个线段，起点是坐标原点，在每个整数坐标点有一棵树，即在0,1,2，...，L共L+1个位置上有L+1棵树。
现在要移走一些树，移走的树的区间用一对数字表示，如 100 200表示移走从100到200之间（包括端点）所有的树。
可能有M(1<=M<=100)个区间，区间之间可能有重叠。现在要求移走所有区间的树之后剩下的树的个数。
输入：
两个整数L(1<=L<=10000)和M(1<=M<=100)。
接下来有M组整数，每组有一对数字。
输出：
可能有多组输入数据，对于每组输入数据，输出一个数，表示移走所有区间的树之后剩下的树的个数。(Has a length of integer L (1 < = L < = 10000) of the road, one can imagine a number line segment of length L, the starting point is the coordinate origin, each integer coordinate points in a tree, i.e. 0,1 , 2, ..., L total has L+1 L+1 positions on the tree. Now to remove some trees, tree removed by a range of digitally represented, such as 100 200 represents removed (inclusive) between 100 and 200 all the trees. There may be M (1 < = M < = 100) intervals, there may be overlap between the intervals. Now, after the number of trees require the removal of all remaining sections of the tree. Input: two integer L (1 < = L < = 10000) and M (1 < = M < = 100). Then there is an integer M groups, each with a pair of numbers. Output: there may be multiple sets of input data, for each set of input data, the output of a number indicating the number of the removal of all remaining sections of the tree after tree.)
- 2015-03-22 23:35:47下载
- 积分：1
