登录
首页 » WORD » it

it

于 2015-03-28 发布 文件大小:223KB
0 80
下载积分: 1 下载次数: 0

代码说明:

说明:  Mathematics Special book problem and solutions

下载说明:请别用迅雷下载,失败请重下,重下不扣分!

发表评论

0 个回复

  • reverberation_shum
    Settles an invoice time of reverberation. A test signal - white noise. The analysis to be made through 1/3 octava filters. Time of record of a signal of white noise 1 second. Duration of the analysis of process of reverberation 1 second. Time of transients which arise during reverberation is considered.
    2010-10-21 20:07:47下载
    积分:1
  • fmaxga
    matlab file ...by using genetic algorithm
    2011-02-08 03:35:26下载
    积分:1
  • Kinetic-analysis-and-dynamic
    基于MATLAB/Simulink的平面连杆机器人的动力学分析与动态仿真(Kinetic analysis and dynamic simulation of the planar rod robot in the MATLAB Simulink-based)
    2012-03-28 21:19:29下载
    积分:1
  • linear_-classification
    模式识别作业中的线性分类器程序,有感知器准则,最小二乘准则等(patter recognition assignment of linear classification designing)
    2011-06-13 10:23:27下载
    积分:1
  • SIFT
    SIFT算法Lowe英文原文,以及相应源码解释,适合初学者阅读(failed to translate)
    2013-05-07 21:08:30下载
    积分:1
  • mat
    this is one of the best satelite code in the world to find the parameters of the satelite
    2013-08-23 11:58:38下载
    积分:1
  • 分支定界法
    说明:  分支定界法(branch and bound)是一种求解整数规划问题的最常用算法。这种方法不但可以求解纯整数规划,还可以求解混合整数规划问题。分支定界法是一种搜索与迭代的方法,选择不同的分支变量和子问题进行分支。 对于两个变量的整数规划问题,使用网格的方法有时更为简单。 [1] 通常,把全部可行解空间反复地分割为越来越小的子集,称为分支;并且对每个子集内的解集计算一个目标下界(对于最小值问题),这称为定界。在每次分枝后,凡是界限超出已知可行解集目标值的那些子集不再进一步分枝,这样,许多子集可不予考虑,这称剪枝。这就是分枝定界法的主要思路。(Branch and bound method is one of the most commonly used algorithms to solve integer programming problems. This method can solve not only pure integer programming but also mixed integer programming. Branch and bound algorithm is a method of search and iteration, which selects branches with different branch variables and sub problems. For integer programming problems with two variables, the grid method is sometimes simpler[ 1] Generally, all feasible solution spaces are divided into smaller and smaller subsets repeatedly, which is called bifurcation; And a lower bound of the objective (for the minimum value problem) is calculated for the solution set in each subset, which is called the bound. After each branch, those subsets whose bounds exceed the objective value of the known feasible solution set will not be further branched, so many subsets can not be considered, which is called pruning. This is the main idea of branch and bound method.)
    2021-04-26 12:21:14下载
    积分:1
  • single_server_queue
    M/M/1 single-server queuing system simulation (using Event Scheduling Method Discrete Event Simulation System) to customers Da-mo arrival time interval and customer service time are negative exponential distribution, single-desk system, in accordance with the single-team queue, by FIFO mode services. N inspection services customers (n = 1000,2000,3000. 5000) the average customer captain, and the average queue time.
    2013-02-10 15:59:24下载
    积分:1
  • QuantLloyd
    QuantLloyd using matlab
    2013-03-12 16:40:51下载
    积分:1
  • fangjia
    房价的模拟与现实对比,得根据具体数据来对程序进行适当的调整,希望有用(Compare simulated and real house prices, by the specific data to make an appropriate adjustment to the program, seek to help)
    2011-06-20 09:27:56下载
    积分:1
  • 696518资源总数
  • 104226会员总数
  • 47今日下载