列主元高斯消去法

主要用来解决0/1背包问题，实现的计算机语言是C语言，通过随机的产生物品的信息，通过此算法决定哪些物品放入背包中，哪些放弃。

应用背景最近在学习mahout,买了一本书mahout in action .从网上下载下来的书中的源码实现练习一下加深一下印象,很好的代码,很有用.传上来跟大家分享,希望对大家有帮助.关键技术 解压缩后里面有readme 安装好thrift、maven 将pom.xml中的：改成，引号里面是thrift安装位置。 将pom.xml中thrift的版本从0.6.1改成0.9.0，因为classifier.java是由0.9.0版本生成。 mvn eclipse:eclipse 此时项目上有红色感叹号，添加环境变量：M2_REPO=“你的.m2/repository的路径"即可。 在eclipse将项目import进来。 按照readme中的方法继续操作。

一个用贪心算法做的-with a greedy algorithm to do

由给出的三个点坐标，拟合出一条样条曲线，对于工程或数据分析的同志有作用。-Three points by the given coordinates, fitting out of a spline curve, or data analysis for the project has the role of comrades.

C语言程序代码中的欧姆定律示例

Learnin Mathematics with the ABACUS Activity-book part 6

石油勘探专业算法：地震资料波阻抗反演后期算法，包括带限反演算法和道积分反演算法两种-professional algorithm oil exploration : seismic data late wave impedance inversion algorithm, including band-limited anti-calculus and calculus Road-two points

The CVRP is a hard combinatorial optimisation problem. The scenario is that a set of depots contains goods to be delivered to customers by a fleet of trucks. Each customer wants a certain integer amount of goods called their demand and each truck can only carry a certain amount called its capacity. All trucks have the same capacity. The objective is to find a set of routes, one for each truck, which minimises the total distance travelled by all trucks (the  请点击左侧文件开始预览 ！预览只提供20%的代码片段，完整代码需下载后查看 加载中 侵权举报

构建哈夫曼树，并对给定的字母进行编码，还能将数字密码解码成字符串-Construction Huffman tree, as well as letters to the code, but also to decode the password string

DPCM编码的联合信源信道译码，这是一个很重要的benchmark程序-DPCM coding joint source channel decoder, which is a very important benchmark procedures