搜索资源列表
XCSR_DE1.0
- - XCS for Dynamic Environments + Continuous versions of XCS + Test problem: real multiplexer + Experiments: XCS is explored in dynamic environments with different magnitudes of change to the underlying concepts. +Reference papers: H.H.
Regional_Warmup_02_HDU
- ACM比赛HDU热身赛比赛详细报告。包括题目，解题报告，源代码。测试数据，输入输出数据。-ACM race warm-up match HDU detailed report. Including the subject, problem-solving report, the source code. Test data, input and output data.
mir3-server-test-and-fix
- 传奇3 传奇3G 可用的服务端测试和修复工具，对于新建的服务器提供详细的问题报告以及简单的修复功能，使初学的爱好者可以迅速找到问题根源并修复。-Legend 3 Legend of 3G services available to end testing and repair tool for the new server to provide detailed problem reports and simple repair, so that beginners 爱好者 source of
AP_For_VRPTW100
- 车辆路径问题的C代码，里面有测试数据和结果分析。-Vehicle routing problem with the C code, there are test data and results analysis.
test-data-for-01-knapscap-problem
- 这个是用于01背包问题的测试数据，很多论文都用这其中的数据集来测试-This is a knapsack problem for the 01 test data, a lot of papers with which the data set to test
power-system-problem-based-on-PSO
- 利用粒子位置和速度的改变更新，在熟悉多目标粒子群算法的基础上利用测试函数对该算法进行仿真，并对仿真结果进行优化。-The particle position and velocity changes update in the familiar multi-objective particle swarm optimization based on the use of test functions to simulate the algorithm, and the optimization
test
- 883分酒问题程序，可以求出所有解，并最后给出最简解-883 sub-process liquor problem, you can find all the solutions, and finally gives the simplest solution
Knapsack
- 用遗传算法解决01背包问题，内附测试数据。-Using genetic algorithms to solve knapsack problem 01, enclosing the test data.
1
- 设计一个描述点的类，其中包含一对坐标点数据成员、一个求两个点之间距离的友元函数和显示坐标点的成员函数，并编程测试。 解题思路： 计算两点(a,b)和(c,d)之间的距离，依据勾股定理可得公式： 并定义坐标点类的友元函数来计算两点间的距离。 -Design a descr iptive point of the class, which includes a pair of coordinates of points, data members, one for the d
GPRS_S3C2410
- ReaLARM的S3C2410开发板光盘中的例程，用于测试板子上的GPRS模块Sim300的裸机程序，已经测试过没有问题-ReaLARM the S3C2410 development board CD-ROM in the routines for testing GPRS module board on the bare-metal Sim300 procedures have been tested there is no problem
test
- 毕设时做的CAN总线通讯电路板原理图，已经经过实验验证了，配合刚才的源码，应该没问题的-Complete set when the CAN bus communication circuit board schematics, has been tested with just the source, it should be no problem
Astar_TSP
- 用A星算法解决旅行商（货郎担）问题，附设计报告和测试用例-A Star algorithm used to solve TSP (traveling salesman) problems, with the design of reports and test cases
heatdistribution-mpi
- 一个MPI程序，用来解决热分布问题。 热分布是一个经典的并行计算问题。 源代码还附上了测试结果和说明文档。-An MPI procedure, the distribution of hot problem to solve. Heat distribution is a classical problem of parallel computing. Source code is also attached to the test results and documentation.
GA
- 一个简单遗传算法，用一个测试问题测试,到到得结果比较好-This is a simple genetic algorithm and the algorithm is tested by a test problem, and the result is not bad
test
- test problem in USACO Gateway
lunwen
- 正态总体均值的 F检验法 ： 研究了正态分布总体均值的双边假设检验问题， 得到了一个新的检验方法 一一F检验法。-Normal Population Mean F test: study of the normal population mean of the bilateral hypothesis test problem, get a new test method of 11 F test.
Rosenbrock
- The Rosenbrock function is a non-convex function used as a performance test problem for optimization algorithms introduced by Rosenbrock (1960). It is also known as Rosenbrock s valley or Rosenbrock s banana function. The global minimum is insid
prime-test
- 素数测试问题（Monte Carlo算法） 求am(mod n)的算法(m≤n) 设m的二进制表示为bkbk-1…b1b0（bk=1,且k≈log2m）。 例：m=41=101001(2)，bkbk-1…b1b0=101001，（k=5）。 求am可以用下述方法：初始C←1。 -Prime number test problem ( Monte Carlo algorithm) Seek am ( MOD n ) algorithm ( M = n) A
test
- Ant colony algorithm is an intelligent algorithm very hot current research, the special program of ant colony algorithm for solving the TSP problem, the program completed by the GreenSim team in early 2006, first published in the research forum, we t
test_problem
- 该测试函数适合大规模无约束算法，在调用主程序以及计算最优值起到了非常重要的作用(The test function for large-scale unconstrained algorithm, called in the main program and calculate the optimal value plays a very important role)