搜索资源列表
软件滤波算法
- 十种软件滤波算法 限副滤波 中位值滤波法 算术平均滤波法 递推平均滤波法（又称滑动平均滤波法）中位值平均滤波法（又称防脉冲干扰平均滤波法） -filtering software filtering algorithm limits Vice median filtering method arithmetic average recursive filtering average filtering method (also known as the moving average filter
jose
- jose.cpp本演示程序中，对给定的n个人进行顺时针编号，每个人持有一个密码。一开始任选一个正整数作为报数上限值（m <= n），从第一个人开始按顺时针方向自1开始顺序报数，报到m时停止报数。-jose.cpp the demonstration program, to the right individuals clockwise n numbers each person has a password. An optional started as a positive intege
c
- #include<malloc.h> #include<limits.h> #include<stdio.h> #include<graphics.h> #include<io.h> #include<math.h> #include<process.h> #include<conio.h> #define m 100 #define OK 1 typedef
约瑟夫
- 约瑟夫问题的一种描述是：编号为1，2，…，n的n个人按顺时针方向围坐一圈，没人持有一个密码。一开始人选一个正整数作为报数上限值m，从第一个人开始按顺时针自1开始报数，报到m是停止报数。报m的人出列，将他的密码作为新的m值，从他在顺时针方向上的下一个人开始重新从1报数，如此下去，直至所有人全部出列为止。-a descr iption of the problem is : No. 1, 2, ..., n n clockwise direction by individuals sitting a
大数加减3
- 可以实现两个大整数（不限数位）相加减！ 在C＋＋中，加减法的两个数必须在系统规定内，本程序突破了这一界限！-can achieve two large integers (Open-digit) is modified! In C + +, and subtract the number two must be within the system, the process broke the limits!
distsort
- 该程序是分布计数排序，它是我所见过的各种排序方法中最快的，它的时间复杂度为O(n),但是这种排序适用于已知待排序列的上下限，并且如果上限与下限的差值比较大的话，空间消耗也比较大．-distribution of the program is counting sequencing, it is I have seen the fastest sorting methods, it's time complexity of O (n), but this sort known to be
travelingSalespersonProblem.ra
- 旅行商问题的实现，用分支界限法实现旅行商问题,The realization of traveling salesman problem, and the Limits of Law branch of the realization of traveling salesman problem
广义表的表头和表尾
- 广义表是线性表的推广。广义表是n个元素的有限序列，元素可以是原子或一个广义表，记为LS。 若元素是广义表称它为LS的子表。若广义表非空，则第一个元素称表头，其余元素称表尾。 表的深度是指表展开后所含括号的层数。 把与树对应的广义表称为纯表，它限制了表中成分的共享和递归； 允许结点共享的表称为再入表； 允许递归的表称为递归表； 相互关系：线性表∈纯表∈再入表∈递归表； 广义表的特殊运算：1）取表头head(LS)；2）取表尾tail(LS) -generalized l
huffman
- 霍夫曼编码，是离散余弦编码的一种，当各离散样值概率为2的幂时，压缩编码达到极限熵-Huffman code is encoded as a discrete cosine, discrete sample value when the probability of power 2 hours, reached the limits of entropy coding
MATLABFUNCTION
- 一些常用的MATLAB函数，求和； 求导数； 求极限；求泰勒展开式-Some commonly used MATLAB function, summation order derivative seeking limits order Taylor expansion
ajn
- 蚁群算法作为一种新的智能计算模式， 由于其离散性本质而在组合优化问题上取得 巨大成 功，但这也限制了它在连续问题求解中的应用。-Ant colony algorithm as a new kind of intelligent computing model because of its nature discrete combinatorial optimization problems in on a great success, but it also limits the prob
knapsackproblems
- 本程序用MFC实现了背包问题中贪婪法，动态规划法，蛮力法，分支界限法的可视化-This procedure using MFC in a knapsack problem greedy method, dynamic programming method, brute force method, branch visualization limits of the law
pdesetbd
- PDESETBD设置边界条件偏微分方程工具箱的界限。-PDESETBD boundary conditions set the limits of partial differential equation toolbox.
gaitaibiao
- 高斯贝尔abs直播卫星 系统源码，将源码写入可突破中星9号12台限制。-High-GOSPELL abs broadcast satellite system source code, source code is written will be a breakthrough in the star 12 sets limits on the 9th.
51
- 空间分辨率限制在BRDF的提取 希望对大家有用-Spatial Resolution Limits in Extraction of BRDF
shuzhishiyan
- 两个数值实验的matlab编程实现。题目分别1是利用循环语句，计算数列根号5 ，根号下根号5 ，根号下根号下根号5…的极限，要求误差小于 10负8次方。 2利用级数pi=1-1/3+1/5-1/7+...可计算出无理数pi的近似值-Two numerical experiments matlab programming. Title 1 is the use of loop were calculated series roots and 5, roots and root number und
vechicle_parking_control_system
- automatic vehicle parking control system controls the door of parking area. and also it limits the number of vehicles automatically.
plot3k
- Generate a 3D point plot of L=(x,y,z) using the values in the vector c to determine the color of each point. If c is empty, then z (column 3 of L) is used to color the plot. The data points are sorted so that plot3 is only called once for each
Opt_Simu
- 模拟退火算法求函数 f(x)的最小值点， 且 l <= x <= u f为待求函数，x0为初值点，l，u分别为搜索区间的上下限，kmax为最大迭代次数 q为退火因子，TolFun为函数容许误差 算法第一步根据输入变量数，将某些量设为缺省值- Simulated annealing algorithm of a function f (x) the minimum point, and l < = x < = u f is the unknown fun
MyHamming
- 模拟退火算法求函数 f(x)的最小值点， 且 l <= x <= u f为待求函数，x0为初值点，l，u分别为搜索区间的上下限，kmax为最大迭代次数 q为退火因子，TolFun为函数容许误差 算法第一步根据输入变量数，将某些量设为缺省值- Simulated annealing algorithm of a function f (x) the minimum point, and l < = x < = u f is the unknown fun