solve the 8-puzzle problem using A* algorithm. Definitely written by my self, also include BGI graphics library output.
資源簡(jiǎn)介：solve the 8-puzzle problem using A* algorithm. Definitely written by my self, also include BGI graphics library output.
上傳時(shí)間： 2014-01-17
上傳用戶(hù)：zm7516678
資源簡(jiǎn)介：Solve the 8-puzzle problem using A * algorithme. Input: Program reads start state and goal state and heuristic (N or S) from EightPuzzle.INP file.0 representing blank. There are 2 Heuristic: 1. N: Number of misplaced tiles 2. S: S...
上傳時(shí)間： 2017-08-12
上傳用戶(hù)：jjj0202
資源簡(jiǎn)介：Using Genetic algorithm to solve the 8 Queens problem.
上傳時(shí)間： 2014-11-28
上傳用戶(hù)：yd19890720
資源簡(jiǎn)介：Solve the traveling salesman problem with a genetic algorithm.
上傳時(shí)間： 2013-12-19
上傳用戶(hù)：qunquan
資源簡(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
上傳用戶(hù)：nanfeicui
資源簡(jiǎn)介：An A-star algorithm for solving 8-puzzle problem
上傳時(shí)間： 2017-06-18
上傳用戶(hù)：han_zh
資源簡(jiǎn)介：Matlab script for solution to the driven cavity problem on a staggered grid using a divergence formulation and second-order Runge-Kutta time integration.
上傳時(shí)間： 2017-05-14
上傳用戶(hù)：lingzhichao
資源簡(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
上傳用戶(hù)：ANRAN
資源簡(jiǎn)介：This is a java implementation for solving NQueen problem using genetic algorithm.Enjoy it!
上傳時(shí)間： 2017-06-18
上傳用戶(hù)：許小華
資源簡(jiǎn)介：The C# program will solve the Tower of Hanoi for a given number of rings/disks/plates and display the ring/disk/plate movement. The movement will be shown graphically
上傳時(shí)間： 2013-12-20
上傳用戶(hù)：1966640071
資源簡(jiǎn)介：譜域法求解電磁場(chǎng)擴(kuò)散方程的Fortran程序 A working example of solving the electromagnetic diffusion equation using a spectral method
上傳時(shí)間： 2014-01-10
上傳用戶(hù)：璇珠官人
資源簡(jiǎn)介：This paper describes a bus mastering implementation of the PCI Express protocol using a Xilinx FPGA. While the theoretical peak performance of PCI Express is quite high, attaining that performance is a complex endeavor on top of an already ...
上傳時(shí)間： 2014-06-16
上傳用戶(hù)：teddysha
資源簡(jiǎn)介：C PROGRAM FOR 8 QUEENS problem USING BACKTRACKING
上傳時(shí)間： 2017-08-07
上傳用戶(hù)：zuozuo1215
資源簡(jiǎn)介：Solution to the "8 Queens problem" (8 Damen problem) known from Chess
上傳時(shí)間： 2017-08-12
上傳用戶(hù)：894898248
資源簡(jiǎn)介：These are the examples from the book Java Examples in a Nutshell, 2nd Edition, by David Flanagan. See the file index.html for more information.
上傳時(shí)間： 2016-01-22
上傳用戶(hù)：13188549192
資源簡(jiǎn)介：These are the examples from the book Java Examples in a Nutshell, 2nd Edition, by David Flanagan. See the file index.html for more information.
上傳時(shí)間： 2016-03-08
上傳用戶(hù)：yyq123456789
資源簡(jiǎn)介：The Fat Fs module is a middleware that written in ANSI C. There is no platform dependence, so long as the compiler is in compliance with ANSI C. However it handles the system portable FAT structures. You must take the endian into considerat...
上傳時(shí)間： 2014-01-12
上傳用戶(hù)：cccole0605
資源簡(jiǎn)介：This is a uart source written by VHDL .widely used and compatible with Whibone.
上傳時(shí)間： 2013-12-22
上傳用戶(hù)：cxl274287265
資源簡(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
上傳用戶(hù)：bjgaofei
資源簡(jiǎn)介：We demonstrate a method for encoding and decoding the [24,12,8] extended binary Golay code using a simple apparatus. We also present several generalizations of this construction which admit similar decoding algorithms.
上傳時(shí)間： 2013-12-20
上傳用戶(hù)：moshushi0009
資源簡(jiǎn)介：using greedy trategy to solve the problem of multiOptimalServe.this code runs in vc 6.0.
上傳時(shí)間： 2013-12-05
上傳用戶(hù)：腳趾頭
資源簡(jiǎn)介：using greedy tratage to solve the problem of Number Delete.
上傳時(shí)間： 2014-01-03
上傳用戶(hù)：dongqiangqiang
資源簡(jiǎn)介：TSP( Traveling Salesman problem) is a typical NP complete problem ,genetic algorithm is the perfect method for solving NP complete problem.
上傳時(shí)間： 2016-06-26
上傳用戶(hù)：sevenbestfei
資源簡(jiǎn)介：The ADC0803 family is a series of three CMOS 8-bit successive approximation A/D converters using a resistive ladder and capacitive array together with an auto-zero comparator. These converters are designed to operate with microprocessor-...
上傳時(shí)間： 2016-11-20
上傳用戶(hù)：libenshu01
資源簡(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
上傳用戶(hù)：comua
資源簡(jiǎn)介：A 8 puzzle program solver.user have to input the current state and goal state of your 8 puzzle and it solving by the program.
上傳時(shí)間： 2014-08-10
上傳用戶(hù)：huyiming139
資源簡(jiǎn)介：Solving the TSP problem using the Branch and Bound algorithm
上傳時(shí)間： 2013-12-15
上傳用戶(hù)：asddsd
資源簡(jiǎn)介：A useful tool to calculate the DOA using MUSIC algorithm in Matlab with a GUI. Very easy to use.
上傳時(shí)間： 2017-08-06
上傳用戶(hù)：Miyuki
資源簡(jiǎn)介：File to Plot 8 channels in Matlab using data from the USB captured into a TXT file. (it makes the 8 different plots)
上傳時(shí)間： 2013-12-06
上傳用戶(hù)：as275944189
資源簡(jiǎn)介：/* * EULER S algorithm 5.1 * * TO APPROXIMATE THE SOLUTION OF THE INITIAL VALUE problem: * Y = F(T,Y), A<=T<=B, Y(A) = ALPHA, * AT N+1 EQUALLY SPACED POINTS IN THE INTERVAL [A,B]. * * INPUT: ENDPOINTS A,B INITIAL CONDITION ALPHA INTE...
上傳時(shí)間： 2015-08-20
上傳用戶(hù)：zhangliming420
