资源列表
stable-marrige-problem
- 婚姻匹配问题模型，同样可以用到市场匹配问题-a model of marrige matching, can also be used to solve market matching problem
june1503
- 该程序用来实现扩展卡尔曼滤波（EKF),仿真中用扩展卡尔曼滤波实现对雷达目标的跟踪，并估计。-The program used to implement the extended Kalman filter (EKF), simulation with extended Kalman filter to achieve the target tracking radar, and estimates.
opf_slvr
- 用于电力系统运行中潮流的优化问题,确保供电质量安全-this is a alagorith of state slow of power
hw_without
- 神经网络练习,使用DELTA LEARNING RULE对二维的1000个点进行分类,并且计算其准确度-There are four class centered at (3, 3), (3, − 3), (− 3, − 3), (− 3, 3). The data points are 2-dimensional independent Gaussian with the variance of 1.5. Simulate 250 points for
NearestFeatureLineClassifier
- 用于空中目标识别的最近特征线分类器子程序。-Aerial targets for the identification of Nearest Feature Line Classifier subroutine.
BPnn
- 基于随机梯度下降法的两层sigmoid神经元的BP算法-Stochastic gradient descent method based on two layers of sigmoid neurons in the BP algorithm
forcast-sample-by-BP-ANN
- 一个基于bp神经网络的例子演示程序,简单实用。-One sample to show BP ANN algorithm by matlab.
SATSP-MATLAB1
- 再加一个SA的程序说明文件 车辆路径问题-SA with a descr iption of the procedures for document vehicle routing problem
gzqsf
- 连续多输出感知器训练算法的实现，实现BP算法
CLSPSO
- 混沌的粒子群算法，已经封装成了一个函数，可以直接调用-Chaos particle swarm optimization (pso) algorithm, is encapsulated into a function that can be called directly
dijkstra-java
- Dijkstra算法是典型的最短路算法，用于计算一个节点到其他所有节点的最短路径。主要特点是以起始点为中心向外层层扩展，直到扩展到终点为止。 Dijkstra算法能得出最短路径的最优解，但由于它遍历计算的节点很多，所以效率低。Dijkstra算法是一种逐步搜索算法，通过为每个顶点n保留目前为止所找到的从m到n的最短路径来工作的。 -Dijkstra algorithm is a typical example of the most short-circuit algorithm, used
net
- 神经网络 利用matlab编程语言实现神经网络的编程，用于对变形进行监测-netural netwaork