资源列表
sat4j-core-v20130525
- sat4j的核心包,在eclipse之下可以用于解决SAT问题。-sat4j core packages, under the eclipse can be used to solve SAT problem.
sat4j-csp-v20130419
- sat4j的CSP求解库，可用于解决CSP问题，做为java的一个类库支持-sat4j of CSP solving library that can be used to solve CSP problems as a java class library support
sat4j-maxsat-v20130525
- sat4j的maxtsat求解库，可用于解决MAXsat问题，在eclipse下可以直接设置-The maxtsat sat4j solving library that can be used to solve MAXsat problems can be directly set in eclipse
anneal-algorithm
- 退火算法解非线性方程组，包涵算法讲解和详细的算法代码，子函数，内容齐全-Annealing algorithm for solving nonlinear equations, includes explanations and detailed algorithm algorithm code, Functions, as complete
BPyucexiugai
- 基于BP神经网络的通用算法，针对不同对象可以改下。-Based on BP neural network algorithm universal for different objects can be changed under.
MOSHISHIBIE
- 针对模式识别课程，大家可以参考，也可作为大家利用。-For pattern recognition programs, we can refer to, but also as we take advantage of.
SS
- SCAATER SEARCHING a line search based algorithm for solving high-dimensional continuous non-linear optimization problems
ISODATA
- 编写ISODATA聚类算法程序，对如下数据进行聚类分析-Write ISODATA clustering algorithm for the following cluster analysis of data
GCP
- 着色问题，是最著名的NP-完全问题之一。 给定一个无向图G＝（V, E），其中V为顶点集合，E为边集合，图着色问题即为将V分为K个颜色组，每个组形成一个独立集，即其中没有相邻的顶点。其优化版本是希望获得最小的K值。-Coloring problem, is the most famous NP-complete problems. Given an undirected graph G = (V, E), where V is the set of vertices, E is the se
GAshiliSource
- 遗传算法实例编程求解具体问题，多变量数值求解、最优化-ga-source Numerical Optimization
class_toolbox
- maltab分类工具箱，整合了各种经典算法，在这些算法的帮助下有助于设计分类方法实验。-The classification toolbox is a list of functions for supervised and unsupervised classification algorithms. These algorithms help design categorization methods for experimental as well as synthetic dat
elm
- 黄广斌等人提出的极限学习机理论，使用 Matlab 实现，可用于回归和分类问题!-Huangguang Bin, who proposed the theory of extreme learning machine, using Matlab to achieve, can be used for regression and classification problems!