algorithm bfs to solve knight tour problem
資源簡(jiǎn)介：algorithm bfs to solve knight tour problem
上傳時(shí)間： 2013-12-23
上傳用戶：qwe1234
資源簡(jiǎn)介：Using Ant Colony Optimization algorithm to solve Traveling Salesman problem.對(duì)此方面的研究很有幫助
上傳時(shí)間： 2014-01-12
上傳用戶：集美慧
資源簡(jiǎn)介：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...
上傳時(shí)間： 2014-01-24
上傳用戶：bjgaofei
資源簡(jiǎn)介：This function implements brute force bactracking to solve the knapsack problem.
上傳時(shí)間： 2017-04-02
上傳用戶：stvnash
資源簡(jiǎn)介：this is test program which tries to solve producer consumer problem
上傳時(shí)間： 2014-01-10
上傳用戶：zgu489
資源簡(jiǎn)介：Using Genetic algorithm to solve the 8 Queens problem.
上傳時(shí)間： 2014-11-28
上傳用戶：yd19890720
資源簡(jiǎn)介：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
上傳時(shí)間： 2013-12-06
上傳用戶：nanfeicui
資源簡(jiǎn)介：this tar includes my code which employ the Lin-Kernighan algorithm to address the tsp problem. this tar also include some testfiles and config file and a readme which describes how to run this program.
上傳時(shí)間： 2014-01-10
上傳用戶：stella2015
資源簡(jiǎn)介：source codes to solve Hexpuzzle problem
上傳時(shí)間： 2016-01-29
上傳用戶：cmc_68289287
資源簡(jiǎn)介：using greedy trategy to solve the problem of multiOptimalServe.this code runs in vc 6.0.
上傳時(shí)間： 2013-12-05
上傳用戶：腳趾頭
資源簡(jiǎn)介：using greedy tratage to solve the problem of Number Delete.
上傳時(shí)間： 2014-01-03
上傳用戶：dongqiangqiang
資源簡(jiǎn)介：using NVIDIA FFT CUDA Library to solve FFT problem
上傳時(shí)間： 2014-01-24
上傳用戶：duoshen1989
資源簡(jiǎn)介：use visual c++ to solve math problem ,Chengbihong,people post pre
上傳時(shí)間： 2013-12-20
上傳用戶：hgy9473
資源簡(jiǎn)介：Matlab script for solution to the driven cavity problem using the FDS algorithm, which discretizes the Stokes form of the Navier-Stokes equations.
上傳時(shí)間： 2017-05-14
上傳用戶：ANRAN
資源簡(jiǎn)介：This routine calls the glpk library to solve a LP/MIP problem. A typical LP problem has following structure: [min|max] C x s.t. Ax ["="|"<="|">="] b {x <= UB} ...
上傳時(shí)間： 2014-12-01
上傳用戶：changeboy
資源簡(jiǎn)介：knight s Tour problem
上傳時(shí)間： 2013-12-15
上傳用戶：weiwolkt
資源簡(jiǎn)介：Producer Consumer problem simulator to solve Synchronization issues
上傳時(shí)間： 2014-01-10
上傳用戶：gxf2016
資源簡(jiǎn)介：Reader Writer problem to solve synchronization issues
上傳時(shí)間： 2013-12-11
上傳用戶：LIKE
資源簡(jiǎn)介：A demo for knight s Tour problem by Java applet
上傳時(shí)間： 2014-12-01
上傳用戶：kr770906
資源簡(jiǎn)介：it is possible to help with this program. hope to solve your problem with it
上傳時(shí)間： 2014-01-12
上傳用戶：515414293
資源簡(jiǎn)介：this m file can Find a (near) optimal solution to the Traveling Salesman problem (TSP) by setting up a Genetic algorithm (GA) to search for the shortest path (least distance needed to travel to each city exactly once) Notes: 1. Input erro...
上傳時(shí)間： 2013-12-22
上傳用戶：ruixue198909
資源簡(jiǎn)介：Finds a (near) optimal solution to the Traveling Salesman problem (TSP) by setting up a Genetic algorithm (GA) to search for the shortest path (least distance needed to travel to each city exactly once)
上傳時(shí)間： 2013-12-04
上傳用戶：從此走出陰霾
資源簡(jiǎn)介：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...
上傳時(shí)間： 2017-02-19
上傳用戶：comua
資源簡(jiǎn)介：method of moment to solve Current distribution of Dipole Antenna MOM方法解決天線電流分布問(wèn)題
上傳時(shí)間： 2013-12-29
上傳用戶：woshiayin
資源簡(jiǎn)介：This book is an in-depth exploration into eVB s inherent features, and how to use them to solve likely mobile application programming tasks. After reading the book the reader will be able to write applications tackling a wide array of busin...
上傳時(shí)間： 2013-12-12
上傳用戶：aa54
資源簡(jiǎn)介：this is a project ,you can use it to solve some problems such as
上傳時(shí)間： 2016-01-14
上傳用戶：jyycc
資源簡(jiǎn)介：it just to check a math problem
上傳時(shí)間： 2016-01-16
上傳用戶：dragonhaixm
資源簡(jiǎn)介：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
上傳時(shí)間： 2013-12-31
上傳用戶：lyy1234
資源簡(jiǎn)介：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...
上傳時(shí)間： 2016-02-06
上傳用戶：zmy123
資源簡(jiǎn)介：Using Gaussian elimination to solve linear equations.
上傳時(shí)間： 2013-12-18
上傳用戶：shus521
