登录
首页 » matlab » FINALTEST

FINALTEST

于 2011-08-11 发布 文件大小:2KB
0 219
下载积分: 1 下载次数: 39

代码说明:

  参考作物蒸散量计算公式,FAO国际农粮组织推荐的那个方法(ET0 )

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

发表评论

0 个回复

  • AA_rocket
    Simply interpretation of Tsiolkovski equation for students
    2010-11-13 05:45:13下载
    积分:1
  • MATLAB-znglzdyy
    运用matlab与应用系统无缝集成的三种方式,最后,用一个在智能网络管理信息处理中的具体实例详细说明实现的步骤。 (Use of matlab applications seamlessly integrated with the three ways, finally, with an intelligent network management information processing in the detailed description of specific examples of steps to achieve.)
    2009-05-14 22:11:13下载
    积分:1
  • Creating_Graphical_User_Interfaces
    Matlab官方文档:matlab图形界面编程(Matlab official documents : Matlab GUI Programming)
    2006-05-26 11:23:59下载
    积分:1
  • digitalmodulate
    各种调制方式的matlab源码bask.m, bfsk.m, bpsk.m, msk.asv, msk.m, qpsk.m, raymodel.m(various forms of Matlab modulation source bask.m, bfsk.m, bpsk.m. msk.asv, msk.m, qpsk.m, raymodel.m)
    2007-03-20 21:32:49下载
    积分:1
  • Electricity_calculator
    This simulation is done on basis to calculate the electricity cost for required time of usage
    2013-10-29 19:11:22下载
    积分:1
  • scatter_LDS
    Scatter plot for large data set (tested for 10 million points)
    2014-02-06 17:57:49下载
    积分:1
  • PID_CONTROL
    说明:  刘金锟先进PID第二版程序,需要的可以下载。(Liu Kun, the second edition of the advanced PID procedures needed can be downloaded.)
    2008-11-04 21:37:45下载
    积分:1
  • Adaptive-Code-Jammer-Excision-For-MC-SS-Communica
    Adaptive code jammer
    2014-10-15 04:10:33下载
    积分:1
  • Grims
    the grimson method is a computer vision program that take a film and define movement in it.it is use full for process films from public pplaces camera.
    2012-11-20 18:19:40下载
    积分:1
  • GAforPathPlaning
    采用栅格对机器人的工作空间进行划分,再利用优化算法对机器人路径优化,是采用智能算法求最优路径的一个经典问题。目前,采用蚁群算法在栅格地图上进行路径优化取得比较好的效果,而利用遗传算法在栅格地图上进行路径优化在算法显得更加难以实现。 利用遗传算法处理栅格地图的机器人路径规划的难点主要包括:1保证路径不间断,2保证路径不穿过障碍。 用遗传算法解决优化问题时的步骤是固定的,就是种群初始化,选择,交叉,变异,适应度计算这样,那么下面我就说一下遗传算法求栅格地图中机器人路径规划在每个步骤的问题、难点以及解决办法。(It is a classical problem to divide the workspace of the robot by grids and optimize the path of the robot by using optimization algorithm. At present, the ant colony algorithm is used to optimize the path on the grid map, and the genetic algorithm is used to optimize the path on the grid map, which is more difficult to achieve. The difficulties of using genetic algorithm to deal with the path planning of robot on raster map mainly include: 1. guaranteeing that the path is uninterrupted, 2. guaranteeing that the path does not cross obstacles. The steps of genetic algorithm in solving optimization problems are fixed, that is, population initialization, selection, crossover, mutation, fitness calculation. Then I will talk about the problems, difficulties and solutions of genetic algorithm in each step of robot path planning in raster map.)
    2019-05-02 14:56:19下载
    积分:1
  • 696516资源总数
  • 106642会员总数
  • 12今日下载