登录
首页 » Others » computernetworks

computernetworks

于 2010-11-16 发布 文件大小:7858KB
0 322
下载积分: 1 下载次数: 3

代码说明:

  Basic computer concept.

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

发表评论

0 个回复

  • MatlabVC
    一种将Matlab编译成可执行程序的一种方法,它使得Matlab编写的程序能够完全脱离Matlab这个环境来执行,从而大大提高了程序的应用范围和使用价值(Of a Matlab compiled into an executable program will be a method which allows Matlab programs written in Matlab can be completely detached from the environment to perform, thus greatly improving the program' s scope of application and value)
    2009-09-23 23:17:46下载
    积分:1
  • aixibaoxingtaixue
    细胞形态学检测,matlab实现,效果不错(Detection of cell morphology, matlab achieved good results)
    2007-11-22 16:25:05下载
    积分:1
  • MATLAB-GUI
    MATLAB中GUI的学习例子及其编程思想,两个小例子:1.风车设计2.计算器设计(Learning MATLAB examples in the GUI and their programming ideas, two small examples: 1. Windmill design 2. Calculator design)
    2010-11-22 13:56:39下载
    积分:1
  • kalman
    详细的kalman滤波程序,对于初学者很有用(kalman filter)
    2009-03-05 21:16:39下载
    积分:1
  • Cymbal_V.P._Teorija_informacii_i_kodirovanie
    Book theory of informatoin. It will be important for you.
    2015-04-19 22:10:22下载
    积分:1
  • Retutrue
    Returns true when code is executing in GNU Octave
    2010-10-11 06:50:13下载
    积分:1
  • A-gateway-assisted-progressive-clustering-routing-
    计能量有效的协议,以适应传感器网络的特点.成簇算法是传感器网络中减少能量消耗的一种关键技术(A-gateway-assisted-progressive-clustering-routing-algorithm)
    2009-05-22 22:16:51下载
    积分:1
  • Kalman
    说明:   对系统单变量进行卡尔曼滤波(Single variable on the Kalman filter system)
    2011-04-16 16:12:07下载
    积分:1
  • dijikstra
    For a given source vertex (node) in the graph, the algorithm finds the path with lowest cost (i.e. the shortest path) between that vertex and every other vertex. It can also be used for finding costs of shortest paths from a single vertex to a single destination vertex by stopping the algorithm once the shortest path to the destination vertex has been determined. For example, if the vertices of the graph represent cities and edge path costs represent driving distances between pairs of cities connected by a direct road, Dijkstra s algorithm can be used to find the shortest route between one city and all other cities. As a result, the shortest path first is widely used in network routing protocols, most notably IS-IS and OSPF (Open Shortest Path First).
    2012-04-12 21:01:48下载
    积分:1
  • ucgen_function
    Fmincon example you can find functions min. value with this example
    2012-04-16 01:57:15下载
    积分:1
  • 696516资源总数
  • 106914会员总数
  • 0今日下载