Multi

0_1背包问题,回溯法解背包问题 0-l背包问题是子集选取问题。一般情况下，0-1背包问题是NP难题。0-1背包 问题的解空间可用子集树表示。解0-1背包问题的回溯法与装载问题的回溯法十分类 似。在搜索解空间树时，只要其左儿子结点是一个可行结点，搜索就进入其左子树。当 右子树有可能包含最优解时才进入右子树搜索。否则将右子树剪去。设r是当前剩余 物品价值总和；cp是当前价值；bestp是当前最优价值。当cp+r≤bestp时，可剪去右 子树。计算右子树中解的上界的更好方法是将剩余物品依其单位重量价值排序，然后 依次装入物品，直至装不下时，再装入该物品的一

visual c++编程技术，介绍编程中的技巧。建议初学者学习参考。-visual programming technology, programming skills. Study recommends beginners reference.

系统集成工作规范范本-standardize the work of system integration model

Real-Time Digital Signal Processing Implementations and Applications Second Edition。实时数字信号处理，非常好。-Real-Time Digital Signal Processing Impl ementations and Applications Second Edition. Real-time digital signal processing, very good.

Rational Rose data model reference

应用随机过程教程及在算法和智能计算中的随机模型，清华大学出版社，龚光鲁，钱敏平著。-Tutorial and the application of random process algorithm and intelligent computing of the stochastic model, Tsinghua University Press, Gong Lu, Qian Min-Ping book.

canegie book ssd5 for C++ programming about STL-canegie book ssd5 for C programming about S TL

Tai lieu CCNA tieng viet

GPS专业词汇与学习-GPS professional vocabulary and learning

邵贝贝翻译的美国J.J的关于UC/OS――II的最权威的书籍，详细的介绍了UC/OS_II及其移植方法。-Shao Beibei American JJ translation on UC/OS- II of the most authoritative books, the detailed introduction of the UC/OS_II and transplantation methods.