-
Summary Non
简易非抢先式实时多任务操作系统的设计与应用-Summary Non-preemptive multi-tasking real-time operating system design and application
- 2022-12-21 13:05:03下载
- 积分:1
-
java参考大全讲了java语言库,技术以及应用,还有关于注释方面的规范。...
java参考大全讲了java语言库,技术以及应用,还有关于注释方面的规范。-java reference java spoke volumes of the language, technology and applications, but also on the Notes norms.
- 2022-12-11 17:50:04下载
- 积分:1
-
" The Beauty of Programming," With the source code for the book (Part I...
《编程之美》随书源代码(第三部分)第3章
结构之法――字符串及链表的探索
-" The Beauty of Programming," With the source code for the book (Part III) Chapter 3 Structure of France- the string and the list of exploration
- 2022-07-07 10:35:47下载
- 积分:1
-
statistic算法
statistic算法-statistic algorithm
- 2023-05-25 03:30:03下载
- 积分:1
-
you need to be familiar with the customary and effective
ways to structure you...
you need to be familiar with the customary and effective
ways to structure your code. Books about programming languages often cover
only the first two, or discuss usage only spottily. Maybe that’s because the first
two are in some ways easier to write about.This book addresses your need: customary and effective usage.-Prentice.Hall.Effective.Java.2nd.Edition.May.2008.3000th.Release
- 2022-02-04 16:28:56下载
- 积分:1
-
计算方法之均方差的算法
计算方法之均方差的算法-method of calculating the standard deviation algorithm
- 2023-01-30 09:25:04下载
- 积分:1
-
着重描述了如何在VC++下运行X264代码,并且介绍了运行过程中常见的问题及解决办法。...
着重描述了如何在VC++下运行X264代码,并且介绍了运行过程中常见的问题及解决办法。-Focused on describing how to run the X264 under VC++ code, and describes the operation process of the common problems and solutions.
- 2023-07-11 12:40:03下载
- 积分:1
-
用C语言设计数字信号处理算法的实现…
用C语言来实现数字信号处理的方法设计的算法 -Using C language to the realization of digital signal processing algorithms designed
- 2022-03-30 00:09:06下载
- 积分:1
-
背包问题动态规划算法JAVA
给定n种物品和一背包。物品i的重量是wi,其价值为vi,背包的容量为c。问应如何选择装入背包中的物品,使得装入背包中物品的总价...
背包问题动态规划算法JAVA
给定n种物品和一背包。物品i的重量是wi,其价值为vi,背包的容量为c。问应如何选择装入背包中的物品,使得装入背包中物品的总价值最大?
在选择装入背包的物品时,对每种物品i只有两种选择,即装入背包或不装入背包。不能将物品i装入背包多次,也不能只装入部分的物品i。因此,该问题称为0-1背包问题。-Knapsack problem dynamic programming algorithm for a given n species JAVA 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-22 23:20:03下载
- 积分:1
-
:[2005最新C++经典著作].Addison.Wesley.
:[2005最新C++经典著作].Addison.Wesley.-.Effective.C++,.2nd.ed.and.More.Effective.C++ (【注】:采用网页浏览模式) -: [2005 C latest classics]. Effective Addison.Wesley .-. . C, .2 nd.ed.and.More.Effective.C ([Note] : using web browsing mode)
- 2022-02-18 15:03:54下载
- 积分:1