资源列表
Neural-Networks-and-Deep-Learning
- 很好的深度学习与神经网络教程，适合深度学习的初学者-Good depth and neural network learning tutorial for beginners to learn the depth of
Demo-MNist
- 利用神经网络进行手写数字识别演示代码！非常具有代表性！-Using neural network Digital Recognition demo code!
skflow-master
- 「TensorFlow」是 Google 多年以来内部的机器学习系统。如今，Google 正在将此系统成为开源系统，并将此系统的参数公布给业界工程师、学者和拥有大量编程能力的技术人员，这意味着什么呢？- TensorFlow Google is for many years inside the machine learning system. Today, Google is this system becomes open source, and will be published par
SMO_linnerTEST
- SMO算法实现线性分类，别的方法修改核函数即可 亲测有效-SMO algorithm for linear classification, other methods to modify the kernel Effective pro-test
AIA-MATLAB-code
- 人工免疫算法求解约束优化，MATLAB，结合GA，可参考-Artificial immune algorithm for solving constrained optimization, MATLAB, combined with GA, refer to
YOUHUA
- 自编基于遗传算法的函数优化程序,保证百分百可以运行-The self-made function optimization based on genetic algorithm
MatConvNet-mr-master
- 牛津大学开发的matconvnet工具包，可以生成vgg，alexnet等等模型，imagenet，mnist多种数据集可以跑-Oxford University developed matconvnet toolkit can generate vgg, alexnet etc. model, imagenet, mnist multiple data sets can be run
Graph-Coloring(HGA)
- 基于遗传算法和禁忌搜索的启发式算法，提供C++代码，能够高效地解决图着色问题。-The code based on the combination of Genetic Algorithm and Tabu Search can be used to solve the Graph Coloring problem efficiently
SPDP(GRASP_RP)
- 可选择节点的取货送货问题，采用Grasp and Path-relinking的算法，通过类似遗传算法的方法解决问题。-Alternatively nodes pickup and delivery, the use of Grasp and Path-relinking algorithm to solve the problem by a method similar to the genetic algorithm.
MWCP(TS)
- 采用禁忌搜索算法解决最大权值团问题，包含最大独立集于最大权值团之间的转换问题。-Tabu search algorithm using the maximum weight clique problem solving, contains the largest independent set in the maximum weight conversion problems between the groups.
product
- 人工智能产生式系统的通用程序，能够根据规则集文本自动生成事实选项和问题，自动根据用户选择进行推理，可以处理不同的问题。-It is a general program for AI product system, it can auto generate fact item and problem, auto reasoning according to use select, it can deal different problem.
tictactoe
- 人工智能的一字棋游戏，VC++单文档应用程序，使用博弈树的极大极小过程和α-β剪枝算法。-It is a line game, it is a single docment application program, use the max-min and α-β pruning algorithm.