资源列表
TEC_CLPSO-Sept-05
- TEC_test.m and TEC_test_rot.m are the main functions. TEC_test.m is for the unrotated problem and TEC_test_rot.m is for the rotated ones. TEC_test_function.m includes the benchmark functions, and the data files are the corrsponding data for
SIS2005-function-codes
- TEC_test.m and TEC_test_rot.m are the main functions. TEC_test.m is for the unrotated problem and TEC_test_rot.m is for the rotated ones. TEC_test_function.m includes the benchmark functions, and the data files are the corrsponding data for
DMS-PSOPHS--Exp-S-W-Applns
- TEC_test.m and TEC_test_rot.m are the main functions. TEC_test.m is for the unrotated problem and TEC_test_rot.m is for the rotated ones. TEC_test_function.m includes the benchmark functions, and the data files are the corrsponding data for
DMS_PSO_func
- TEC_test.m and TEC_test_rot.m are the main functions. TEC_test.m is for the unrotated problem and TEC_test_rot.m is for the rotated ones. TEC_test_function.m includes the benchmark functions, and the data files are the corrsponding data for
2LB-MOPSOsourcecodes
- TEC_test.m and TEC_test_rot.m are the main functions. TEC_test.m is for the unrotated problem and TEC_test_rot.m is for the rotated ones. TEC_test_function.m includes the benchmark functions, and the data files are the corrsponding data for
queens
- 女皇排序问题的简单实现-simple achievement of Eight Queens Problem using Python
ica
- fastica算法，去除眼电，实现对脑电的去噪处理-fastica algorithm to remove the EOG
hunynpipei
- 婚姻匹配算法研究，提供C++代码，主要实现代码，利用矩阵来分析-Marriage matching algorithm, provides C++ code, the main code, the use of matrix analysis
lxl
- 非常好的自顶向下，翻译算法，采用C++实现-Very good top-down, translation algorithm, using C++ implementation
java-src
- 应用java开发的程序集合，包含一般的数据结构，常用的算法及小的application等-sub String
single-list-method
- 此实验利用前插法创建一个单链表，利用单链表的功能动态地开辟空间存储数据，以及删除数据释放空间。首先建立带表头结点的单链表，并输入数据。接着输出单链表中所有结点的数据域值。然后输入x,y在第一个数据域值为x的结点之后插入结点y，若无结点x，则在表尾插入结点y。最后输入k，删除单链表中所有的结点k，并输出被删除结点的个数。-The experimental use of forward runs to create a single list method, using a single linke
josepharray
- 约瑟夫问题，用链式结构实现，有N个数，从S开始报数M，列出前后出序序列-Joseph problems with the chain structure to achieve, there are N number, starting from the S reported that the number M, before and after the order listed in the sequence