-
yangshuang
在matlab中最简单的功能实现去噪、平滑和锐化(In the most simple matlab function realize denoising, smoothing and sharpening)
- 2008-05-24 15:53:26下载
- 积分:1
-
GPR-高斯过程回归
说明: Gaussian Processes Regression(GPR) 高斯过程回归 Matlab 实现(Gaussian processes regression (GPR) matlab implementation)
- 2020-06-26 21:48:59下载
- 积分:1
-
MIMO_OFDM
信号与系统基础知识包括连续信号与模型、离散信号与模型;常用信号变换包括Z变换、(Basic knowledge of signals and systems, including continuous signal with the model, discrete signals and model common signal transform including Z transform,)
- 2009-02-17 15:18:55下载
- 积分:1
-
sliding
滑模经典论文a control engineer s guide to sliding mode control(Slipform classic paper a control engineer s guide to sliding mode control)
- 2007-10-23 19:32:44下载
- 积分:1
-
FastHankelTransform
本代码为计算快速汉克变换的matlab源程序。快速汉克变换为经典的数值算法,在地球物理建模中有极其重要的地位(This code for calculations quickly Hank transform matlab source. Rapid Hank transformation as a classic numerical algorithm in geophysics modeling in a very important position)
- 2020-10-13 17:57:31下载
- 积分:1
-
Robotics-TOOLBOX-matlab
本文章是matlab中robotics工具箱的介绍(This article is an introduction matlab toolbox in robotics)
- 2011-05-02 21:51:54下载
- 积分:1
-
matlabsimulationincommunication
数字通信原理基于matlab的仿真计算,希望对大家有用(Principles of digital communication matlab simulation based on the hope of useful)
- 2008-04-25 14:05:59下载
- 积分:1
-
Simplecoordinatesearchalgorithm
Simple coordinate search algorithm
- 2010-07-09 13:31:02下载
- 积分:1
-
2
说明: 有一个长度为整数L(1<=L<=10000)的马路,可以想象成数轴上长度为L的一个线段,起点是坐标原点,在每个整数坐标点有一棵树,即在0,1,2,...,L共L+1个位置上有L+1棵树。
现在要移走一些树,移走的树的区间用一对数字表示,如 100 200表示移走从100到200之间(包括端点)所有的树。
可能有M(1<=M<=100)个区间,区间之间可能有重叠。现在要求移走所有区间的树之后剩下的树的个数。
输入:
两个整数L(1<=L<=10000)和M(1<=M<=100)。
接下来有M组整数,每组有一对数字。
输出:
可能有多组输入数据,对于每组输入数据,输出一个数,表示移走所有区间的树之后剩下的树的个数。(Has a length of integer L (1 < = L < = 10000) of the road, one can imagine a number line segment of length L, the starting point is the coordinate origin, each integer coordinate points in a tree, i.e. 0,1 , 2, ..., L total has L+1 L+1 positions on the tree. Now to remove some trees, tree removed by a range of digitally represented, such as 100 200 represents removed (inclusive) between 100 and 200 all the trees. There may be M (1 < = M < = 100) intervals, there may be overlap between the intervals. Now, after the number of trees require the removal of all remaining sections of the tree. Input: two integer L (1 < = L < = 10000) and M (1 < = M < = 100). Then there is an integer M groups, each with a pair of numbers. Output: there may be multiple sets of input data, for each set of input data, the output of a number indicating the number of the removal of all remaining sections of the tree after tree.)
- 2015-03-22 23:35:47下载
- 积分:1
-
multi_robot_navigation-ACO-master
针对机器人使用蚁群算法,在动态环境下完成路径规划!(For robot use ant colony algorithm, in the dynamic environment to complete path planning.)
- 2018-10-22 11:29:49下载
- 积分:1