资源列表
GEP
- More AI...(GEP) Gene Expression Programming in C# and .NET 由Michael Gold用C#开发的GEP程序.-AI ... (GEP) Gene Expression Programming in C# and. By Michael Gold NET C# development of the GEP procedures.
gpcpp4
- genetic programming in C++ Adam Fraser University Of Salford, Salford, M5 4WT, United Kingdom-genetic programming in C++ Adam Fraser University Of Salford, Salford, M5 4WT, United Kingdom
simpleCS
- Pascal Programs Printed in GENETIC ALGORITHMS IN SEARCH, OPTIMIZATION, AND MACHINE LEARNING by David E. Goldberg -Pascal Programs Printed in GENETIC ALGORITHMS IN SEARCH, OPTIMIZATION, AND MACHINE LEARNING by David E. Goldberg
scsc-0.99j
- SCS-C is another port to C of Goldberg s Simple Classifier System, with a few extensions.-SCS-C is another port to C of Goldberg s Simple Classifier System, with a few extensions.
Redhat8的安装教程(文本安装方式)(
- Redhat8的安装教程(文本安装方式)(-Redhat8 the installation guide (text installation) (
分支限界算法求解TSP问题
- 本程序用分支界限方法解决ＴＳＰ问题，即旅行商问题．-the procedures used branch line solution to TSP, the traveling salesman problem.
近邻算法求解TSP问题
- 本程序用另外一种算法即近邻算法解决ＴＳＰ，即旅行商问题，请高手指教．-this procedure with the other algorithms that solve the TSP neighbor algorithm, the traveling salesman problem, experts advise.
shiyan6
- 本程序比较各种排序算法的优劣（包括快速比较，基数比较等等），希望大家指教．-the procedures compare the merits Sorting Algorithm (including rapid comparison, the comparison base, etc.), we hope the exhibitions.
切割
- 这是一个分治解决的零件切割问题:给定一块宽度为W的矩形板，矩形板的高度不受限制。现需要从板上分别切割出n个高度为hi，宽度为wi的矩形零件。切割的规则是零件的高度方向与矩形板的高度方向保持一致。问如何切割使得所使用的矩形板的高度h最小？加上一个小界面-This is a solution to the partition cutting parts : a given width of the rectangular plate W, the height of rectangular plat
cw1
- 此程序为训练RBF网权值的量子粒子群优化算法，供各位参考-this program for training RBF net weights Quantum Particle Swarm Optimization Algorithm for reference
C_C++与数据结构
- C、C++语言实现的数据结构重要算法和程序 比较全。-C, C language data structures and algorithms important procedure is all.
图的最小生成树
- 数据结构常用算法：图的最小生成树 经典算法：图的最小生成树-algorithm commonly used data structures : Figure the minimum spanning tree algorithm classic : Figure the minimum spanning tree