算法设计:著名的n后问题:在NxN的棋盘上放彼此不受攻击的n个皇后,按国际象棋的规则,任何2个皇后不在同一行或同一列或同一斜线上. 本算法才用回朔法来解决.
上传时间: 2013-12-18
上传用户:h886166
Sudoku as a CSP: Using algorithms and techniques from CSP to solve an NxN Sudoku puzzle.
标签: Sudoku algorithms techniques CSP
上传时间: 2017-05-07
上传用户:tfyt
生成具有NxN的正方形二维随机粗糙表面,这是一组开源代码,里面是生成二维高斯随机粗糙面。
上传时间: 2018-10-31
上传用户:chaoren
The code performs a number (ITERS) of iterations of the Bailey s 6-step FFT algorithm (following the ideas in the CMU Task parallel suite). 1.- Generates an input signal vector (dgen) with size n=n1xn2 stored in row major order In this code the size of the input signal is NN=NxN (n=NN, n1=n2=N) 2.- Transpose (tpose) A to have it stored in column major order 3.- Perform independent FFTs on the rows (cffts) 4.- Scale each element of the resulting array by a factor of w[n]**(p*q) 5.- Transpose (tpose) to prepair it for the next step 6.- Perform independent FFTs on the rows (cffts) 7.- Transpose the resulting matrix The code requires nested Parallelism.
标签: iterations performs Bailey number
上传时间: 2014-01-05
上传用户:libenshu01