搜索资源列表
01背包算法
- 一个简单的01背包算法，物品数量限制在10以内。-a simple 01 backpack algorithm, the number of items within the limit of 10.
octane-1.01.20-src
- Octane v1.01.20 The Open Compression Toolkit for C++ . The Open Compression Toolkit is a set of modular C++ classes and utilities for implementing and testing compression algorithms. Simple interface and skeleton code for creating new compre
01
- 01背包问题的经典实现。在VC6下面调试通过。学习算法的朋友可以借鉴一下
Solving.the.01.Knapsack.Problem.with.Genetic.Algor
- 遗传算法求解01背包问题＋实验报告＋参考文献。如果你看了这个程序还是不能明白遗传算法的巧妙，那么还是不要再看这个问题了。
01beibao.rar
- 01背包问题，里面有四种算法，分别为动态规划，分支限定发，回溯法和谈新算法！,01 knapsack problem, there are four kinds of algorithms, dynamic programming, respectively, branch limit hair, the new algorithm backtracking peace!
finite_element_toolbox_v2.01
- matlab工具箱,使用有限元计算ODEs(常微分), PDEs(偏微分),BVPs(边值问题),包括一维,二维,三维.(Matlab Finite Element toolbox,version2.01)-This is a toolbox for computing ODEs or PDEs in BVPs using FEM in 1D, 2D and 3D
proj07-01
- 试验中使用模拟退火算法寻找一6-单元网络能量最小化的模型。模拟退火算法是模拟物理学上的退火技术。其优势在于有可能使系统从局部极小值跳出。-Simulated annealing algorithm used in the experiments to find a 6- unit network model of energy minimization. Simulated annealing algorithm simulates the physics of annealing. The a
0-1Knapsack.problem
- Knapsack problemnew01背包问题（动态规划） 01背包实验报告-Knapsack problemnew01 knapsack problem (dynamic programming) 01 backpack Experimental Report
test-data-for-01-knapscap-problem
- 这个是用于01背包问题的测试数据，很多论文都用这其中的数据集来测试-This is a knapsack problem for the 01 test data, a lot of papers with which the data set to test
Seq_Outof_FastaV2.01
- 可以直接从fasta格式的文件中读取氨基酸序列或者碱基序列，方便matlab读取-Directly from the FASTA file format to read the amino acid sequence or base sequence, to facilitate reading matlab
capi-0.01.tar
- < 多任务下的数据结构与算法>>一书的配套源代码，含有链表、哈希表、红黑树、AVL树、复合二叉树、无碎片内存管理、垃圾内存管理、多任务遍历等源代码-" " Multi-tasking data structures and algorithms under the " " a book supporting the source code, containing lists, hash tables, red-black tree, AVL
RANSAC_Beta_v0.01
- ransac是常用的稳健计算机视觉的方法，可用于两幅影像的配准。这是使用C++实现的RANSAC-This is an C++ Implementation for RANSAC
pack_of_four_algorithms
- 01背包四种算法实现:动态规划法,分支限定法,回溯法,贪心算法-01 pack of four algorithms: dynamic programming, branch limit method, backtracking, greedy algorithm
proj10-01
- 在试验中编写程序实现了K均值聚类算法,K均值聚类的原理是：在训练样本中找到C个聚类中心，每个聚类中心代表一个类的中心。然后将样本归类到与其最近的聚类中心的那一类。 C的选择是通过先验知识或经验选取的。聚类中心是通过算法迭代求得的。-In the test preparation process to achieve a K means clustering algorithm, K means clustering principle is: in the training samples to
proj11-01
- 数字图像处理：图像骨架化的程序，实验中骨架化的原理为中轴转化方法-Digital Image Processing: Image skeleton of the program, the principle of the experiment for the axial skeleton of Transformation
gpstoolbox3.01
- gps的matlab仿真工具包version3.01，函数和处理方法非常全，不错的gps开发仿真工具-gps the matlab simulation toolkit version3.01, function and processing method is very full, good development of simulation tools gps
01
- c++利用回溯法来实现01背包问题 阶段是：在前N件物品中，选取若干件物品放入背包中； 状态是：在前N件物品中，选取若干件物品放入所剩空间为W的背包中的所能获得的最大价值； 决策是：第N件物品放或者不放； -c++ using backtracking to achieve the 01 knapsack problem Stage: the first N items, select the number of items into the backpack status
QUBIT4MATLAB4.01
- 量子计算的matlab例程：QUBIT4MATLAB4.01-Quantum computing matlab routines: QUBIT4MATLAB4.01
01-knapsack-problem--
- 01背包问题的优先队列式分支限界算法程序实现-01 knapsack problem with priority queues to achieve branch and bound algorithm program
01
- 01背包问题，利用的是动态规划的思想，不是改进的01背包算法-01 knapsack problem, the use of dynamic programming is the idea, not the 01 knapsack algorithm to improve