-
The use of Kalman filter for target tracking matlab source code
使用卡尔曼滤波进行目标追踪的matlab源代码-The use of Kalman filter for target tracking matlab source code
- 2023-08-23 05:45:03下载
- 积分:1
-
人脸识别(VJ算法)VS2010完整工程
应用背景人脸识别(VJ算法)VS2010完整工程人脸识别(VJ算法)VS2010完整工程人脸识别(VJ算法)VS2010完整工程关键技术基于OPENCVVJ算法C++实现 基于OPENCVVJ算法C++实现 基于OPENCVVJ算法C++实现 基于OPENCVVJ算法C++实现
- 2022-07-05 13:32:24下载
- 积分:1
-
动态规划,poj3688
资源描述这是一道比较典型的动态规划算法题目,在游戏中运用了推理与动态规划算法,有助于帮助我们更加深刻地理解动态规划算法
- 2022-04-22 00:42:58下载
- 积分:1
-
from regular
从正则式转化为有穷自动机-from regular-into DFA
- 2022-08-22 01:19:02下载
- 积分:1
-
猜数字游戏c版 汉诺塔游戏递归解法c版
猜数字游戏c版 汉诺塔游戏递归解法c版-viewing game version of the game HANOR recursive solution c version
- 2022-07-01 08:33:58下载
- 积分:1
-
介绍了GS算法的核心内容,为想学习GS算法的人士提供很好的参考...
介绍了GS算法的核心内容,为想学习GS算法的人士提供很好的参考-Introduction of the GS algorithm is the core content for the GS algorithm to learn to provide good reference
- 2022-03-12 07:10:41下载
- 积分:1
-
STM32无刷电机控制
资源描述 用STM32这款芯片驱动无刷马达,本例中包含了霍尔接口电路以及高级定时器的6路PWM配置电路,对于新手来说通俗易懂,能够快速入门。
- 2022-06-26 21:45:57下载
- 积分:1
-
数据结构-算法-C语言-Demo
#ifndef _BINARY_TREE_H_INCLUDED#define _BINARY_TREE_H_INCLUDED#include #include templatestruct Bintree_node {T element;Bintree_node* lchild;Bintree_node* rchild;explicit Bintree_node(const T& elem=T(), Bintree_node* lchd=0, Bintree_node* rchd=0): element(elem), lchild(lchd), rchild(rchd) {}};templateclass Binary_tree {public:typedef Bintree_node* PBtn;Binary_tree();virtual ~Binary_tree();void clear();int depth() const;int size() const;virtual PBtn find(const T& elem) const=0;virtual void insert(const T& elem)=0;virtual void erase(const T& elem)=0;virtual void print(std::ostream& output) const=0;void print_tree(std::ostream& output) const;protected:
- 2022-01-29 04:39:50下载
- 积分:1
-
performance simulation of network_coding
应用背景In generated networks, selecting one node as source and some nodes as receivers in
random (single source multicast network), we make performance test for network
coding based multicast route algorithm (we put forward it ourselves, corresponding to
high multicast rate and low multicast rate), shortest path distribution tree route
algorithm (DIJKSTRA algorithm) and Maximum-rate distribution tree route
algorithm (PRIM algorithm), respectively.
关键技术
In this program, two things have been done: (1) generate random topologies (2)performance test。
network coding cap: 5.0000 dijk cap: 5.0000 prim cap: 5.0000 network coding res1: 0.0000--res2: 12.0000 dijk res: 14.0000 prim res: 14.0000 average degree: 2.
- 2022-11-16 07:10:03下载
- 积分:1
-
如何写遗传算法程序
教你如何用c++编写遗传算法程序,并且有详细的示例,详细的描述了遗传算法的编写
- 2022-08-13 08:02:51下载
- 积分:1