-
0_1背包问题使用一个给定n种去的动态规划解法…
0_1背包问题用动态规划解给定n种物品和一背包。物品i的重量是wi,其价值为vi,背包的容量为c。问应如何选择装入背包中的物品,使得装入背包中物品的总价值最大?
在选择装入背包的物品时,对每种物品i只有两种选择,即装入背包或不装入背包。不能将物品i装入背包多次,也不能只装入部分的物品i。因此,该问题称为0-1背包问题。-0_1 knapsack problem using dynamic programming solution of a given n types of goods and one backpack. Item i is the weight of wi, the value for vi, knapsack capacity c. Question should be how to choose the items into the backpack, the backpack into the total value of the largest items? In the selection of the items into the backpack, for each of the items i have only two choices, that is loaded or not loaded backpack backpack. Items should not be many times i load backpack can not only part of the goods loaded i. Therefore, the problem known as the 0-1 knapsack problem.
- 2023-04-12 03:25:02下载
- 积分:1
-
将任何一个exe文件压缩,压缩后生成的文件为windows执行文件
将任何一个exe文件压缩,压缩后生成的文件为windows执行文件-Compress any exe file, and transfer it to a windows executeable file after compressing
- 2022-03-23 01:49:03下载
- 积分:1
-
实现哈夫曼的编码和译码,适用于各种图像格式。
实现哈夫曼的编码和译码,适用于各种图像格式。-Realize Huffman encoding and decoding for a variety of image formats.
- 2022-06-30 08:07:50下载
- 积分:1
-
zip解压源码.
zip解压源码.-zip unpacked source.
- 2022-01-25 14:06:25下载
- 积分:1
-
多功能八路抢答器,具有时间设置,调整,复位,暂停等功能(包含Proteus仿真电路图)
多功能八路抢答器,具有时间设置,调整,复位,暂停等功能(包含Proteus仿真电路图)-Answer multi-function eight-way, and time settings, adjust, reset, pause and other functions (including Proteus simulation circuit diagram)
- 2022-03-26 04:23:18下载
- 积分:1
-
这是一个基于matlab的图像匹配算法,通过先后两帧中相同的部位,在前一帧中搜索协方差最大的匹配点。...
这是一个基于matlab的图像匹配算法,通过先后两帧中相同的部位,在前一帧中搜索协方差最大的匹配点。-This is a matlab-based image matching algorithm has the same two parts, a former search the largest covariance matching points.
- 2023-03-20 12:15:04下载
- 积分:1
-
LLM fast algorithm
LLM快速算法
- 2022-10-17 00:40:02下载
- 积分:1
-
This scheme is initiated by Ziv and Lempel [1]. A slightly modified version is d...
This scheme is initiated by Ziv and Lempel [1]. A slightly modified version is described by Storer and Szymanski [2]. An implementation using a binary tree is proposed by Bell [3]. The algorithm is quite simple: Keep a ring buffer, which initially contains "space" characters only. Read several letters from the file to the buffer. Then search the buffer for the longest string that matches the letters just read, and send its length and position in the buffer.
- 2022-10-29 01:55:05下载
- 积分:1
-
c++初学者用来练习的程序实例,从简单到复杂,有详细的说明文档!...
c++初学者用来练习的程序实例,从简单到复杂,有详细的说明文档!-c++ for beginners to practice procedures for instance, from simple to complex, contains a detailed description of the document!
- 2022-05-10 18:36:45下载
- 积分:1
-
huffman压缩算法,c语言编写。可下下来参考
huffman压缩算法,c语言编写。可下下来参考-Huffman compression algorithm, c language. Reference may be down under
- 2023-06-28 21:15:03下载
- 积分:1