搜索资源列表
AVL_Lib
- Although there has been a lot of AVL tree libraries available now, nearly all of them are meant to work in the random access memory(RAM). Some of them do provide some mechanism for dumping the whole tree into a file and loading it back to the memory
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
decisiontree
- 决策树的ID3算法用C++实现，还有一些文章和数据等等。-ID3 decision tree algorithm using C++ implementation, there are some articles and data and so forth.
hello
- 你看过电梯上下来回，你知道它是如何运行的吗？本实例代码将彻底让你懂得其中的奥秘-You ve seen up and down the lift back and forth, you know how it is running it? The example code will let you know how to complete one of the mysteries
homeplanet
- 人类必须在最短的时间内迁往月球。现有n个太空站位于地球与月球之间，且有m 艘公共交通太空船在其间来回穿梭。每个太空站可容纳无限多的人，而每艘太空船i 只可容纳H[i]个人。每艘太空船将周期性地停靠一系列的太空站，例如：(1，3，4)表示该太空船将周期性地停靠太空站134134134…。每一艘太空船从一个太空站驶往任一太空站耗时均为1。人们只能在太空船停靠太空站(或月球、地球)时上、下船。初始时所有人全在地球上，太空船全在初始站。 试设计一个算法，找出让所有人尽快地全部转移到月球上的
motionEst4SS
- maltab implementation of the 4ss (forth step search) algorithm in matlab used for motion estimation.
Josephus
- 设有n个人围坐在一个圆桌周围，现从第s个人开始报数，数到第m的人出列，然后从出列的下一个人重新开始报数，数到第m的人又出列，…，如此反复直到所有的人全部出列为止。Josephus问题是：对于任意给定的n,s和m，求出按出列次序得到的n个人员的序列。-With n individuals sitting around a round table is starting from the first s individuals reported number, the number of peopl
biosignasECG
- biosignals ECG rrextract.m so forth.
2
- 2． 用循环链表解Josephus问题。设有n个人围坐在一个圆桌周围，现从第1个人开始报数，数到第m的人出列，然后从出列的下一个人重新开始报数，数到第m的人又出列，…，如此反复直到所有的人全部出列为止。Josephus问题是：对于任意给定的n和m，求出按出列次序得到的n个人员的序列-2. Josephus solution of the problem with the circulation list. With n individuals sitting around a round tab
32
- 禁止ALT-TAB切换等等 禁止ALT-TAB切换-Ban ALT-TAB to switch ban ALT-TAB to switch and so on and so on and so forth against ALT-TAB to switch
Moussa_Malab_codes
- the first code:Approximate Genetic Algorithm second code:Genetic Algorithm (GA) third code:Response Surface Methodology for Design of a PD Controller for Tanker Ship Heading Regulation forth code:optimization problem for genetic algorithms fi
ch4
- 严蔚敏《数据结构》第四章程序源码，用C实现。-Yan Wei-Min <data structure> the forth chapter program source code, using C to achieve.
RayleighFading
- Matlab Code for Rayleigh Fading channels.It output the time domain fluctuations of amplitude. True randomness not like other codes with shifts the same profile back and forth.
AnImprovedHeuristicAnt-ClusteringAlgorithm
- 本文提出了一种可以带来启发式知识指导蚂蚁在二维网格空间移动。降低移动蚂蚁的随机性，避免了产生“未分配的数据对象”。我们通过实验结果表明，这种改进的聚类启发式蚁群算法具有优越性并减少在经典算法的运行时间。-An improved heuristic ant—clustering algorithm(HAC)is presented in this paper．A device of memory bank is proposed，which can bring forth heuristic
dragonForth4458
- Dragon Forth (DF) is a powerful tool for creating applications for Palm OS of any complexity. The name Forth means fully compatibility with ANS 94 standard.
matlab_lesson_using_source_code
- matlab教案中使用到的源代码，全部源代码。很全的，包括边缘检测，去噪，二值化等等。适合图像处理的初学者参考。-matlab tutorial all the source code. Very wide, including edge detection, noise removal, binarization and so forth. Beginners reference for image processing.
Josephus
- 约瑟夫环，设有n个人围坐在一个圆桌周围，现从第s个人开始报数，数到第m的人出列，然后从出列的下一个人重新开始报数，数到第m的人又出列，…，如此反复直到所有的人全部出列为止。以n=8，s=1，m=4为例，若初始的顺序为 n1，n2，n3，n4，n5，n6，n7，n8。则问题的解为n4，n8，n5，n2，n1，n3，n7，n6。-Joseph Wan, with n individuals sitting around a round table, is reported starting from
joseph
- 约瑟夫(Joseph)问题的一种描述是:编号为1,2,..., n 的n 个人按顺 时针方向围坐一圈, 每人持有一个密码(正整数)。一开始选任一个正整数作为报数上限值m， 从第一个人开始按顺时针方向自1开始顺序报数，报到m时停止报数。报m的人出列，将它的密码作为新的m值，再从下个人开始新一轮报数，如此反复，直到剩下最后一人则为获胜者。试设计一个程序求出出列顺序。-Joseph (Joseph) a descr iption of the problem is: numbered 1,2 ,.
dog_xiaoJun
- 小军和狗一起去外婆家的题目，小狗跑得比小军快，先跑到小军外婆家后再回来迎小军，来回往复-Small army, and the dog went to grandma' s title, the dog run faster than the small army fast, first went to the small army of his grandmother and then welcome back a small army, back and forth ... ...
mian
- 办公区里到处摆放着各种各样的零食。人力资源部的调研发现，员工如果可以在自己喜欢的美食旁边工作，工作效率会大大提高。因此，公司决定进 行一次员工座位的大调整。 调整的方法如下： 1 ． 首先将办公区按照各种零食的摆放分成 N 个不同的区域。（例如：可乐区，饼干区，牛奶区等等）。 2 ． 每个员工对不同的零食区域有不同的喜好程度（喜好程度度的范围为 1 — 100 的整数， 喜好程度越大表示该员工越希望被调整到相应的零食 区域）。