搜索资源列表
5-Queen
- N皇后问题！图形界面演示，VC6.0开发-N Queen! GUI demonstration VC6.0 development. .
wavelet transform-n point
- n点长度的DB系列小波多分辨分解程序。 可以实现一维信号的分解和重构-length of the point n DB series multiresolution wavelet decomposition process. Peacekeeping can achieve a signal decomposition and reconstruction
CMU-Cam_Toolkit_v2
- 自然语言处理和语音识别中必须的语言模型工具，这个工具可以生成文本或者二进制格式的N-gram表。配合HTK使用效果会更好。-natural language processing, speech recognition and language model must tools, this tool can generate text or binary format of the N-gram table. With the use
N-Step Progress
- Ｎ级进程调度，界面和进程都不错，是很值得下载的-N-scheduling process, the interface and the process is pretty good, and is worth the download
N_Queen
- N皇后问题的优化版本，对于N＝ 13的情况可以在1秒内出结果-N Queen of the optimized version for the N = 13 can be in a give results within seconds
shortest_BySophia
- 给定平面上N个点，找其中的一对点，使得在N个点组成的所有点对中，该点对间的距离最小。-given plane N and find the one pair of points made in the composition of N points on all points, which points to the distance between the smallest.
nqueue
- 用分支界限法实现的n后问题 vc++ 语言效率很好-branch line with the law to achieve n vc language problem after a good efficiency
Ngrams
- A C++ N-grams Package 2.0 This is a simple C++ n-grams package that includes a header, the corresponding cpp file, and a sample driver program. It is a natural language processing tool for creating n-gram profiles for
bahuanghouwtdejavashixian
- n皇后问题算法。 * 把棋盘看成一个坐标系，以左下角为原点（0,0)。坐标系的每个点为一个Point类。 * 每个皇后为一个皇后对象Queen。 * 判断一个点的坐标是否在，一个皇后控制的范围的函数为Queen.isUnderControl(point)。 -n Queen's Algorithm.* Chessboard as a coordinate system to lower left-hand
bahuanghou44444
- 八皇后问题的拓展，n皇后问题的深度优先算法，可以把结果以文件形式输出。N<=20-eight of the Queen's expansion, n depth of the Queen's priority algorithm, the results can be output in the form of a document. N
gooleansweryang
- n后问题回溯(递归) C/C++编写的n后问题回溯(递归) 欢迎大家使用，给大家带来愉快的心情-problems after n retrospective (recursive) C/C n prepared by the issue after backtracking (recursive) Everyone is welcome to use. give us some pleasant mood
p_queue
- n后问题，主要是算法问题，有java改写-after issue, the main issue is the algorithm, rewritten java
aglorithm
- 问题算法源代码：骑士遍历、万年历、N皇后问题回溯算法、动态计算网络最长最短路线、货郎担分枝限界图形演示、货郎担限界算法、矩阵乘法动态规划、网络最短路径Dijkstra算法-problems algorithm source code : Knight traversal, calendar, N Queens backtracking algorithms, Dynamic computing network longest short
2_8
- 设n个不同的整数排好序后存于T[0:n-1]中。若存在一个下标I,0<I<n,使得t[I]=I,设计一个有效算法找到这个下标。要求算法在最坏情况下的计算时间为O(logn).-Let n different integer sequence after arranging deposit T [0 : n-1]. If there is a subscr ipt I, 0
N.C.P.H--heikejishuyuwangluoanquan
- 黑客技术与网络安全，，，，值得一看，，是一般不错的电子书籍-hacking technology and network security,, an eye-catcher, is generally good e-books
vc8quween
- 1. 编写求n后问题的通用函数； 2. 取n=8计算出n后问题的所有可行解，并以8元组的形式输出（可以对可行解的结构进行分析，）； 3. 随机输出2个可行解的图形。其中棋盘要有8×8的格子，Queen图象自选； -1. To prepare for issues common after n function 2. Take n = 8 calculated after n all feasible solution, a
8queenjava
- 利用java编程 1. 编写求n后问题的通用函数； 2. 取n=8计算出n后问题的所有可行解，并以8元组的形式输出（可以对可行解的结构进行分析，）； 3. 随机输出2个可行解的图形。其中棋盘要有8×8的格子，Queen图象自选； -Using java programming 1. To prepare for issues common after n function 2. Take n = 8 calculate
n!qiujie
- 本人初学c语言程序不是很拿手，n!的求法。。希望大家指教-I novice c language program is not very good at, n! The Method. . We hope the exhibitions
st200408202223-01
- N皇后问题实验报告，自己设计的一个小程序，望高手指教-N Queens experiment, designed by a small procedure, experts advise Pillar
01-8queens
- n皇后问题，rar格式，运行环境c++，n〉=1-n Queens problem, rar format, operating environment c++, n> = 1