-
HanoiFolder
Given a stack of n disks arranged largest on the bottom to smallest on top placed on a rod, together with two empty rods, the towers of Hanoi puzzle asks for the minimum number of moves required to move the stack one rod to another, where moves are allowed only if they place smaller disks on top of larger disks
- 2015-02-05 20:49:22下载
- 积分:1
-
knn
matlab程序源代码,能够正确实现,最近邻分类(matlab program source code, to be able to correctly implement the nearest neighbor classifier)
- 2013-03-12 20:03:50下载
- 积分:1
-
main
关于极限学习机在脑电信号中的应用的主程序表示说明(About extreme learning machine in the application of brain electrical signal of the main program said
)
- 2014-06-30 11:36:07下载
- 积分:1
-
matlab
matlab滤波器,里面有三个方法滤波,用来滤波音频文件的(matlab filter, there are three ways to filter, for filtering the audio file)
- 2010-11-26 15:11:12下载
- 积分:1
-
matlab
matlab書籍的簡介 張智星 適合剛入門程式語言的人(Zhang Zhi brief introduction matlab book stars)
- 2009-03-26 17:48:02下载
- 积分:1
-
matpower4.0-(1)
MATPOWER是MATLAB的M文件包® 求解潮流和最优潮流问题。它的目的是作为一个研究者和教育者,是易于使用和修改仿真工具。MATPOWER是设计给最佳的性能,同时保持代码的简单理解和修改。它最初是为POWERWEB项目的一部分。(MATPOWER is a package of MATLAB® M-files for solving power flow and optimal power flow problems. It is intended as a simulation tool for researchers and educators that is easy to use and modify. MATPOWER is designed to give the best performance possible while keeping the code simple to understand and modify. It was initially developed as part of the PowerWeb project.
)
- 2015-01-29 11:47:23下载
- 积分:1
-
convolution
信号分析与处理中的卷积,适用于合成地震记录(Signal analysis and processing of convolution, for synthetic seismograms)
- 2011-11-14 11:54:26下载
- 积分:1
-
qr
说明: qr变换和householder求特征值的算法,可与matlab结果比对(qr transform and householder eigenvalue algorithm, the results compare with matlab)
- 2014-10-16 10:35:19下载
- 积分:1
-
pipe
某石油公司计划建造一条由东向西的主输油管道。该管道要穿过一个有n 口油井的油田。从每口油井都要有一条输油管道沿最短路经(或南或北)与主管道相连。如果给定n 口油井的位置,即它们的x 坐标(东西向)和y 坐标(南北向),应如何确定主管道的最优位置, 即使各油井到主管道之间的输油管道长度总和最小的位置?证明可在线性时间内确定主管道的最优位置。(An oil company plans to construct a east to west from the main pipeline. The pipeline to pass through an oil field n wells. Wells from each must have a pipeline along the shortest path (or South or North) connected with the competent Road. If given the location of oil wells in n, that is, their x coordinates (east-west) and y coordinates (north-south), should be how to determine the optimal position in charge of Road, even if the wells to the pipeline in charge of Road between the sum of the smallest length location? proved to be linear time to determine the optimal position in charge of Road.)
- 2008-07-07 10:25:25下载
- 积分:1
-
clamav-bytecode-compiler-master
camlav下载,欢迎研究杀毒人士下载,里面有代码的所有内容(calav,welcome to download the code)
- 2014-02-17 16:18:49下载
- 积分:1