登录
首页 » PDF » chapter1

chapter1

于 2014-02-01 发布 文件大小:881KB
0 62
下载积分: 1 下载次数: 1

代码说明:

  Review chapter about robotics

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

发表评论

0 个回复

  • music
    空间谱估计均匀线阵music算法matlab程序(ULA program music algorithm matlab)
    2009-03-08 17:38:06下载
    积分:1
  • xihua
    matlab中细化谱的示例程序,操作简单,可直接复制,便于调用。(Zoom Spectrum in matlab sample program, simple operation, can be directly copied, easy call.)
    2013-07-26 17:24:48下载
    积分:1
  • hanoi
    汉诺塔即时动画演示,程序动画可以给出每一步的移动过程(The hanoi tower)
    2012-03-26 01:20:20下载
    积分:1
  • hw1
    plotting pattern for antenna
    2012-04-28 02:19:48下载
    积分:1
  • MRAC
    自适应控制算法,MRAC,matlab中simulink仿真源代码以及ppt讲解。是自适应控制必不可少的资料(Adaptive control algorithms, MRAC is, Matlab simulink simulation source code, and explain ppt. Information essential for adaptive control)
    2020-09-25 10:37:47下载
    积分:1
  • The-calculation-of-channel-capacity
    在信息论课程中,对信道容量的计算,此文件对它用matlab进行编程,运行后可直接得到结果(In information theory course, for the calculation of channel capacity, this file can be programmed with matlab it can get results directly after running)
    2014-10-21 15:04:42下载
    积分:1
  • Matlab-code
    英文原版书籍《MATLAB Programming With Applications for Engineers》中例子及课后习题代码(Code of the book《MATLAB Programming With Applications for Engineers》)
    2013-12-17 07:25:05下载
    积分:1
  • Image-processing-code
    matlab6.5图形图像处理源程序 是初学matlab的好帮手。。(matlab6.5 graphics image processing source code beginner matlab good helper. .)
    2013-05-17 10:14:32下载
    积分:1
  • 678
    MATLAB的一些实用程序,很有帮助的哦!对于新手来说是很好的参考资料!(MATLAB some utilities, helpful Oh! For the novice is a very good reference!)
    2008-04-19 22:13:06下载
    积分:1
  • GraphTheoryAlgorithmMATLAB
    说明:  图论算法及其MATLAB 程序代码 1.求赋权图G = (V, E , F )中任意两点间的最短路的Warshall-Floyd 算法、Kruskal 避圈法 2.求二部图G 的最大匹配的算法(匈牙利算法)、利用可行点标记求最佳匹配的算法 3.从一个可行流f 开始, 求最大流的Ford--Fulkerson 标号算法 6.(Graph Theory Algorithm and MATLAB program code 1. Seeking weighted graph G = (V, E, F) in the shortest path between any two points of the Warshall-Floyd algorithm, Kruskal avoid the circle method 2. Seeking the maximum bipartite graph G matching algorithm (the Hungarian algorithm), using feasible point mark seeking the best match algorithm 3. a feasible flow f from the beginning, find the maximum flow of the Ford- Fulkerson Labeling Algorithm 6.)
    2010-03-28 15:39:29下载
    积分:1
  • 696522资源总数
  • 104027会员总数
  • 45今日下载