-
rtsp_for_VC
很好的RTSP实现，分享给大家使用，已经建有VC工程(Good RTSP implementation, we used to share)
- 2010-12-23 17:17:47下载
- 积分：1
-
Pattern-recognition
《模式识别》，是本人用matlab语言编程来实现贝叶斯分类器的设计(" Pattern recognition" is a programming language I use matlab to implement Bayesian classifier design)
- 2011-11-24 20:29:41下载
- 积分：1
-
地图的一些基本操作，例如，放大，缩小。平移。全图等等。...
地图的一些基本操作，例如，放大，缩小。平移。全图等等。-maps of some of the basic operations, for example, zoom in and out. Translation. So on the whole map.
- 2022-08-13 14:48:56下载
- 积分：1
-
vxworks组件配置
说明： 实时操作系统经典之作，可以从头学习一下。(The classic real-time operating system can be learned from scratch.)
- 2020-06-17 21:00:07下载
- 积分：1
-
5th
基于linux下的s3c2410按键驱动和测试程序(S3c2410 based on key drivers under linux and test procedures)
- 2011-10-24 19:59:50下载
- 积分：1
-
12-01bag
01背包问题
问题陈述：给定n种物品和一背包，物品i的重量是wi，其价值为vi，背包的容量为C。合理选择物品装入背包，使得装入背包中物品的总价值最大。在选择装入背包的物品时，对每种物品i只有两种选择，即装入背包或不装入背包。不能将物品i装入背包多次，也不能只装入部分的物品i。
问题分析：0 1背包问题是一个子集选取问题，适合于用子集树表示0 1背包问题的解空间。在搜索解空间树时，只要其左儿子结点是一个可行结点，搜索就进入左子树，在右子树中有可能包含最优解时才进入右子树搜索；否则将右子树剪去。
(01 knapsack problem problem statement: given n kinds of items, and a backpack, the weight of the items i wi, the value of vi, backpack capacity C. Reasonable choice items into a backpack, making the total value of the items loaded backpack. Each item i select items loaded backpack, there are only two choices that loaded backpack or loaded backpack. Items i can not be loaded into a backpack many times not only loaded items i. The problem analysis: 01 knapsack problem is a selected subset of the problem and suitable for the tree represents a subset of the solution space of 01 knapsack problem. Search solution space tree, as long as its left son node is a feasible node, the search into the left subtree, right subtree may contain only into the right subtree search the optimal solution Otherwise, the right subtree cut.)
- 2012-12-29 10:58:56下载
- 积分：1
-
train2014
example of train roller coaster
- 2020-09-07 14:18:05下载
- 积分：1
-
Douglas-Peucker
道格拉斯-普克算法 (Douglas– Peucker algorithm，亦称为拉默-道格拉斯-普克算法、迭代适应点算法、分裂与合并算法)是将曲线近似表示为一系列点，并减少点的数量的一种算法。它的优点是具有平移和旋转不变性，给定曲线与阈值后，抽样结果一定。(The Douglas - puke algorithm (Douglas - Peucker algorithm, also called the lamer - Douglas - puke algorithm, iterative adaptive point algorithm, split and merge algorithm) is an algorithm that approximatively represents a curve as a series of points and reduces the number of points. It has the advantages of translation and rotation invariance. After a given curve and threshold, the sampling result is certain.)
- 2018-06-17 09:01:45下载
- 积分：1
-
AVR-freq-meter
AVR frequency meter with Proteus model
- 2015-10-07 16:05:17下载
- 积分：1
-
STM32F103C8T6_HJCXB
说明： stm32f103开发实例,程序完整，编译通过，(Development example of STM32F103)
- 2020-05-20 10:34:51下载
- 积分：1
