登录
首页 » Visual Basic » 150

150

于 2014-05-03 发布 文件大小:4303KB
0 248
下载积分: 1 下载次数: 4

代码说明:

  150个matlab样例 可以帮助快速编程(150 matlab sample)

下载说明:请别用迅雷下载,失败请重下,重下不扣分!

发表评论

0 个回复

  • Matlab-Ga
    基于Matlab遗传算法的最优投资组合选择(Matlab genetic algorithm-based optimal portfolio selection)
    2013-05-10 20:20:55下载
    积分:1
  • Array
    数组类的实现与改进。利用操作符重载,定义类来生成一数组(An array of classes and achieve improvements. Use operator overloading to generate an array of custom class)
    2014-12-09 21:57:56下载
    积分:1
  • denoise_waverec-(2)
    计算损伤结构前后的响应,对已结构的分析具有很好的效果(After calculating the response of the structure damage, the structure analysis of a good effect)
    2013-10-26 09:49:04下载
    积分:1
  • core2_api
    Support API for core#2 of custom system on chip. Release version
    2014-08-06 22:00:26下载
    积分:1
  • bolieda
    说明:  一个模拟雷达杂波的程序代码,对开发雷达模拟方面有借鉴作用。(A simulated radar clutter the code, the development of radar simulation serve as a reference.)
    2011-04-09 21:14:29下载
    积分:1
  • VC中调用MATLAB示代码
    VC中调用MATLAB示例代码(VC Calling MATLAB sample code)
    2005-03-12 09:34:38下载
    积分:1
  • ant
    这是一种ANT的旅行商的MATLAB的代码有用请下载(if it help,please go ahead)
    2014-09-14 18:27:29下载
    积分: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 &lt = L &lt = 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 &lt = M &lt = 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 &lt = L &lt = 10000) and M (1 &lt = M &lt = 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
  • Delaunay
    delaunary三角剖分,在数据点较小的情况下,运行结果还算客观,但是数据点大于五万时,运行较慢。(Delaunary triangulation, data point in the case of small, the operation results is objective, but the data points is greater than fifty thousand, is running slower.)
    2014-12-09 21:44:53下载
    积分:1
  • QpskSim
    无线通信调制C++源代码,包含QPSK调制方式(Wireless communication modulation C++ source code, including QPSK modulation )
    2014-08-07 07:32:26下载
    积分:1
  • 696516资源总数
  • 106914会员总数
  • 0今日下载