资源列表
webinar_files
- This a demonstration of how to find a minimum of a non-smooth objective function using the Genetic Algorithm (GA) function in the Genetic Algorithm and Direct Search Toolbox. Traditional derivative-based optimization methods, like those foun
tsp_ga
- SP_GA Traveling Salesman Problem (TSP) Genetic Algorithm (GA) Finds a (near) optimal solution to the TSP by setting up a GA to search for the shortest route (least distance for the salesman to travel to each city exactly once and return to t
NSGA-II
- his function is utilized to produce offsprings from parent chromosomes. The genetic operators corssover and mutation which are carried out with slight modifications from the original design. For more information read the document enclosed. -
mtsp_ga
- MTSP_GA Multiple Traveling Salesmen Problem (M-TSP) Genetic Algorithm (GA) Finds a (near) optimal solution to the M-TSP by setting up a GA to search for the shortest route (least distance needed for the salesmen to travel to each city exactly o
518854-BandLanczosMethod.f90
- lanczos算法 计算矩阵特征值 说明要这么长干嘛，说清楚就好了啊-lanczos algorithm for eigvalue
MATLAB
- 科学计算引论 即 matlab数值分析 （第二版）-numerical value analysis based on matlab
learnmatlab6.5
- 给大家传了一份精通matlab6.5教程 我开始学习的时候就在看这个 希望对大家有帮助-a file about matlab 6.5
fuzzyslidingmode
- 模糊滑模控制 很详细的程序 希望对大家有帮助 大家可以参考一下-the code of RBF sliding mode
JOSEPHUS
- 著名的约瑟夫环问题，采用链表数据结构 已知n个人（以编号1，2，3...n分别表示）围坐在一张圆桌周围。从编号为k的人开始报数，数到m的那个人出列；他的下一个人又从1开始报数，数到m的那个人又出列；依此规律重复下去，直到圆桌周围的人全部出列。 例如：n = 9, k = 1, m = 5 【解答】 出局人的顺序为5, 1, 7, 4, 3, 6, 9, 2, 8。-well-known Josephus Problem,using link list method
adaptiveRBFslidingmode
- 基于RBF网络上界自适应学习的滑模控制 很详细的程序 希望对大家有帮助-the code of RBF sliding mode
RBFslidingmode
- 基于RBF神经网络的等效滑模控制 很详细 大家可以参考程序 把里面的模型改改 希望对大家有帮助-the code of RBF sliding mode
RBF
- RBF源代码 我调试过的 用S函数编写的 在simulink里 一切都弄好的 希望对大家有帮助-the code of RBF