Welcome![Sign In][Sign Up]
Location:
Search - optimal

Search list

[Linux-UnixoptimalBinarySeachTree

Description: Build an optimal binary search tree using dynamic programming.-Build an optimal binary search tree using d ynamic programming.
Platform: | Size: 538624 | Author: zhoushusen | Hits:

[matlabrunduopf

Description: 最优潮流计算,可用于电力系统输电阻塞管理,经济调度等-optimal power flow calculation can be used in electricity transmission congestion management system, economic scheduling
Platform: | Size: 1024 | Author: 罗风 | Hits:

[Other systemspso-powerflow

Description: 基于matlab的基本粒子群优化算法,可应用与最优潮流计算等-Matlab-based optimization of the particle swarm algorithm can be applied with optimal power flow calculation
Platform: | Size: 2048 | Author: milan | Hits:

[Otherfengye032

Description: 关于电力系统最优潮流计算的MATLAT程序.可以实现最优潮流的.-on the optimal power flow calculation MATLAT procedures. Can achieve optimal power flow.
Platform: | Size: 12288 | Author: 张丹杰 | Hits:

[BooksonMATLABDthesecond

Description: 基于MATLABD的线性二次型最优控制设计.二次型最优控制设计-MATLABD based on the linear quadratic optimal control design. Quadratic Optimal Control Design
Platform: | Size: 152576 | Author: wang | Hits:

[2D GraphicAaform

Description: Aaform (Anti Aliased Image Transformation) is a technique I have developped for transforming a rectangular bitmap into any quadralateral (Including Convex/Complex quadralaterals). I believe that this is the optimal way to transform images that exists. Aaform uses a lot of geometry concepts that will be mentioned in this article.-Aaform (Anti Aliased Image Transformatio n) is a technique I have developped for transfor ming a rectangular bitmap into any quadralater al (Including Convex/Complex quadralaterals ). I believe that this is the optimal way to trans form images that exists. Aaform uses a lot of geo metry concepts that will be mentioned in this ar ticle.
Platform: | Size: 488448 | Author: Clark Chen | Hits:

[matlabmatlab_3_opt

Description: 提供一种求解最优哈密尔顿的算法---三边交换调整法,要求在运行jiaohuan3(三交换法)之前,给定邻接矩阵C和节点个数N,结果路径存放于R中。 bianquan.m文件给出了一个参数实例,可在命令窗口中输入bianquan,得到邻接矩阵C和节点个数N以及一个任意给出的路径R,,回车后再输入jiaohuan3,得到了最优解。 由于没有经过大量的实验,又是近似算法,对于网络比较复杂的情况,可以尝试多运行几次jiaohuan3,看是否能到进一步的优化结果。 -Provide an optimal algorithm Hamilton- trilateral exchange Adjustment Act, requiring running jiaohuan3 (c exchange) before a given adjacency matrix C and the node number N, the results of the path stored in the R in. bianquan.m document gives examples of a parameter can be in the command window, type bianquan, be the adjacency matrix C and the node number N and an arbitrary given path R,, carriage return after the input jiaohuan3, have been the optimal solution . After the absence of a large number of experiments, it is approximate algorithm, for more complex network situations, you can try to run several jiaohuan3, can look to further optimize the results.
Platform: | Size: 3072 | Author: | Hits:

[matlabpid

Description: 基于MATLAB的PID程序,该程序实现PID参数的优化调整-MATLAB based on the PID process, which realize the optimal adjustment of PID parameters
Platform: | Size: 1024 | Author: 纷纷 | Hits:

[DocumentsTSP(TravelingSalesmanProblem)

Description: Traveling Salesman Problem (TSP) has been an interesting problem for a long time in classical optimization techniques which are based on linear and nonlinear programming. TSP can be described as follows: Given a number of cities to visit and their distances from all other cities know, an optimal travel route has to be found so that each city is visited one and only once with the least possible distance traveled. This is a simple problem with handful of cities but becomes complicated as the number increases.
Platform: | Size: 446464 | Author: yangdi | Hits:

[SCSI-ASPIoptimal

Description: 最优二分检索树,欢迎下载 呵呵 大家多支持-Optimal binary search trees, all more than welcome to download huh support
Platform: | Size: 1024 | Author: lanjinhe | Hits:

[matlabfinalopf

Description: matpower软件下,最优潮流程序完整版,希望对大家有用-matpower software, the optimal power flow procedures for the full version, in the hope that useful to everybody
Platform: | Size: 122880 | Author: 魏艳霞 | Hits:

[matlabyj6

Description: 离散二次线性系统最优控制问题的MAtlab 原程序代码-Discrete linear systems with quadratic optimal control problem of the original Matlab code
Platform: | Size: 1024 | Author: 刘璐 | Hits:

[Algorithmkalman-MATLAB

Description: 使用MATLAB编写的卡尔曼滤波源程序,简单易用,输出卡尔曼滤波的最优结果。-Prepared by the use of MATLAB Kalman filter source, easy-to-use, the output of the optimal Kalman filter results.
Platform: | Size: 2048 | Author: 张平 | Hits:

[matlabMATLABzuijiachaoliujisuan

Description: MATLAB潮流计算和最优潮流计算的程序,对毕业设计有一定用处-MATLAB flow calculation and optimal power flow calculation procedures, graduation design has some use in
Platform: | Size: 140288 | Author: 柳三喜 | Hits:

[Otheryakebi

Description: 最优潮流计算中形成雅克比矩阵(用c原理)-Optimal Power Flow Jacobian matrix formed (in principle c)
Platform: | Size: 1024 | Author: sahsha | Hits:

[Data structsSub-optimalSearchTree

Description: 最优二叉搜索树 采用c语言编写的最优二叉搜索树算法。实现其的遍历及构造-Optimal binary search tree using c language of optimal binary search tree algorithm. Realize its Ergodic and tectonic
Platform: | Size: 76800 | Author: 李浩 | Hits:

[matlabCHAPTER5

Description: 本文队基于LQR最优调节器的倒立摆控制系统进行了仿真研究-In this paper, team-based LQR Optimal Regulator of an inverted pendulum control system simulation
Platform: | Size: 190464 | Author: 陆振华 | Hits:

[Otherzuiyoukongzhi

Description: 这是关于最优控制理论的课件。里面详细介绍了最优控制器的设计-This is the optimal control theory on the courseware. Which described in detail the design of optimal controller
Platform: | Size: 112640 | Author: maomao | Hits:

[matlabekf

Description: 这是个扩展kalman滤波的历程,对初学最优估计饿人应该很有帮助。-This is a course of extended kalman filtering, optimal estimation of beginner hungry people should be helpful.
Platform: | Size: 15360 | Author: | Hits:

[AI-NN-PRTSp

Description: cost存放了一个强连通图的边权矩阵,作为一个实例。 可在workspace中加载 运用此算法要注意多次试验。 bianquan.m文件给出了一个参数实例,可在命令窗口中输入bianquan,得到邻接矩阵C和节点个数N以及一个任意给出的路径R,,回车后再输入jiaohuan3,得到了最优解。 由于没有经过大量的实验,又是近似算法,对于网络比较复杂的情况,可以尝试多运行几次jiaohuan3,看是否能到进一步的优化结果。-storage cost of a strongly connected graph edge weight matrix, as an example. Can be loaded in the workspace to use this algorithm to the attention of numerous tests. bianquan.m document gives examples of a parameter can be in the command window, type bianquan, be the adjacency matrix C and the node number N and an arbitrary given path R,, carriage return after the input jiaohuan3, have been the optimal solution . After the absence of a large number of experiments, it is approximate algorithm, for more complex network situations, you can try to run several jiaohuan3, can look to further optimize the results.
Platform: | Size: 11264 | Author: 岳明 | Hits:
« 1 23 4 5 6 7 8 9 10 ... 50 »

CodeBus www.codebus.net