搜索资源列表
my0-1knapsack
- 给定n 个物品, 物品i重为wi 并且价值为 vi ，背包所能承载的最大容量为 W. 0-1 背包问题即是选择含有着最大总价值的物品的子集且它的容量 ≤W ． 用动态规划实现-given n goods, items i weight of wi and value of vi, the backpack can carry a maximum capacity of W. 0-1 knapsack problem that is a choice with a maximum tot
BFSandDFS
- 用C写的源程序功能分别是1.用DFS算法判断有向图中是否有环2.从文件中读图，用邻接链表保存信息，寻找两个结点vi,vj间的最短路径-written in C source is a function respectively. DFS algorithm used to determine whether there are plans Central 2. Interpret drawings from the file, use the adjacent Chain preservatio
数据结构算法与应用-C++语言描述789章
- 这个是C++常用数据算法的第789章,前六章已经再前面传过了,后面还有几章.-this data is commonly used algorithm C of Chapter 789, the former VI has again came across the front and there are several chapters.
图论算法库 C++ 语言实现
- 图论算法库 C++ 语言实现 代码内容 图论算法库，包括以下算法： 单源最短路径 Dijkstra 算法 单源最短路径 Bellman-Ford 算法 最小生成树 Prim 算法 每对节点间最短路径 Flod-Warshall 算法 语言 C++ 编译平台 VisualAge C++ 4.0 作者 starfish (starfish.h@china.com) 备注 程序用C++语言编写，在VisualAge C++ 4.0下调试通过。压
0_1question
- 计算机算法中著名的0_1背包问题：给定n种物品和一背包。物品i的重量是Wi，其价值为Vi，背包的容量是c，问应如何选择装入背包中的物品，使得装入背包中物品的总价值最大。-computer algorithm famous 0_1 knapsack problem : given n product and a backpack. I articles of the weight of Wi, the value of Vi and backpack is the capacity c, aske
Vblast
- vblast simulation for spatial multiplexing -vblast simulation for spatial multiplexi Vi
Iteration_Image_Jacobian_robot_kalman
- Kalman Example for robotics Visual Servoing-Kalman Example for robotics Visual Servoi Vi
RaoBlackwellisedParticleFilteringforDynamicConditi
- The software implements particle filtering and Rao Blackwellised particle filtering for conditionally Gaussian Models. The RB algorithm can be interpreted as an efficient stochastic mixture of Kalman filters. The software also includes efficient stat
lamb_problem
- Lamb problem: The analytical solution of vertical point source. This is very important for synthetic modeling-Lamb problem : The analytical solution of vertical point sour ce. This is very important for synthetic modeli Vi
c++builder06
- 数据结构的c++实现,源代码全部在C++builder中运行.第六部分-data structure c realized, all of the source code in C builder run. Part VI
KMEANS
- The KMEANSprogram accepts input consisting of vectors and calculates the givennumber of cluster centers using the K-means algorithm. Output isdirected to the screen.-The KMEANSprogram accepts input consisti Vi of vectors and calculates the givennumbe
rongqi
- 我们没有按照过程化 程序设计的方式把数据结构和函数分开而是引入了一个类TextQuery 来封装它们我们将 在后面章节中更详细地了解类的使用文本的表示也做了修改以便能够在当前可用的编 259 第六章 抽象容器类型 译器下通过编译-we did not follow procedures for the process of design of the data structures and function separately but the introduction of a
QccPackSPIHT-0.54-1.tar
- QccPackSPIHT-0.54-1 (release 2007-04-30) The Set Partitioning in Hierarchical Trees (SPIHT) algorithm for wavelet-based image coding .-QccPackSPIHT - 0.54-1 (release 2007-04-3 0) The Set Partitioning in Hierarchical Trees ( SPIHT) algorithm for wav
new-lms-arithmetic-simulation-code
- In 1960, R.E. Kalman published his famous paper describing a recursive solution to the discrete-data linear filtering problem. Since that time, due in large part to advances in digital computing, the Kalman filter has been the subject of extensiv
kalman-filter-simulation-tools
- In 1960, R.E. Kalman published his famous paper describing a recursive solution to the discretedata linear filtering problem [Kalman60]. Since that time, due in large part to advances in digital computing, the Kalman filter has been the subje
matlab_hmm
- hide markov model(HMM) for matlab including initiate,train,and test three parts -hide markov model (HMM) for Matlab includi Vi initiate, train, and test three parts
vi
- 基于labview的数据接收与滤波程序包括四个子vi,和原工程文件名相同的压缩文件内
GenCode128
- day la mot chuong trinh rat la thu vi, duoc su dung rong rai tren toan the gioi
cross_correlation
- 这是个labview的互相关程序 包含了好几子VI 在实际的信号处理中 效果很好-This is the inter-related procedures LabVIEW contains several sub-VI in the actual signal processing well
vi
- 有关vi的各方面资料，包括配置文件、使用手册和技巧等-Information about various aspects of vi, including configuration files, manuals and skills