搜索资源列表
bagprogram
- 用动态规划来解0-1背包问题的算法思想及程序代码-use dynamic programming solution to the 0-1 knapsack problem algorithms and code thinking
asdfsdf
- 计算方法中用追赶法解方程的C++代码源程序-calculation method used to catch up with the solution to the equation C source code
用PWS建立自己的Web服务器
- PWS就是Personal Web Server的缩写,字面意思就是个人网页服务器。这是微软公司为解决个人信息共享和Web开发需要而设计开发的-PWS Personal Web Server is the acronym literally personal Web server. This is Microsoft's solution for sharing personal information and Web development needs of the design an
Euler_Taylor
- Euler解常微分方程,Taylor解常微分方程,追赶法求解三对角方程-Euler solutions ordinary differential equations, differential equations solution Taylor, catching up with the method three pairs Kok equation
ConsoleJava
- DotNet版的线性方程的解法,包括:高斯消元法,用于n阶非奇异矩阵;SVD分解法,求最小二乘解.目前还很难找到免费的DotNet版的数值计算程序.这里有源码(J#)和dll文件.-Kind version of the linear equation solution, including : Gaussian Elimination Act, for order n nonsingular matrix; SVD decomposition method, least squares sol
DotMatrix
- DotNet版的线性方程的解法,包括:高斯消元法,用于n阶非奇异矩阵;SVD分解法,求最小二乘解.目前还很难找到免费的DotNet版的数值计算程序.这里有源码(J#)和dll文件.-Kind version of the linear equation solution, including : Gaussian Elimination Act, for order n nonsingular matrix; SVD decomposition method, least squares sol
tanxinfangfa
- 贪心方法是一种改进了的分级处理方法。它首先根据题意,选取一种量度标准。然后按这种量度标准对这n个输入排序,并按排序一次输入一个量。如果这个输入和当前已构成在这种量度意义下的部分最优解加在一起不能产生一个可行解,则不把此解输入加到这部分解中。这种能够得到某种度量意义下的最优解的分级处理方法称为贪心方法。-greedy method is an improvement of the classification methods. According to its first title Italy,
FlexCompress.Component.v2.69
- FlexCompress is a high-speed compression library developed to provide archive functionality for your applications. This solution provides flexible compression and strong encryption algorithms that allows you to integrate archiving or backup
superlu_mt_1.0.tar
- 可以用在并行计算中的代码,支持稀疏矩阵的LU分解,用来求方程组的解-can be used in parallel computing code, sparse matrix support the LU decomposition, used for the solution of the equations
superlu_dist_2.0.tar
- LU分解求解矩阵方程组的解,最新版本,快速求解稀疏矩阵-LU decomposition of the matrix equation solution, the latest version, sparse matrix Quick Solution
superlu_3.0.tar
- LU矩阵分解单机版最新版本,用于快速求解稀疏矩阵组成的方程组的解-LU decomposition matrix version of the latest stand-alone version for fast sparse matrix solution of the solution of the equations
datuoyuanjuli
- 这是大地主题解算时求解大地距离的大椭圆距离的程序实现,用到的头文件我将同时上传-This is the theme of the earth Solution Solving the earth at the distance from the Oval Program, to use the header files, I will also upload
AntColonySystemTSP
- 这是用Ant Colony System 解决tsp问题的C++源码 希望对大家研究蚂蚁算法有所帮助-This is used Ant Colony System solution tsp C source of hope for all research Ant Algorithm help
RecruitingAntColonySystemTSP
- 这是用RecruitingAntColonySystem 解决tsp问题的C++源码 希望对大家研究蚂蚁算法有所帮助-RecruitingAntColonySystem this is the solution tsp C source code you want to study ants help Algorithm
FLTt
- 算符优先算法中非终结符的firstvt集和lastvt集的求解,在vc6.0环境下编译通过-operator priority algorithm end of the Central African websites firstvt sets and lastvt Solution Set, in vc6.0 compile environment
zhuangpeixian
- 该程序是一个动态规划法解决装配线调度问题的小程序,是用C++做的。-the program is a dynamic programming solution to the assembly line scheduling small programs, is to use C to do.
0-1wenti
- 该程序是一个用动态规划法解决0-1背包问题的小程序,可以为学习动态规划法遇到困难的同学提供帮助-the program is a dynamic programming solution 0-1 knapsack problem of small procedures, to study the dynamic programming method difficulties encountered by students for help
20050917192634_refresh
- 一个用双缓冲解决闪烁问题的程序源码 用双缓冲解决闪烁问题的例子。-a double-buffer solution Flicker procedures source in double buffer solution Flicker example.
circlecutting
- 集装箱的装箱问题 给定一个集装箱,其长为L,宽为W和高为H,现有一批圆柱形木材,每根木材的长均为L,但是半径不同,设第i根木材半径为ri。问如何装箱,使得集装箱的空间利用率最高? 本程序要求用贪心算法解决: 贪心算法总是作出在当前看来是最好的选择。也就是说,不从整体最优上加以考虑,它所做出的仅是在某种意义上的局部最优解。 -problem given a container, its long-L, width W and H for high, the existing bat
myknapsack
- a) 0-1背包问题采用的是动态规划法,该算法思想简介如下: 有些问题常常没有办法把它们分成较小数目的子问题,在这种情况下,可以试着把问题分成必要多的子问题,每个子问题又可以分成数目不确定的必要多的子子问题,这样就会产生大量的子问题。如果分得的子问题界限不清,互相交叉,则在大量的子问题中会存在一些完全相同的子问题,因而在解这类问题时,将可能重复多次解同一个子问题。这种重复当然是不必要的,避免的方法可以在解决一个子问题后把它的解(包括其子子问题的解)保留下来,若遇到求解与之相同的子问题的时候,