登录
首页 » matlab » clock

clock

于 2010-05-13 发布 文件大小:1374KB
0 272
下载积分: 1 下载次数: 2

代码说明:

  matlab语言开发的钟表程序,能够实时显示时间日期等信息(watch matlab language development program, able to display information such as time and date)

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

发表评论

0 个回复

  • CMAcode
    matlab的 cma 算法 代码 个人作品 绝对能执行(The cma algorithm matlab code for the implementation of individual works can certainly)
    2010-05-16 21:20:06下载
    积分:1
  • ZUOBIAOZHUANHUAN
    主要使用MATLAB语言编写的高斯三度与六度带之间的转换(The main use of conversion MATLAB language Gauss three and six degrees between the bands )
    2014-09-22 16:24:00下载
    积分:1
  • SimDriveline-PModelPHierarchy
    有关基于模型控制设计的方针程序,一般对于机器人以及大型装置都可以使用(programme based on Model control design)
    2011-10-08 17:37:50下载
    积分:1
  • MODLEACH
    MODLEACH is a protocol developed for wireless sensor networks and is a routing protocol
    2013-12-17 18:49:42下载
    积分:1
  • Simulation
    首先给出一个F16模型,在此基础上设计了高度保持,协调转弯等控制率,给出了一个飞行剖面的模块,几乎涵盖了飞控的全部内容(Firstly, a F16 model, based on this design to maintain a high degree of coordination, etc. turn the control rate, gives a flight profile modules, covering almost the entire contents of the flight control)
    2020-07-03 14:20:01下载
    积分:1
  • 4.SVM分类算法
    说明:  svm算法 matlab基础教程,适合新手学习入门........(Matlab based tutorial, suitable for novice learning introductory...)
    2021-02-12 22:20:33下载
    积分:1
  • dijksira
    dijksira算法求最短路的MATLAB代码(MATLAB code dijksira algorithm for the shortest of)
    2015-01-14 16:06:20下载
    积分:1
  • DOA1
    classic direction of arrival and beam forming method matlab implementation
    2010-02-18 16:44:19下载
    积分:1
  • tspmatlab
    说明:  求解tsp问题的遗传算法。可以直接求解TSP只要带入数据,修改特定的参数即可(Solving the problem of genetic algorithm tsp)
    2009-08-09 10:15:11下载
    积分:1
  • TSP
    利用遗传算法求解旅行商问题 旅行商问题,即TSP问题(Travelling Salesman Problem)是数学领域中著名问题之一。假设有一个旅行商人要拜访n个城市,他必须选择所要走的路径,路经的限制是每个城市只能拜访一次,而且最后要回到原来出发的城市。路径的选择目标是要求得的路径路程为所有路径之中的最小值。 (Traveling salesman problem using genetic algorithm traveling salesman problem, namely, the problem TSP (Travelling Salesman Problem) is one of the famous field of mathematics. Suppose a business trip to visit n cities, he must choose the path to go, pass through the restriction is to visit each city only once, and finally go back to the original departure city. Path selection objective is to get the path distance to the minimum value among all paths.)
    2010-05-20 23:00:22下载
    积分:1
  • 696516资源总数
  • 106914会员总数
  • 0今日下载