greedy

Simulated annealing (SA) is a generic probabilistic metaheuristic for the global optimization problem of applied mathematics, namely locating a good approximation to the global optimum of a given function in a large search space. It is often used when the search space is discrete (e.g., all tours that visit a given set of cities). For certain problems, simulated annealing may be more effective than exhaustive enumeration — provided that the goal is merely to find an acceptably good solution in a fixed amount of time, rather than the best possible solution.

matlab颜色模型转换的代码程序，数字图像处理的matlab程序代码(matlab code color model conversion program, digital image processing matlab code)

the most important 101 Unix commands

本科毕设要求参见标准测试模型，非归零型差分相位调制信号建模与仿真分析 ，用谱方法计算流体力学一些流动现象的整体稳定性。( Undergraduate complete set requirements refer to the standard test models, NRZ type differential phase modulation signal modeling and simulation analysis, Spectral methods of computational fluid dynamics flow of some of the overall stability of the pheno)

ieee spectrum 2013 september

分类和拟合，支持向量新算法。最小二乘，但只能用于二维数据(Classification and fitting a new support vector algorithm. Least squares, but only for two-dimensional data)

说明：  Hurst exponent calculation algoritms. Time series analysis trending, mean reverting. Analysis of time series, fractal analysis.

MATLAB神经网络30个案例分析—案例28 灰色神经网络的预测算法—订单需求预测源代码及数据(MATLAB Neural Network 30 Case Studies- Case of 28 gray neural network prediction algorithm- order demand forecast source code and data)

基于BP神经网络的图形图像压缩算法 可以运行(BP neural network can run a graphical image compression algorithm based on)

说明：  介绍如何在自己的应用程序中实现毫秒级的控制。(control in million second。 )