搜索资源列表
链表之VB实现(类)
- 链表一般是用C或C＋＋实现的，用VB的类模块实现，试过吗？没想到可以实现吧-C or C + +, VB class module, tried? Never mind can achieve it
Expert_Choice[1]
- Expert Choice represents a significant contribution to the decision making process 工t assists a decision maker in solving complex problems involving many criteria and several courses of action . An Expert Choice solution to a problem reflects the exp
cellrecognition
- 细胞识别记数系统的实现,全部源代码,包括中心点标记,区域填充,记数等-,Visual C++,图形图象/Graph program -cell identification number system in mind the realization of full source code, including the focal point mark, regional filling, and so mind-, Visual C, graphic images / Graph program
musetrial270
- 一款很好用的打谱软件,可以选择不同的乐器试听你所记的谱.-A good fight spectrum of software can choose different instruments Let your mind spectrum.
counts
- 记数问题，本实验已经通过运行，下载后就可以用了。-mind a few problems, the experiment by running, you can download spent.
Eight_Num_Fengart
- 本代码是为了应付人工智能的实验而编写的，写的潦草请不要介意。我又是通过这代码来“引玉”，相信看过我编写的黑白棋源代码的人应该知道“引玉”是什么意思。如果你有“玉”（什么更高效的算法能在更短的时间内求得结果，或者博弈方面的），就欢迎“砸”过来－－fengart@126.com，我会很感激！（A* 算法解决八数码问题我已经研究过了，不要砸这个来）在 赛扬D2.1G 的机器上测试，算法的解答时间不超过0.1秒。 最好优先搜索算法的解答时间一般在0.05秒左右。 里面还可以演示八数码问题的从初始态到目标
kris_qsort_exe
- This forced me to write about more interesting and comprehensive sorting methods, the result of which is this one. Through this writing I have tried to give in-depth coverage of the entire sort algorithm I hope Peter wouldn t mind reading it. This ar
hyplas
- ************************************************************************ * * * * * THIS IS THE H Y P L A S 2.0 README FILE * * ----------------- * * * * HYPLAS is a finite element program for implicit small and large * * strain analisys of hyperelast
merge
- 在一个圆形操场的四周摆放着n堆石子。现要将石子有次序地合并成一堆。规定每次只能选相邻的2堆石子合并成新的一堆，并将新的一堆石子数记为该次合并的得分。试设计一个算法，计算出将n堆石子合并成一堆的最小得分和最大得分。 编程任务：对于给定n堆石子,编程计算合并成一堆的最小得分和最大得分。-Playground in a circle around the stones are placed n heap. Stone is to have the order to merge into a pi
biMatichHungary
- 偶图最大匹配完全照算法说明利用集合运算实现的matlab代码。这里需要大家讨论的是增广路的选取的算法，希望朋友们多多讨论，争取找一种更好的增广路方法，有想法的一定告诉我，谢谢，jxrhhu@hhu.edu.cn-Bipartite graph maximum matching algorithm descr iption completely according to the use of computing to achieve a collection of matlab code. Her
Huffmatreeofdatastructure
- 哈夫曼树又称最优二叉树，是一种带权路径长度最短的二叉树。所谓树的带权路径长度，就是树中所有的叶结点的权值乘上其到根结点的路径长度（若根结点为0层，叶结点到根结点的路径长度为叶结点的层数）。树的带权路径长度记为WPL=(W1*L1+W2*L2+W3*L3+...+Wn*Ln)，N个权值Wi(i=1,2,...n)构成一棵有N个叶结点的二叉树，相应的叶结点的路径长度为Li(i=1,2,...n)。可以证明哈夫曼树的WPL是最小的。-Huffman tree is also called the op
GA
- C++ 遗传算法 面向对象设计 内有详细的代码注释，新手学遗传算法的好资料。-C++ GA oriented object mind
sdcalc
- 数独顾名思义——每个数字只能出现一次。数独是一种源自18世纪末的瑞士，后在美国发展、并在日本得以发扬光大的数字谜题。数独盘面是个九宫，每一宫又分为九个小格。在这八十一格中给出一定的已知数字和解题条件，利用逻辑和推理，在其他的空格上填入1-9的数字。使1-9每个数字在每一行、每一列和每一宫中都只出现一次。 这种游戏全面考验做题者观察能力和推理能力，虽然玩法简单，但数字排列方式却千变万化，所以不少教育者认为数独是训练头脑的绝佳方式-Sudoku As the name suggests- Each
matllab_tips
- First keep in mind that this is not a Matlab tutorial. This is just a list of tricks I have found useful while writing the toolboxes available on the Matlab Central repository.
yudan
- 于丹论语心得讲稿 共包括： 《论语》心得（一）《天地人之道》 《论语》心得（二）《心灵之道》 《论语》心得（三）《处世之道》 《论语》心得（四）《君子之道》 《论语》心得（五）《交友之道》 《论语》心得（六）《理想之道》 《论语》心得（七）《人生之道》 -Yu Dan learned the scr ipt of The Analects of Confucius, including: " The Analects of Confucius&quo
tuandui
- 好的心态使我们成功，好的团队心太使团队成功。心态激励-A good state of mind so that we succeed, a good team, too much heart to make the team successful. Mentality incentive
Detec
- Wireless Communication and CDMA This section provides some background information on wireless technology, wireless personal communications, and the basics of CDMA technology. If you are familiar with CDMA technology and the IS-95A stand
IATSP5.10
- 免疫记遗传算法在TSP中的应用，经实验仿真，发现本方法快速有效-Immune genetic algorithm in TSP in mind the application of the experimental simulation, found that this method is rapid and effective
Algorithmsforprogrammers
- This a draft of a book about selected algorithms. The audience in mind are programmers who are interested in the treated algorithms and actually want to create and understand working and reasonably optimized code.-This is a draft of a book about
64985138foc
- this is a java in mind of evalise thank you very much