搜索资源列表
Tug og war.rar
- Tug of War A tug of war is to be arranged at the local office picnic. For the tug of war, the picnickers must be divided into two teams. Each person must be on one team or the other; the number of people on the two teams must not differ by more than
eightnumbyahei0802
- 八数码难题求解程序本程序所采用的启发函数,本人不能证明它能解决任何的八数码难题,如果对于较难的问题会产生很多节点,有可能会使空间不足,所以尽量不要出太难的问题难为它.希望广大的人工智能爱好者能写出更好的启发函数.-eight digital problem solving program of the procedures used by the heuristic function, I can not prove that it can resolve any of the eight di
calc_3
- 数学表达式计算器，VC 平台操作。能够计算数学公式和表达式，功能比较强大。-mathematical expression calculator, VC platform operators. To calculate mathematical formula and expression, function more powerful.
MATLAB 6_5 辅助神经网络分析与设计_10954899
- 本书就使用matlab实现bp神经网络进行了较为详细的说明，书中包含许多具体的实例说明，希望能为大家带来一定的帮助。-book on the use of Matlab bp neural network to achieve a more detailed descr iption of the book contains many specific examples, we hope to bring help to a certain extent.
Jacobi迭代法
- 用C语言来实现的。求解线性方程组的迭代，是一种简单的迭代法，可不如 Gauss-Seidel迭代法收敛速度快。-Use c language to make a Jacobi iterative arithmetic which could solve the linear equation group, but it s may be more slower than the Gauss-Seidel iterative arithmetic.
svdpackc++.tar
- 矩阵奇异分解(svd)最新c++版本，性能更稳定-matrix decomposition (SVD) c latest version of a more stable performance
用Welch法进行功率谱估计
- 考虑L的三个不同值：L＝256（3个数据段），L＝128(7个数据段)和L=64（15个数据段）。各自的谱估计图如上图所示。可以明显的看到，加窗明显的减小了频谱上的假谱峰，但也更加进一步平滑了谱峰。所以，对于L＝64的情况，在ω＝0.8π的谱线可以很确定的辨认，但是那两个靠近的谱峰不容易区分。对于L＝128的情况，这种情况提供了在分离和检测间最好的均衡。当然，对于在L＝256时的情况，效果是更好的，能够从谱估计图上明显的分辨出三条谱线的存在以及它们幅度关系的强弱。 除了Welch法外，还可以采用
solenoid
- 绘制螺纹的MATLAB程序，对于生成螺纹管等几何体较为重要-A MATLAB program can draw bolt pattern, and is more important to produce bolt pattern pipe and other geometry body
gpc++0.5.2.tar
- 用C++编写的遗传算法，涵盖较多内容，有文档-prepared by the genetic algorithm, covering more content, documents
SSRFinder
- 快速寻找SSR,使用滑动块寻找短重复序列,目前已有分子生物育种网站在使用,比较宝贵的源码-SSR, use sliding block for a short repetitive sequence, there is a molecular biology breeding sites in the use of more valuable source
图的常用算法
- 图的常用算法，比较全面 并有一种求图的最短路径的算法， 欢迎指正，-map commonly used algorithms, a more comprehensive and a map for the shortest path algorithm welcome correction, thank you
算法导论
- 介绍算法的书籍，比较详细介绍了相关算法的一些基本知识和事项过程。-algorithm introduced the books, more detailed correlation algorithm introduced some basic knowledge of the process and issues.
LMS by adian try
- 本程序用matlab工具编程,采用lms算法实现信道估计.其中信源是+-1二值随机码,信道为多径(3路径)信道.-the procedures used Matlab programming tools using LMS algorithm channel estimation. Which source is -1 two random codes, channel more Drive (Route 3) channel.
MCORRE
- 用FFT实现相关函数快速估计,相比一般的直接按定义计算其算法结构要简单得多,而且效率较高-using FFT function rapid estimates, compared to the direct general terms by its algorithm much more simple, but efficient
function
- 遗传算法小程序,关于解决TSP问题的遗传算法,仅供参考,多多交流-GA small program on the settlement of the TSP Genetic Algorithm for reference purposes only and interact more
用uml进行分析设计
- 这是uml进行分析设计的一片文档，比较详细，-conducted an analysis of the design documents, in more detail,
strcturelvbonew
- 利用数学形态学构成形态学滤波器对图象进行滤波,处理效果较满意.-using mathematical morphology constitute morphological filter image filtering, processing more satisfied with the results.
改进遗传算法－郭涛算法做最优化问题很管用
- 改进遗传算法－郭涛算法做最优化问题很管用,算法的基本思想是 先任意产生n个随机数，然后从n个数里随机选择m个数，再有这m个 数合成一个新数，将这个新数同n个数中间适应值函数值的最差的比较， 如果好的话就取代最差的那个，如果它比最好的还要好的话，则把最好的 也取代。如果比最差的坏，则重新合成一个新数。依次循环下去。 程序的奇妙之处是GA_crossover()函数，产生的新数确实比较好，看看 那位大侠能改进一下，产生比这跟好的数。-improved genetic algo
Try-to-write-A-more-B
- 设A＝（a1， ……，am）和B＝（b1，……，bn）均为顺序表，A’和B’分别为A和B中除去最大共同前缀后的子表 试写一个比较A，B大小的算法-Set A = (a1,......, am) and B = (b1,......, bn) are all order list, A "and" B for A and B were removed after the son of the most common prefix table Try to write A more A, B
more-lines-in-the-show
- Visual c++在编辑框中实现多行显示-In the edit control is realized in more lines in the show