资源列表
c2
- 计算斐波那契（Fibonacci）数列的第n项函数fib（n）-Write Fibonacci calculation (Fibonacci) sequence of the first n terms function fib (n)
c4
- 装箱问题 问题描述：装箱问题可简述如下：设有编号为0、1、…、n-1的n种物品，体积分别为v0、v1、…、vn-1。将这n种物品装到容量都为V的若干箱子里。约定这n种物品的体积均不超过V，即对于0≤i＜n，有0＜vi≤V。不同的装箱方案所需要的箱子数目可能不同。装箱问题要求使装尽这n种物品的箱子数要少-Packing problem Problem Descr iption: Packing problem can be summarized as follows: with numbe
3
- 这个是NP问题的PPT,内容丰富,讲解到位,经典的算法学习资料.-This problem is NP PPT, rich in content, to explain the place, the classical algorithm learning materials.
yiqunxitong
- 蚁群算法开发tsp问题，可运行。已经修改-Ant colony algorithm development tsp problem, run. Has been modified
gaositouyingzhengfansuan
- 高斯投影正反算，在可是椭球基础上运算，测绘工程专业课程设计。-Gauss considered positive and negative projection, but ellipsoid, based on the calculations, surveying and mapping engineering curriculum design.
shicexejuhuapingju
- 实测斜距化算至高斯平面边长c语言源程序，大地测量学课程实习编程。-Measured slant range of the operator to the Gaussian plane side length c language source code, programming internship course Geodesy.
dadizhutijiesuan
- 大地主题正反算，测绘工程专业大地测量课程实习编程，参考使用。-Considered positive and negative earth theme, geodetic surveying and mapping engineering internship program programming reference.
zkj
- 面对模式分析、数据挖掘中海量数据,降维算法已经成为科学研究人员最为 强有力的工具.对降维算法的研究具有很高的学术价值和应用潜力.本文较为详 细的回顾了现有的降维算法,以及他们在模式分析中的应用.在此基础上,着眼于 提高嵌入空间的不同类别的样本之间的距离,我们提出了两种有监督情形下的流 形学习算法.模拟和实际数据都显示了有监督流形学习算法的良好的性能.-Face pattern analysis, data mining massive data, dimension reduct
pso-clustering
- 在聚类基础之上使用pso优化算法性能，提升聚类效果。-In the clustering algorithm based on optimization using pso performance, improve clustering results.
human-brain-interface
- s software running on computer, mental activities of human brain may entry a dead loop too. Computer-brain interfaces give computers special channels to detect and interfere to interrupt unwanted thoughts which induce unpleasant intrusive
accurate-time
- 一种精确时钟同步协议的最佳主时钟算法，实现网络的高度精确校时-An accurate clock synchronization protocol best master clock algorithm, to achieve highly accurate timing network
snippet
- 简单的分治方法查找数字的例子，算法课程的作业。-Simple divide and conquer method to find the number of examples, algorithms course work.