Search - 0-1 bag

Search - 0-1 bag - List

[Other resource] bag DL : 0: 在0 / 1背包问题中，需对容量为c 的背包进行装载。从n 个物品中选取装入背包的物品，每件物品i 的重量为wi ，价值为pi 。对于可行的背包装载，背包中物品的总重量不能超过背包的容量，最佳装载是指所装入的物品价值最高，即p1*x1+p2*x1+...+pi*xi(其1<=i<=n，x取0或1，取1表示选取物品i) 取得最大值。
Update : 2008-10-13 Size : 1.5kb Publisher : 宋鑫坤
[Special Effects] bag-0.1.6.tar DL : 0: 快速高效的图像分类器， Bag of features: A simple bag of features classifier. 作者:Andrea Vedaldi
Update : 2008-10-13 Size : 19.92kb Publisher : 罗彤
[SCM] Easy 51Pro v2.0简易编程器 DL : 0: 功能强大的51编程器，文件包里有PC机程序、编程程序和硬件电路。-powerful 51 programmer, a paper bag of PC and programming procedures and hardware circuit.
Update : 2025-02-17 Size : 1.3mb Publisher : 张城
[Special Effects] bag-0.1.6.tar DL : 0: 快速高效的图像分类器， Bag of features: A simple bag of features classifier. 作者:Andrea Vedaldi -Fast and efficient image classifier, Bag of features: A simple bag of features classifier. Author: Andrea Vedaldi
Update : 2025-02-17 Size : 20kb Publisher : 罗彤
[JSP] equinox-1.0 DL : 0: Spring的注入模式（一）这个压缩包里包括的教程: Manning_-_Spring_in_Action Spring_Live1-11 spring-reference SpringGuide-Spring injection mode (1) The compression bag, including the tutorial: Manning_-_Spring_in_ActionSpring_Live1-11spring-referenceSpringGuide
Update : 2025-02-17 Size : 5.57mb Publisher : 徐辉
[3D Graphic] Medical2 DL : 0: VTK三维医学实现，一个简单的例子，主要是从VTK开发包里修改的来的。-VTK medical realize three-dimensional, a simple example, primarily from the VTK development changes to the bag.
Update : 2025-02-17 Size : 14kb Publisher : 杨风
[OS program] bag DL : 0: 分支限界法解决0/1背包问题，用c++的优先队列方法-Branch and bound method to solve 0/1 knapsack problem, using c++ Priority queue method
Update : 2025-02-17 Size : 12kb Publisher : 林培文
[Editor] PhysX_2.8.1 DL : 0: PhysX为重要的物理引擎，压缩包里为安装文件及SDK-Important PhysX physics engine, compression bag for the installation files and SDK
Update : 2025-02-17 Size : 57.36mb Publisher : 杨浩淼
[Graph program] bag-words-demo DL : 0: 自李菲菲提出bag of words 这个想法以来，借助于该思路的各种算法层出不穷，也表现非常不错的性能。该文件是在其人的tutorial上提供的一个Demo，有非常详细的注释，希望能给大家带来帮助-Since the LI Fei-made bag of words this idea since the idea of the various algorithms by means of an endless stream, but also doing a very good performance. This file is in its people' s tutorial available on a Demo, with very detailed notes, want to give us some help
Update : 2025-02-17 Size : 601kb Publisher : 张俊格
[Graph Recognize] bag-of-words DL : 0: bag-of-words by R. Fergus, L. Fei-Fei and A. Torralba
Update : 2025-02-17 Size : 2.44mb Publisher : luwenhao
[OS program] bags DL : 0: 四种算法（动态规划、回溯法、分支限界法、贪心法）实现0-1背包问题-four algorithms including dynamic planningm,tracing,branch and bound method and greedy to implement 0-1 bag problem.
Update : 2025-02-17 Size : 6.87mb Publisher : 王赛
[Special Effects] bag-0.1.1.tar DL : 0: bag of feature bag of feature bag of feature-bag of feature bag of feature bag of feature bag of feature
Update : 2025-02-17 Size : 15kb Publisher : 黄泽铧
[Special Effects] bag-0.1.tar DL : 0: bag of feature bag of feature bag of feature bag of feature bag of feature -bag of feature bag of feature bag of feature bag of feature bag of feature bag of feature bag of feature bag of feature bag of feature bag of feature
Update : 2025-02-17 Size : 14kb Publisher : adai
[Algorithm] bag-C-Algorithm DL : 0: 背包问题系列算法详解背包问题是一个关于最优解的经典问题。通常被讨论的最多的，最经典的背包问题是0-1背包问题(0-1 Knapsack Problem)。它是一切背包问题及相关背包问题的基础。本篇博文将详细分析0-1背包问题，并给出0-1背包问题的几种解法，同时也对0-1背包问题的内涵进行延伸，丰富其外延至完全背包问题和多重背包问题，并给出背包问题的算法实现过程，希望对大家有帮助。-Detailed Algorithm for Knapsack Problem Series
Update : 2025-02-17 Size : 5kb Publisher : 唐永笙
[Mathimatics-Numerical algorithms] 0-1_bag_problem DL : 0: 0-1背包问题的动态规划解法，C++源码，并附有详细的实验报告-0-1 bag problem
Update : 2025-02-17 Size : 888kb Publisher : Zhang Ting
[Data structs] beibao DL : 0: 0-1背包问题：给定n种物品和一个背包，物品i的重量是Wi，物品i价值为Vi，背包的容量为C。应如何选择装入背包的物品，使得装入背包中物品的总价值最大? 在选择装入背包的物品时，对每种物品i只有两种选择，即装入背包为1或不装入背包为0。不能将物品i装入背包多次，也不能只装入部分的物品i。0-1背包问题的主要特点是在选择物品i装入背包时，每种物品仅有一件，可以选择放或不放-0-1 knapsack problem: Given n types of items and a backpack, the weight of item i is Wi, the value of goods i Vi, backpack with a capacity of C. How to choose the items into the bag, making the backpack into the largest total value of goods? In the selection of the articles into the bag, the only two choices for each item i, that is loaded or not loaded backpack as a backpack 0. Items backpack i can not load times, can not just load some of the items i. The main features of the 0-1 knapsack problem is to choose items i loaded backpack, only one of each item, you can select the place or hold
Update : 2025-02-17 Size : 1kb Publisher : 丁佩
[Data structs] bag DL : 0: 介绍了0-1背包问题的求解，并用贪心算法解决了背包问题-Introduced to solve 0-1 knapsack problem and solved with the greedy algorithm knapsack problem
Update : 2025-02-17 Size : 169kb Publisher : liuchuanhong
[Data structs] 0-1-bag-problem DL : 0: 一种算法来解决0-1背包问题，这是非常好的-one arithmetic to solve 0-1 bag problem
Update : 2025-02-17 Size : 1kb Publisher : 郭泓良
[Other] bag DL : 0: 非常经典的0-1背包问题采用贪心算法实现-Very classical 0-1 knapsack problem using greedy algorithm
Update : 2025-02-17 Size : 5kb Publisher : 许文韬
[Delphi VCL] EhLib 9.0 Full Source DL : 0: 大家都明白的！一个很好用的控件包！特别是DBGridEH控件！(Everybody knows! A nice control bag! Especially the DBGridEH control!)
Update : 2025-02-17 Size : 22.2mb Publisher : 无名人氏

« 12 3 4 5 6 7 8 9 10 ... 34 »