-
使用最新Visual Studio 2005所开发之简单POCKET PC 2003之YUV播放器,以REAYUV为基础,效能十分不错,包含完整VCPROJ专案...
使用最新Visual Studio 2005所开发之简单POCKET PC 2003之YUV播放器,以REAYUV为基础,效能十分不错,包含完整VCPROJ专案档-use of the latest Visual Studio 2005 development than simple Pocket PC 20 YUV"s 03 players to REAYUV basis of a very good performance, include a complete ad hoc stall VCPROJ
- 2022-08-22 22:44:48下载
- 积分:1
-
匹配滤波器
matched filter good job
- 2022-03-19 11:37:56下载
- 积分:1
-
该程序模拟了一个简单的神经元,神经networkreporting在稳定状态…
The program Neuron.c simulates a SIMPLE stable state neural networkreporting on both input and output states and energy levels after eachiteration (namely set up for 8, though usually the network stabilizes afterabout 4). The program demonstrates a very straight-forward method ofprogramming a content-addressable memory and receiving output from that memory.
- 2022-02-01 07:17:54下载
- 积分:1
-
采用IO模拟I2C
该代码是基于STM107VCT6,I2C采用IO模拟的方式访问EEPROM的例程。由于网上经常出现使用STM的硬件I2C,总是会出现问题,这个代码中是采用IO模拟的方式
- 2022-04-17 17:59:20下载
- 积分:1
-
little wai gua
用c#做的little外挂,采用vs2005制作
- 2022-03-20 10:08:13下载
- 积分:1
-
JSP连接SQL数据库的实现
JSP连接SQL数据库的实现-JSP to SQL databases to achieve
- 2022-04-29 08:28:11下载
- 积分:1
-
LAN storage tools for user
方便易用的局域网存储工具 内附所有源码 资源文件 -LAN storage tools for user-friendly resource files included all the source code
- 2022-01-30 16:43:56下载
- 积分:1
-
好的程序大家分享
好的程序大家分享- Good procedure everybody shares
- 2022-01-31 15:38:35下载
- 积分:1
-
1背包问题是NP难题。0
0-l背包问题是子集选取问题。一般情况下,0-1背包问题是NP难题。0-1背包 问题的解空间可用子集树表示。解0-1背包问题的回溯法与装载问题的回溯法十分类 似。在搜索解空间树时,只要其左儿子结点是一个可行结点,搜索就进入其左子树。当 右子树有可能包含最优解时才进入右子树搜索。否则将右子树剪去。设r是当前剩余 物品价值总和;cp是当前价值;bestp是当前最优价值。当cp+r≤bestp时,可剪去右 子树。计算右子树中解的上界的更好方法是将剩余物品依其单位重量价值排序,然后 依次装入物品,直至装不下时,再装入该物品的一部分而装满背包。由此得到的价值是 右子树中解的上界。-0-l knapsack problem is selected subset of the problem. Under normal circumstances, 0-1 knapsack problem is NP-hard. 0-1 knapsack problem the solution space available subset of the tree said. Xie 0-1 knapsack problem with the law retroactively loading the retroactive law very similar. The search solution space trees, as long as their son left node is a viable nodes, the search entered its left subtree. When the right subtree is the optimal solution may contain only son into the right tree search. It will cut right subtrees. Suppose that r is the total value of the remaining items; Cp is the current value; Bestp is currently the best value. When cp r bestp, they can cut right subtrees. Calculation right
- 2022-03-25 00:00:51下载
- 积分:1
-
WinForm学生管理系统(三层架构)
学生管理系统,运用了三层架构,对学生的一些相关情况进行增删改查 里面还有教师模块,教师管理的相关信息,里面还有Sql SERVER 的数据库,版本是2008R2的,具体的内容你可以自己去看,仅供参考学习使用。
- 2022-03-25 08:46:57下载
- 积分:1