搜索资源列表
TravelingSalesman
- TSP solution by GA in java
springside4-4.1.0.GA
- SpringSide is a Spring Framework based JavaEE application reference architecture. It shows the mainstream technologies and pragmatic practice in JavaEE world. It has 2 major examples: 1. Quickstart -- a minimal CRUD Todo-List w
GA
- 基于遗传算法的旅行商问题，求最小路径，java图形界面实现-Traveling salesman problem based on genetic algorithms for the minimum path, java graphical interface to achieve
TSP
- 一种基于遗传算法求解TSP的新思路，内有详细注释。-new method of TSP based GA
BluetoothLeGatt
- android bluetooth 4.0 GA-android bluetooth 4.0 GATT
TSP
- 用遗传算法解决TSP问题，采用Java实现-the GA code for the tsp problem which is implemented by java
GA
- 在java平台，应用遗传算法拟合浑水入渗经验公式，经验证可用-In the java platform, application of genetic algorithm to fit empirical formula for muddy water infiltration, proven available
GA_tsp
- Java实现遗传算法的tsp问题。函数说明详细，步骤清晰。-sove the TSP problem in GA with JAVA computer language. the function is clear
GA
- tugas genetik algoritma
ghsc267126130000271
- one-and-only: Send Google Analytics (ga) events and push dataLayer on event scroll, one time and only.
GA
- Genetic algorithm code in java
GA
- genetic algorithm implementation
GA-TSP
- Post codes, Tsp to help solve the problem of genetic algorithms in MATLAB software code
GA-nQueen
- Post codes, solve n queen with the help of genetic algorithms using MATLAB software.
分页
- 分页。这是分页的代码，java语言写的，希望大家喜欢，嘎嘎嘎(This is the code for paging, written in the Java language, and I hope you like it, ga ga)
87361050JAVA-EE
- ＪＡＶＡＥＥ大作业 项目运行须 导入 hibernate-distribution-3.6.0.Final 及 jboss文件中 client下 的jar包 ,项目中有很多bug不会调试，待进一步完善 运行环境 : 旗舰版 myeclipse10 jboss-5.1.0.GA jdk1.7.0_21 MySQL Server 5.5(The operation of the project must be imported into the jar package under
hibernate-distribution-3.3.2.GA-dist
- hibernate参考文档()
OwnTest
- 通过Java编码实现标准遗传算法（SGA）解决背包问题(Through Java coding, the standard genetic algorithm (SGA) is implemented to solve knapsack problem)
GA
- 遗传算法，注释比较详细，可以直接修改使用(Genetic algorithm implemented in java)
GA
- 使用java实现遗传算法，求出max{f(x1,x2)=21.5+x1*sin(4*π*x1)+x2*sin(20*π*x2)}的最优解 约束条件为 -3.0<=x1<=12.1 4.1<=x2<=5.8(The use of Java genetic algorithm, calculate the max{f (x1, x2) =21.5+x1*sin (4* PI *x1 +x2*sin (*x2) 20* PI)} of the optimal solutio