-
temperatureModule
The example included here is a simple temperature conversion module that takes user-supplied temperature values specified in either degrees Fahrenheit or degrees Celsius and converts them to the other scale. The example demonstrates how to use the MATLAB® Builder™ JA API to handle temperatures in various different formats (scalars, matrices, cell arrays, and structs).
- 2009-09-07 17:51:05下载
- 积分：1
-
Dijkstra
说明： 最短路径的Dijkstra算法程序。Dijkstra算法是典型最短路算法，用于计算一个节点到其他所有节点的最短路径。主要特点是以起始点为中心向外层层扩展，直到扩展到终点为止。Dijkstra算法能得出最短路径的最优解，但由于它遍历计算的节点很多，所以效率低。
Dijkstra算法是很有代表性的最短路算法，在很多专业课程中都作为基本内容有详细的介绍，如数据结构，图论，运筹学等等。
(The Dijkstra shortest path algorithm for the procedure. Dijkstra algorithm is a typical shortest path algorithm, used to calculate a node to all other nodes of the shortest path. The main characteristics is the starting point as the center outward expansion layers, until the end date be extended to. Dijkstra shortest path algorithm can arrive at the optimal solution, but because of its calculation of the node traversal, so inefficient. Dijkstra algorithm is very representative of the shortest path algorithm, in many professional courses in the basic content as described in detail, such as data structures, graph theory, operational research and so on.)
- 2008-11-26 22:27:45下载
- 积分：1
-
bayesleastrisk
基于最小风险的贝叶斯分类器，用于数字分类识别(Bayesian minimum risk classification for digital classification)
- 2013-10-25 17:35:13下载
- 积分：1
-
Untitled2
Matlab code that has an exercise about signals processing.
- 2009-06-04 06:20:27下载
- 积分：1
-
watershed
分水岭测试算法，供参考，里面还有一些其他代码，共学习(Watershed test algorithm, for reference)
- 2011-01-17 13:48:22下载
- 积分：1
-
OFDM-NEW-18
802.11a phy layer protocol by myself
- 2006-03-15 21:27:13下载
- 积分：1
-
aco
说明： 利用蚁群算法求解tsp（旅行商）问题，给出遍历方案，最后求出最短路径。(Ant colony algorithm for tsp (TSP) problem, given traversal solutions, and finally find the shortest path.)
- 2011-04-08 10:13:50下载
- 积分：1
-
gauss-seidel
The Gauss-Seidel technique is intuitive and easy to use on large or small problems. However,
you should beware that the convergence tolerance must be carefully selected. Because the
convergence criterion is based on the error between iterations, the same convergence criteria may
lead to very different results. The direct solution technique presented in Section 2.6.2 is
generally preferred over an iterative technique like Gauss-Seidel iteration if a tool such as
MATLAB that provides a computationally efficient means of solving sparse matrices is
available.
- 2012-05-10 21:31:35下载
- 积分：1
-
MPI-CUDA-LSQR
An MPI-CUDA Implementation and Optimization for Parallel Sparse Equations and Least Squares (LSQR)
- 2014-09-10 14:57:21下载
- 积分：1
-
Vol4(1)_2
this document is paper
- 2010-01-01 06:10:45下载
- 积分：1
