-
sina
matlab初学的if语句和循环语句的基本用法，很有用处的。(matlab beginner of if statements and loops in the basic use, very useful.)
- 2010-11-05 09:41:35下载
- 积分：1
-
petri-net-matlab-simulate
本文介绍了在matlab环境下进行Petri网模型仿真的方法(This article describes the environment in matlab Petri net model for the simulation method)
- 2011-05-02 21:48:57下载
- 积分：1
-
SIR-with-Q
用matlab程序编写的一个三维雷达跟踪粒子滤波器，超强(using Matlab procedures prepared by the three 3D radar tracking a particle filter, super)
- 2007-04-13 11:33:51下载
- 积分：1
-
RANSAC_m
用matlab实现的有关Ransac算法做的2D及3D拟合效果。(Use the matlab achieve Ransac of algorithm do 2D and 3D fitting effect.)
- 2020-12-31 09:59:04下载
- 积分：1
-
AmplifyandForward
show the results of using AF in cooperative communications
- 2011-11-20 16:00:36下载
- 积分：1
-
rand03.6
In order to minimize power losses caused by high current and improve the voltage profile in the network distribution, the introduction of dispersed generations also called productions decentralized in distribution network (DG) plays an important role. The installation of DGs directly affects the power requested or purchased. The sizing and placement of DGs in the system must be optimal because a wrong choice has a negative impact on the system behavior. To solve this combinatorial problem, an algorithm known as Firefly algorithm is proposed in this paper. This is a meta-heuristic algorithm inspired by the behavior of fireflies flashing. The main objective of firefly flash is to act as a signaling system to attract other fireflies. Networks tested IEEE69-bus and IEEE33-bus are used to evaluate the effectiveness of this method. The results are compared with those obtained by genetic algorithm (GA) to IEEE69-bus, and Shuffled frog leaping algorithm (SFLA) for IEEE 33-bus.
- 2013-12-16 14:22:43下载
- 积分：1
-
MATLAB-Codes(-Knapsack-Problem)
about using matlab for solving Knapsack Problem
- 2015-04-05 19:46:02下载
- 积分：1
-
road-detection
彩色图像的道路识别
程序运行后，从图中截取一块区域，计算均置于方差，并得到结果。(Segmentation of Road in colorful pictures
)
- 2011-05-15 04:50:59下载
- 积分：1
-
stone
说明： 经典的石子划分问题，不同质量和数量的石子进行划分，以求最优解(Classic stone division, different quality and quantity of stones to be divided, with a view to the optimal solution)
- 2010-04-19 23:46:51下载
- 积分：1
-
minute-tree
在一个具有几个顶点的连通图G中，如果存在子图G 包含G中所有顶点和一部分边，且不形成回路，则称G 为图G的生成树，代价最小生成树则称为最小生成树(If there subgraph G ' contains all vertices in G, and part of the side, and does not form a loop, then G' in a few vertices connected graph G is the spanning tree of a graph G consideration of the minimum spanning tree is called minimum spanning tree)
- 2013-02-27 13:41:00下载
- 积分：1
