-
Matlab
说明： Matlab命令大全 详细介绍了Matlab的各种命令 用法。 包括数值计算，数值分析，绘图以及计算可视化。(failed to translate)
- 2009-08-26 11:42:57下载
- 积分：1
-
points2contour
封闭二维图形的最小自由相邻链接
Connect Randomly Ordered 2D Points into a Minimal Nearest-Neighbor Closed Contour(Connect Randomly Ordered 2D Points into a Minimal Nearest-Neighbor Closed Contour)
- 2012-04-27 13:38:21下载
- 积分：1
-
Persistencia
SISTEMA DE Persistencia
- 2013-11-20 21:48:29下载
- 积分：1
-
viterbi
matlab的维特比译码程序，加入汉明距离的提取(matlab Viterbi decoding process, from extraction Jiaruhanming)
- 2011-01-23 12:47:15下载
- 积分：1
-
Fermat
calcola enigma di fermat
- 2012-08-14 05:52:22下载
- 积分：1
-
ATK-Framworker
Achievo ATK 是一个以提升开发速度为其核心目标的业务框架。该框架的所有部分都以减少应用程序代码为目标。它没有提供大量工具类以实现广泛的功能，而是提供了一个通用 框架来减少代码。所有新增特性都经过慎重考虑 — 只有它们在某些地方能够降低开发时间才添加。
Achievo ATK 新特性的添加在某种程度上来说是一种演进式开发。没有专门负责开发新特性的团队；而是基于使用该框架的应用程序的要求来对其进行扩展。
(Achievo ATK is an upgrade to speed the development of the core objectives of the operational framework. The framework All parts are to reduce application code as a target. It did not provide a large number of tools to achieve the broad category of the function, but to provide a general framework to reduce code. All these new properties are the result of careful consideration- they are only in certain areas to reduce the development time to add. Achievo ATK new properties added to a certain extent, this is an evolutionary development. Not specifically responsible for the development of new properties team; It is based on the use of the framework of the application's requirements for its expansion.)
- 2007-01-12 15:41:02下载
- 积分：1
-
gongetidu
本程序是基于Matlab的共轭梯度法数值计算。(This procedure is based on Matlab numerical Conjugate Gradient Method.)
- 2015-03-09 09:38:58下载
- 积分：1
-
New WinRAR archive
optimal configuration of CHP and CCHP systems based on particle swarm optimization algorithm
- 2021-03-20 17:29:19下载
- 积分：1
-
proj10-01
在试验中编写程序实现了K均值聚类算法,K均值聚类的原理是：在训练样本中找到C个聚类中心，每个聚类中心代表一个类的中心。然后将样本归类到与其最近的聚类中心的那一类。 C的选择是通过先验知识或经验选取的。聚类中心是通过算法迭代求得的。(In the test preparation process to achieve a K means clustering algorithm, K means clustering principle is: in the training samples to find C a cluster center, each cluster center represents a kind of center. Then the samples are classified to the nearest cluster center with the type. C' s choice is a priori knowledge or experience through the selected. Cluster center is obtained through the iterative algorithm.)
- 2010-08-28 19:42:53下载
- 积分：1
-
hiddenMarkovmodel
A function to genetare a secuence of states based on the hidden marckov models
- 2014-02-04 20:42:33下载
- 积分：1
