资源列表
admq(1)
- 用来计算光子晶体能带结构的程序，用fortran编写，效果不错。-photonic crystals used to calculate the band structure of the program, FORTRAN prepared effectiveness.
CODE_UPLOAD29461192000
- SPLASH is a c++ class library that implements many of the Perl constructs and data types, including extensive regex regular expression pattern matching. For those not familiar with Perl, it is an excellent scr ipting language by Larry Wall and is ava
adlu.tar
- 计算光子晶体能带的程序，用fortran语言编写！好用！-photonic crystals can be calculated with the procedure, using FORTRAN language! Easy!
svm_v0.55beta
- 最新的支持向量机工具箱，有了它会很方便 1. Find time to write a proper list of things to do! 2. Documentation. 3. Support Vector Regression. 4. Automated model selection. REFERENCES ========== [1] V.N. Vapnik, \"The Nature of Statistical Learning Theory\", Springer-Verl
onyx_doc.tar
- order发计算光子晶体的能带结构，比较好-order issued calculation of photonic crystal band structure, good! !
ogl_benchmark_sphere
- 一个VC编写的显示地球小程序员,可随鼠标移动转动-a show prepared by the Earth small programmers, with the rotational mobile mouse
超松弛迭代法
- 还可以，能够加快迭代的计算速度，大家用一下-can to accelerate the iterative calculation speed, we spent about
粒子群算法程序
- 粒子群算法程序集,应用于粒子优化处理!最新的算法.-PSO algorithm set, optimized for particle! The latest algorithm.
HeapSort
- 实现heap排序的算法，首先把Heap建立起来，然后通过对Heap的根节点来找出当前最小的节点，依次就可以实现排序了。-achieve heap sorting algorithm to first establish Run, then Run right through the current nodes to identify the smallest nodes can be followed to achieve the ranking.
Matrix_Chain
- 求解矩阵链相乘的问题，通过动态规划的方法，来求解该问题，使得矩阵链的相乘的运算最少。-chain matrix multiplication to solve the problem through dynamic programming methods to solve the problem, making the chain matrix multiplication operator at least.
ClosestPairPoint
- 实现查找一组给定点中的最近点对，通过分治方法将问题求解，简化问题的复杂性。-Lookup a group to the latest sentinel points right, adoption of the partition method of problem solving, simplifying the complexity of the problem.
KruskalAlgorithm
- 本文件主要完成Kruskal算法。本文件包括三个类，分别是顶点类、边类和Kruskal类。-The document completed Kruskal algorithm. This document consists of three categories, namely category vertex, edge type and Kruskal category.