Using Genetic Algorithms to Solve NP-Complete Problems
資源簡介:Using Genetic Algorithms to Solve NP-Complete Problems
上傳時間: 2017-05-12
上傳用戶:Miyuki
資源簡介:Using Genetic Algorithm to solve the 8 Queens problem.
上傳時間: 2014-11-28
上傳用戶:yd19890720
資源簡介:This program is using Genetic Algorithm to solve the Travlling Salesman Problem. It gives the best path route within a specified time. usage: java Evolver <seconds> <city file> <config file> Author: Liu Yang
上傳時間: 2013-12-06
上傳用戶:nanfeicui
資源簡介:Using Matlab to solve some engineering Problems
上傳時間: 2017-09-26
上傳用戶:牛津鞋
資源簡介:Using Gaussian elimination to solve linear equations.
上傳時間: 2013-12-18
上傳用戶:shus521
資源簡介:Using Gaussian elimination to solve linear equations. // In this version, we allow matrix of any size. This is done by treating // the name of a 2-dimensional array as pointer to the beginning of the // array. This makes use of the fact ...
上傳時間: 2016-02-14
上傳用戶:hxy200501
資源簡介:using greedy trategy to solve the problem of multiOptimalServe.this code runs in vc 6.0.
上傳時間: 2013-12-05
上傳用戶:腳趾頭
資源簡介:using greedy tratage to solve the problem of Number Delete.
上傳時間: 2014-01-03
上傳用戶:dongqiangqiang
資源簡介:Introduce how to use matlab to solve many variety Problems.
上傳時間: 2014-12-05
上傳用戶:gtf1207
資源簡介:Advanced Human Mood detection technique using Genetic Algorithms in Matlab
上傳時間: 2017-08-08
上傳用戶:王小奇
資源簡介:this is code calculate equation that one variable using Genetic Algorithms
上傳時間: 2013-12-17
上傳用戶:獨孤求源
資源簡介:this code calculate equation that three variables using Genetic Algorithms
上傳時間: 2014-12-06
上傳用戶:zhouchang199
資源簡介:Sudoku as a CSP: Using Algorithms and techniques from CSP to solve an NxN Sudoku puzzle.
上傳時間: 2017-05-07
上傳用戶:tfyt
資源簡介:This title demonstrates how to develop computer programmes which solve specific engineering Problems using the finite element method. It enables students, scientists and engineers to assemble their own computer programmes to produce numeric...
上傳時間: 2014-01-13
上傳用戶:youke111
資源簡介:Complete video store application in C++ using linked lists to store data in files. it keeps track of videos and customers and have many checks and options.
上傳時間: 2014-06-20
上傳用戶:zhoujunzhen
資源簡介:MIT Press - An Introduction to Genetic Algorithms.pdf
上傳時間: 2015-03-18
上傳用戶:love1314
資源簡介:fastDNAml is an attempt to solve the same problem as DNAML, but to do so faster and using less memory, so that larger trees and/or more bootstrap replicates become tractable. Much of fastDNAml is merely a recoding of the PHYLIP 3.3 DNAML...
上傳時間: 2014-01-24
上傳用戶:bjgaofei
資源簡介:An Introduction to Genetic Algorithms for Scientists and Engineers By David Coley, World Scientific Press, 1999 (US$28 / £ 19.04) 書中的算法源程序
上傳時間: 2014-01-22
上傳用戶:yd19890720
資源簡介:Using Ant Colony Optimization Algorithm to solve Traveling Salesman Problem.對此方面的研究很有幫助
上傳時間: 2014-01-12
上傳用戶:集美慧
資源簡介:this is a project ,you can use it to solve some Problems such as
上傳時間: 2016-01-14
上傳用戶:jyycc
資源簡介:2. Using Gaussian elimination method and Gaussian elimination method with row scaled method to solve the following tri-diagonal system for n=10 and 100
上傳時間: 2013-12-31
上傳用戶:lyy1234
資源簡介:Using Jacobi method and Gauss-Seidel iterative methods to solve the following system The required precision is   =0.00001, and the maximum iteration number N=25. Compare the number of iterations and the convergence of thes...
上傳時間: 2016-02-06
上傳用戶:zmy123
資源簡介:ARPACK is a collection of Fortran77 subroutines designed to solve large scale eigenvalue Problems.
上傳時間: 2013-12-09
上傳用戶:66666
資源簡介:using queue to solve traffic matter by C++ in linux environment
上傳時間: 2014-01-09
上傳用戶:mikesering
資源簡介:TSP( Traveling Salesman Problem) is a typical NP complete problem ,Genetic algorithm is the perfect method for solving NP complete problem.
上傳時間: 2016-06-26
上傳用戶:sevenbestfei
資源簡介:本程序模擬GP算法處理數(shù)據(jù)的方法步驟How can computers learn to solve Problems without being explicitly programmed? In other words, how can computers be made to do what is needed to be done, without being told exactly how to do it?this is an a...
上傳時間: 2016-08-27
上傳用戶:啊颯颯大師的
資源簡介:This program proposed improved adaptive Genetic Algorithms saccording to the idea that the best individualon current generation should bekept tonext generation,but the best individual should becrossed and mutated by some probability.
上傳時間: 2014-01-01
上傳用戶:冇尾飛鉈
資源簡介:using NVIDIA FFT CUDA Library to solve FFT problem
上傳時間: 2014-01-24
上傳用戶:duoshen1989
資源簡介:The basic principle using the branchand- bound strategy to solve the traveling salesperson optimization problem (TSP) consists of two parts. 􀂄 There is a way to split the solution space. 􀂄 There is a way to predict a lo...
上傳時間: 2017-02-19
上傳用戶:comua
資源簡介:how to solve Problems in c++
上傳時間: 2017-03-11
上傳用戶:chongcongying