搜索资源列表
VC界面一字棋
- 用人工智能的αβ剪枝算法实现,界面整洁漂亮,人机各为一方,三子连成一线即赢- pruning algorithm, clean interface beautiful, man-machine for the party, three sons and circumstance that is even win
prune
- alpha and beta pruning 是人工智能方面的很重要的算法，对于理解search有非常重要的作用-alpha and beta pruning artificial intelligence is a very important algorithm, a search for understanding a very important role
search_optimize
- 本文将常见的设计剪枝判断的思路分成可行性剪枝和最优性剪枝两大类，并结合上述三个原则分别以一道竞赛题为例作了说明，最后对剪枝方法作了一些总结。-this paper the design of common pruning judgment ideas into pruning feasibility and optimality pruning two categories, and the combination of these three principles were in a cont
MPRGFFT
- 可利用该源码程序实现输入、输出都为少数点时的FFT Pruning算法。
子集和问题
- 子集和问题.rar:这是我学算法设计时的总结,包括定长和不定长做法(也就是回朔法,剪枝限界),当然也包括穷举法.-subset and problems. Rar : This is my learning algorithm design at the conclusion, including fixed-length and variable length approach (that is, back to Schomburg, pruning Bound), which of cour
corner
- 该程序找到了使用L曲线算法的拐点，是正则化程序中，寻求正则化参数的一种比较好的方法。CORNER Find corner of discrete L-curve via adaptive pruning algorithm.-The program found the algorithm using the L-curve inflection point, is the regularization process, the regularization parameter for a bet
alphabeta
- 采用alpha-beta剪枝算法解决博弈树问题，内含代码注释-Using alpha-beta pruning algorithm to solve the game tree problem, comments containing the code
FiveChessGame
- 用MFC做界面基于α-β剪枝算法的五子棋程序。-To do with the MFC interface α-β pruning algorithm based on the backgammon program.
arit
- c++开发的无优先级运算问题-增量式搜索，回溯-剪枝的策略-c++ development of non-priority operation problem- incremental search, back- the pruning strategy
Gobang
- 一个比较简单的五子棋AI，用的是alpha beta搜索剪枝-A relatively simple backgammon AI, with the alpha beta search pruning
bwc
- 搜索算法部分使用minmax递归，alphabeta剪枝，初期和中期搜索6层，最后部分搜索15层。评估算法主要是最小行动力，加以位置值的相关判断- The search algorithm partially uses the minmax recursion, the alphabeta pruning, the initial period and the intermediate stage searches 6, finally partially searches 15. Appr
yiziqi
- α-β剪枝实现的一字棋,实现算法.α-β剪枝-α-β pruning to achieve the word game, the realization of algorithm. α-β pruning
chinesechessgame
- 人工智能实现博弈,利用剪枝法搜索书,不过机器反应慢,但是人一般失误一次就输了!-Game artificial intelligence to achieve the use of search pruning method book, but the slow response of the machine, but the errors are generally lost once!
AlphaBeta
- AlphaBeta剪枝算法，学习人工智能的一个例子！-AlphaBeta pruning algorithm, an example of artificial intelligence to learn!
nnprune
- This function applies the Optimal Brain Surgeon (OBS) strategy for ％ pruning neural network models of dynamic systems. That is networks ％ trained by NNARX, NNOE, NNARMAX1, NNARMAX2, or their recursive ％ counterparts.-This function applies the
WinNTL-5_3_1
- 密码学界牛人Victor Shoup用C++编写数论类库。 NTL is a high-performance, portable C++ library providing data structures and algorithms for arbitrary length integers for vectors, matrices, and polynomials over the integers and over finite fields and for arbitrary p
skeletonization
- 这是神经网络里面结构优化里面重要的剪枝方法之一，灵敏度剪枝方法。-This is a neural network structure optimization inside one of the methods inside the major pruning, sensitivity pruning method.
Alpha_Beta
- 基于VC++的神经网络剪枝算法程序；“剪枝算法”是一种通过简化神经网络结构来避免网络过拟合的有效方法之一。内附程序说明文档，介绍了该算法的主要原理，运行结果说明以及程序流程图。是很好的学习资料-VC++ based on neural network pruning algorithm program " pruning algorithm" is a kind of neural networks by simplifying the network architectur
Clearance-pruning-method
- 限界剪枝法的VB编程ppt，让你了解该算法。-Clearance pruning method of VB programming ppt, so that you understand the algorithm.
main123
- Apriori核心算法过程如下： 过单趟扫描数据库D计算出各个1项集的支持度，得到频繁1项集的集合。 连接步：为了生成，预先生成,由2个只有一个项不同的属于的频集做一个（k-2）JOIN运算得到的。 剪枝步：由于是的超集，所以可能有些元素不是频繁的。在潜在k项集的某个子集不是中的成员是，则该潜在频繁项集不可能是频繁的可以从中移去。 通过单趟扫描数据库D，计算中各个项集的支持度，将中不满足支持度的项集去掉形成。-Apriori core algorithm proce