搜索资源列表
fine
- 双人五子棋(1、 使用说时间复杂度分析：因为要进行行列判断是否赢，所以复杂度为O（16*16）2、 明：本程序在DOS环境运行，可执行文件：fine.exe-Double 331 (1, the use of that time complexity analysis : As for the ranks to determine whether the win, so complexity is O (16 * 16) 2, stat
zuoye4
- 这是用VC++写的中序排序算法的程序，排序的时间复杂度低！-This is the VC was the order algorithm procedures, scheduling time low complexity!
intel hex格式
- LCD 仿真器一、概述 LCD仿真器是一种电子产品的辅助开发工具。目前LCD（液晶屏）在各种电子产品的使用越来越广泛，开发人员在开发带LCD的产品时会用到各种各样的LCD，这些LCD或是现有的，或是定制，现有的LCD不一定能完全满足设计需要，定制LCD需要时间，需要资金，做好后还有修改的可能性，造成不必要的浪费。传统的做法是用LED（发光管）＋驱动电路来仿真LCD，其弊端有四，一、电路复杂，功耗大，100多点的LCD电流将达1A
longest common substring
- 该程序完成在两个字符串中寻找最长公共子串，如果这样的字符串有多个，则将它们全部找出来，它在最坏情况下的复杂度为O(m*n).-the procedure is completed in two for the longest string of public substrings, if such a number of strings, will they all find out in the worst of the comple
distsort
- 该程序是分布计数排序，它是我所见过的各种排序方法中最快的，它的时间复杂度为O(n),但是这种排序适用于已知待排序列的上下限，并且如果上限与下限的差值比较大的话，空间消耗也比较大．-distribution of the program is counting sequencing, it is I have seen the fastest sorting methods, it's time complexity of O (
libsfxdisk-1[1].2.tar
- 后缀数存储算法，利用后缀树(sufixtree)存储，搜索数据，可以达到C*O(n)的复杂度-suffix several storage algorithm, the use of the suffix tree (sufixtree) storage, search, which can reach C * O (n) the complexity
操作矩阵的类 CMatrix
- 一个操作矩阵的类CMatrix的算法，代码比较长，但是时间复杂度不是很高，所以个人觉得还算是个合格的该类算法代码-an operational matrix of categories CMatrix algorithm, code rather long, but time complexity is not very high, so personally think that this was a qualified source
icaML
- This a Bayesian ICA algorithm for the linear instantaneous mixing model with additive Gaussian noise [1]. The inference problem is solved by ML-II, i.e. the sources are found by integration over the source posterior and
领域驱动开发原版
- Addison.Wesley.Domain.Driven.Design.Tackling.Complexity.In.The.Heart.Of.Software.eBook-LiB
Tom M. Mitchell的《Machine Learning》中文版
- 机器学习的中文版本，作者Tom M. Mitchell。这本教材的目标是展现机器学习中核心的算法和理论。机器学习从很多学科吸收了成果和概念，包括统计学、人工智能、哲学、信息论、生物学、认知科学、计算复杂性和控制论等。-Machine learning of the Chinese version, the author Tom M. Mitchell. The teaching objective is to demonstrate t
Network Development Kit
- The Network Development Kit hides all the complexity of the connection, sending, and receiving of data over a network. You only have to deal with three classes: CNDKServer, CNDKClient, and CNDKMessage. With just a few me
farrow filter
- A design method was introd uced to efficiently implement an interpolator by Farrow structure，which can be used in an all—digital timing recovery scheme．An algorithm was presented to calculate the interpolator coefficien
免疫算法
- In the last twenty years, the design of efficient function optimizers has been a crucial topic of research work. Many theoretical and practical research problems involve combinatorial optimization, which is obtaining the
Inside The C++ Object Model
- Inside the C++ Object Model focuses on the underlying mechanisms that support object-oriented programming within C++: constructor semantics, temporary generation, support for encapsulation, inheritance, and "the vir
vox.tar
- Dialogic的vox语音格式实际上是一种ADPCM编码，与ITU的G.726 ADPCM算法非常类似。由于ITU的G.726算法比较复杂，实际应用中，多半采用该算法的变体实现。各种变体的区别主要在于参数不同。Dialogic采用的是OKI的一 种实现，称为OKI ADPCM。Windows的.wav格式也包括OKI的ADPCM。-the vox Dialogic voice format is actually a ADPCM en
selectsort
- 《计算机算法基础》关于选择问题算法：找第k小元素，时间复杂度为O（n）；-"computer algorithm based" on the choice of algorithm : k find small elements, time complexity of O (n);
FGSource
- 本软件是一个运行在Penbex OS (v1.3)上的绘制函数图像的工具。用它可以绘制平面直角坐标系下的显函数和隐函数的图像。与大部分绘制函数图像的软件不同，用本软件不但可以绘制隐函数的图像而且对隐函数的复杂程度没有限制。不过，绘制复杂隐函数的图像将花费相当长的时间，因此，请尽量以 y=f(x) 这样的显函数的形式输入函数的表达式。另外，以直观的“数学形式”显示函数的表达式也是本软件的一个特色。-the software is runn
穷举算法
- 在许多情况下我们需要穷举组合的算法，比如密码词典。这个算法的关键是密码下标进位的问题。另外本例子中的写文件语句效率比较低，为了降低算法复杂度没有优化。如果要提高写文件的效率，可以使用缓冲区，分批写入。-in many cases we need exhaustive combination of algorithms such as password dictionary. The algorithm is the key indice
kuaisupaixuway
- 优点： 1、每次快速排序将确定二个元素位置 2、每次快速排序将划分三个区间，优化后续平均时间和空间复杂度 缺点：-advantages : one each rapid sequencing of two elements identified two locations, each rapid sequencing will be divided into three interval, optimizing the average
小游戏：五子棋的设计与实现
- 五子棋的设计与实现 本“五子棋“程序只编写了人机对弈部分，运用了博弈树进行搜索，在选取最优的走步时使用极大极小分析法，考虑到搜索的时间复杂度和空间复杂度，在程序中只进行了2步搜索，即计算机在考虑下一步的走法时，只对玩家进行一步的推测。（程序中的棋盘规格为15*15）。-renju the design and implementation of the "331" procedure prepared by the