资源列表
tournament
- a tournoment code for genetic algorithm
best50
- a genetic algorithm code
zuiduanluwenti
- 该文档为建模案例—最优截断切割问题的代码级说明文档，请相关技术人员下载参考。-The modeling case- the document code-level documentation truncated optimal cutting issues relevant technical staff download the reference.
matching
- 此文档内容为拟合，包含21个程序代码和2个ppt课件，请下载参考。-This document content to fit the 21 code and 2 ppt courseware, please download the reference.
024-zuizhongban
- 完成矩阵的满秩分解，将矩阵转化为两个满秩矩阵的乘积-Completed matrix of full rank decomposition, the product of the matrix into two full-rank matrix
011
- 矩阵求逆，先求行列式的值再求逆矩阵，挺好用-Matrix inversion, first seeking the value of the determinant of the inverse matrix, very easy to use
henon
- 用fortran编写 的henon 映射的 Poincare- Poincare of henon mapping
shiweidele
- 施威德勒球壳在ansys中的建模分析，APDL语言-Of Schwedler shell modeling in ansys, APDL language
zhumianwangqiao
- 柱面网壳结构建模及受力分析，ansys程序APDL语言-Modeling and stress analysis of cylindrical reticulated shell, ansys program APDL language
Wolf_quasiNewton
- 最优化算法中的带有Wolf搜索求步长的拟牛顿算法求最优值的源码，matlab编程实现，希望对大家有用。-Optimization algorithm with Wolf to the search requirements step quasi-Newton algorithms to find the optimal value of the source code, Matlab programming, and hope to be useful.
maximum-matching
- 离散数学，求解图论里的最大匹配，包含两种方法，最大支持100个节点-Discrete mathematics for solving the maximum matching in graph theory, contains two methods, maximum support 100 nodes
AI
- 2个人工智能程序，可视化界面：A*算法解决货郞担问题（支持13个城市）。还有动物识别专家系统-Two artificial intelligence program, visual interface: A* algorithm to solve the problem of cargo Lang Tam (supports 13 cities). There are animal identification expert system