Welcome![Sign In][Sign Up]
Location:
Search - Dynamic Programming Algorithm Optimization

Search list

[Other resourcetianji

Description: 田忌赛马问题:用动态规划问题,解决最优化问题,不错的算法哦-Tianji race issue : dynamic programming problem solving optimization problems, a good algorithm oh.
Platform: | Size: 918 | Author: iori | Hits:

[Other resourceDynamic_Programming

Description: 多阶段决策过程( multistep decision process )是指 这样一类特殊的活动过程,过程可以按时间顺序分解成若干个相互联系的阶段,在每一个阶段都需要做出决策,全部过程的决策是一个决策序列。 动态规划 ( dynamic programming )算法 是解决 多阶段决策过程最优化问题 的一种常用方法,难度比较大,技巧性也很强。利用动态规划算法,可以优雅而高效地解决很多贪婪算法或分治算法不能解决的问题。动态规划算法的基本思想是:将待求解的问题分解成若干个相互联系的子问题,先求解子问题,然后从这些子问题的解得到原问题的解; 对于重复出现的子问题,只在第一次遇到的时候对它进行求解,并把答案保存起来,让以后再次遇到时直接引用答案,不必重新求解 。动态规划算法将问题的解决方案视为一系列决策的结果,与贪婪算法不同的是,在贪婪算法中,每采用一次贪婪准则,便做出一个不可撤回的决策;而在动态规划算法中,还要考察每个最优决策序列中是否包含一个最优决策子序列,即问题是否具有最优子结构性质。 -multi-stage decision-making process (multistep decision process) is that like a special kind of process, the process can be time-sequence decomposed into a number of interrelated stage, in every stage of a need to make a decision, all of the decision-making process is a sequence of decision-making. Dynamic Programming (dynamic programming) algorithm is a multi-stage decision-making process optimization asked that's a common method was more difficult, skills also have a strong character. Using dynamic programming algorithm can be elegant and efficient solution for many greedy algorithm or partition algorithm to solve the problem. Dynamic programming algorithm is the basic idea : to be solving the problem is decomposed into a number of interrelated issues son, Solving the problem first s
Platform: | Size: 3241 | Author: 汤烈 | Hits:

[Data structsDynamic_Programming

Description: 多阶段决策过程( multistep decision process )是指 这样一类特殊的活动过程,过程可以按时间顺序分解成若干个相互联系的阶段,在每一个阶段都需要做出决策,全部过程的决策是一个决策序列。 动态规划 ( dynamic programming )算法 是解决 多阶段决策过程最优化问题 的一种常用方法,难度比较大,技巧性也很强。利用动态规划算法,可以优雅而高效地解决很多贪婪算法或分治算法不能解决的问题。动态规划算法的基本思想是:将待求解的问题分解成若干个相互联系的子问题,先求解子问题,然后从这些子问题的解得到原问题的解; 对于重复出现的子问题,只在第一次遇到的时候对它进行求解,并把答案保存起来,让以后再次遇到时直接引用答案,不必重新求解 。动态规划算法将问题的解决方案视为一系列决策的结果,与贪婪算法不同的是,在贪婪算法中,每采用一次贪婪准则,便做出一个不可撤回的决策;而在动态规划算法中,还要考察每个最优决策序列中是否包含一个最优决策子序列,即问题是否具有最优子结构性质。 -multi-stage decision-making process (multistep decision process) is that like a special kind of process, the process can be time-sequence decomposed into a number of interrelated stage, in every stage of a need to make a decision, all of the decision-making process is a sequence of decision-making. Dynamic Programming (dynamic programming) algorithm is a multi-stage decision-making process optimization asked that's a common method was more difficult, skills also have a strong character. Using dynamic programming algorithm can be elegant and efficient solution for many greedy algorithm or partition algorithm to solve the problem. Dynamic programming algorithm is the basic idea : to be solving the problem is decomposed into a number of interrelated issues son, Solving the problem first s
Platform: | Size: 3072 | Author: 汤烈 | Hits:

[AI-NN-PRmathmodel

Description: 这是一个好的建模学习资料,赶快下载吧, 数学建模十大算法 ( 包含:蒙特卡罗算法、数据拟合、参数估计、 插值等数据处理算法、线性规划、整数规划、多元规划、二次规划等规划类问题、 图论算法、动态规划、回溯搜索、分治算法、分支定界等计算机算法、 最优化理论的三大非经典算法:模拟退火法、神经网络、遗传算法、 网格算法和穷举法、一些连续离散化方法、数值分析算法、图象处理算法)-This a good model to study the information, download it quickly, mathematical modeling algorithm 10 (includes : Monte Carlo algorithm, data fitting, parameter estimation, interpolation of data-processing algorithms, linear programming, integer programming, diversity planning, Quadratic Programming category of zoning, graph-theoretical algorithms, dynamic programming, retroactive search, the partition algorithm, branch-and-bound algorithm computer, most optimization theory of the three non-classical algorithm : simulated annealing, neural networks, genetic algorithms, mesh algorithms and exhaustive, some consecutive discrete method, numerical analysis algorithms, image processing algorithm)
Platform: | Size: 5928960 | Author: zhxj | Hits:

[Windows Developdynamic

Description: 动态规划算法 程序设计大赛必备 最优化原理 重复子问题-Dynamic Programming Algorithm Programming Contest necessary to repeat the principle of sub-optimization problem
Platform: | Size: 222208 | Author: hxc | Hits:

[Data structsDynamicProgramming

Description: 包含了7篇与动态规划相关的论文及附件: 基本动态规划问题的扩展----2001俞伟论文 动态规划算法的优化技巧---2001毛子青论文 动态规划的特点及其应用----2000张辰论文 动态规划的深入讨论---2000李刚论文 动态规划的深入探讨----1999来煜坤论文 动态规划的个性化优化----2003项荣璟论文 动态规划----2000方奇论文-Contains 7 and the dynamic programming-related papers and accessories: basic dynamic programming expansion of the problem---- 2001 Wei Yu Paper dynamic programming algorithm optimization techniques--- 2001 Westerner green paper the characteristics of dynamic programming and its application----2.0 thousand papers ZHANG Chen-depth discussion of dynamic programming--- 2000 Gang depth papers on dynamic programming to Yu-kun---- 1999 paper on dynamic programming optimization of personalized paper Jing Rong---- 2003--- dynamic programming-2.0 thousand FANG Qi Papers
Platform: | Size: 470016 | Author: 728279799 | Hits:

[matlabComplete-collection-of-algorithm

Description: 算法大全 全书分30章及2附录(在MATLAB中实现)对常用数学算法进行汇总介绍。 主要包括:线性规划、非线性规划、动态规划、图与网络、排队论、对策论、层次分析法、插值与拟合、数据的统计描述和分析、方差分析、回归分析、微分方程建模、稳定状态模型、常微分方程解法、差分方程模型、马氏链模型、变分法模型、神经网络模型、偏微分方程的数值解、目标规划、模糊数值模型、现代优化算法、时间序列模型、存贮论、经济与金融的优化问题、生产与服务运作管理中的优化问题、灰色系统理论及其应用、多元分析、偏最小二乘回归以及附录-Complete collection of algorithm including 30 chapters and 2 appendices: linear programming, nonlinear programming, dynamic programming, graph and networks, queuing theory, game theory, the level of analysis, interpolation and fitting, statistical description and analysis of data , analysis of variance, regression analysis, differential equations modeling, steady-state model, ordinary differential equation solution, difference equation model, Markov chain model, variational method model, neural network model, the numerical solution of partial differential equations, goal programming, fuzzy numerical model, modern optimization algorithms, time series models, storage theory, the optimization of economic and financial issues, production and service operations management in the optimization problem, gray system theory and its applications, multivariate analysis, partial least squares regression, and Appendix
Platform: | Size: 7684096 | Author: 商志远 | Hits:

[AlgorithmPSO

Description: 针对传统的算法如遗传算法、粒子群算法等在TSP问题上求解精确性和求解规模上都还有一定的不足,本文提出了一种基于动态规划思想的粒子群优化算法。该算法用动态规划的方法实现粒子间的信息交互和粒子的进化,并且将粒子群中的粒子按无标度信息指导网络拓扑图的方式进行连接。仿真结果表明该方法能有效地减小误差率,提高解的精确,同时还保持了较低的计算复杂度,具有良好的稳健性。-TSP problem solving for the traditional algorithms such as genetic algorithms, particle swarm optimization accuracy and solving the scale, there is a certain lack of a dynamic programming algorithm-based particle swarm optimization algorithm. The algorithm using dynamic programming method to achieve the evolution of information exchange between the particles and the particles, and particle swarm particle scale-free information guide network topology map to connect. The simulation results show that this method can effectively reduce the error rate and improve the solution precision, while maintaining a low computational complexity, good soundness.
Platform: | Size: 314368 | Author: 程徐 | Hits:

[Software EngineeringstochasticDP

Description: 非常有特色的一篇文章,基于随机动态规划算法开发的燃料电池城市客车能量管理策略优化;-Very unique article, based on the stochastic dynamic programming algorithm developed fuel cell city bus energy management strategy optimization
Platform: | Size: 816128 | Author: HanBing.Wei | Hits:

[Othershuidianzhanchangqiyouhuadiaodu

Description: 动态规划算法,由初末水位计算出最大年发电效益,水电站优化。-Dynamic programming algorithm,calculat the most year power benefitBy the beginning and the end of the water level ,optimization of hydropower stations.
Platform: | Size: 2048 | Author: yuzhiyong | Hits:

[Software Engineeringalgorithm

Description: 以设计策略为主线,循序渐进地介绍了经典算法设计(包括分治、动态规划、贪心、回溯、迭代改进等算法)、NF完全理论、非精确型算法设计〔包括近似算法、参数化算法,随机算法),以及现代智能优化方法.强调算法思维与编程实践并重,注重运用算法技术解决实际工程问题。-In order to design strategy as the main line, gradual introduction of the classic algorithm design (including the partition, dynamic programming, greedy, backtracking and iterative improvement algorithm), NF complete theory, design, precise algorithm including approximation algorithms, a parameterized algorithm, random algorithm), and the modern intelligent optimization methods on both thinking and programming algorithm. In practice, pay attention to the use of algorithms to solve practical engineering problems.
Platform: | Size: 11722752 | Author: junhong | Hits:

[Algorithmbest_allocation

Description: 某公司拟将某种设备5台分配给甲、乙、丙3个工厂,各工厂利润与设备数量之间的关系如下表所示,问这5台设备如何分配使3个工厂的总利润为最大? 动态规划算法的经典实例,这里做了进一步的优化和具体实施。-A company intends to assign some equipment 5 A, between B, C 3 plants, factories profits and the number of devices in the following table, asking how to allocate 5 device so that the total profits for the three plants Maximum? dynamic programming algorithm classic example here to do further optimization and implementation.
Platform: | Size: 1024 | Author: 里欧 | Hits:

[Special EffectsDPStereoMatch

Description: 利用动态规划算法的优点,使用一种基于行列动态规划的自适应立体匹配算法,采用自适应代价函数和能量最小化模型,对最优化问题进行求解。-Take advantage of the dynamic programming algorithm uses an adaptive stereo matching algorithm based on dynamic programming ranks, adaptive cost function and energy minimization model for optimization problem to solve.
Platform: | Size: 5516288 | Author: 李枫 | Hits:

[AI-NN-PRDDDP

Description: DDDP算法,在DP算法基础上扩展,针对水库群优化调度问题-DDDP algorithm, spreading in DP algorithm based on swarm optimization scheduling problem for reservoir, using Java development of discrete differential dynamic programming algorithm.
Platform: | Size: 5120 | Author: rui | Hits:

[OtherDiscrete-Optimization

Description: 离散优化 *enum - 枚举法 *monte - 蒙特卡洛法 *lpint (BranchBound)- 线性整数规划 *L01p_e - 0-1整数规划枚举法 *L01p_ie - 0-1整数规划隐枚举法 *bnb18 - 非线性整数规划(在MATLAB5.3使用) *bnbgui - 非线性整数规划图形工具(在MATLAB5.3使用) *mintreek - 最小生成树kruskal算法 *minroute - 最短路dijkstra算法 *krusk - 最小生成树kruskal算法mex程序 *dijkstra - 最短路dijkstra算法mex程序 *dynprog - 动态规划- Discrete optimization * enum- enumeration method * monte- Monte Carlo method * lpint (BranchBound)- integer linear programming * L01p_e- 0-1 integer programming enumeration method * L01p_ie- 0-1 integer programming hidden enumeration method * bnb18- Nonlinear Integer Programming (used in MATLAB5.3) * bnbgui- nonlinear integer programming graphical tool (used in MATLAB5.3) * mintreek- kruskal minimum spanning tree algorithm * minroute- Shortest dijkstra algorithm * krusk- kruskal minimum spanning tree algorithm mex program * dijkstra- the shortest path algorithm mex program dijkstra * dynprog- Dynamic Programming
Platform: | Size: 32768 | Author: lxc | Hits:

[OtherGADP

Description: 求解动态完全未知的连续时间非线性系统的优化控制的全局自适应动态规划算法-Solving global optimization control completely unknown dynamic continuous-time nonlinear systems adaptive dynamic programming algorithm
Platform: | Size: 347136 | Author: 金刚火狼 | Hits:

[Data structsdongtai

Description: 动态规划算法,很大程度上提高了算法的效率,对算法的研究很有用处-Optimization of Dynamic Programming Algorithm
Platform: | Size: 1024 | Author: 常金鑫 | Hits:

[Windows DevelopNeedle-Wunsch.c

Description: Needleman 和 Wunsch 提出的动态规划算法,这个算法是最早的最经典的双序列比对算法,就是针对寻求全局最佳序列比对这一问题所设计的动态规划寻优策略。(Needleman and Wunsch proposed a dynamic programming algorithm, this algorithm is the most classical algorithm of double sequence alignment of the earliest, is to seek the global optimal dynamic programming alignment which design optimization strategy.)
Platform: | Size: 5150720 | Author: 伟少侠 | Hits:

[Othergai4_2014_12_11_ny

Description: 混合动力汽车动力系统控制算法计算与优化中,使用动态规划算法优化汽车输出转矩MATLAB程序。(Simulation and Optimization of Power System Control Algorithm for Hybrid Electric Vehicle. Using Dynamic Programming Algorithm to Optimize Automobile Output Torque MATLAB Program.)
Platform: | Size: 5120 | Author: 张炫迈 | Hits:

[AI-NN-PRCapture

Description: Abstract: This paper presents a new control strategy to optimize the fuel economy of parallel configured charge sustained hybrid electric vehicles. This new approach is a constrained engine on-off strategy, which has been developed from the two extreme control strategies of maximum SOC and engine on-off, by taking their advantages and overcoming their disadvantages. A system optimization program using dynamic programming algorithm has been developed to calibrate the control parameters used in the developed control strategy, so that its performance can be as close to the optimal solution as possible. For this paper, a passenger car is simulated on a typical highway driving cycle to illustrate the strategy. The methodology developed can be used on other types of vehicles operating in different environments, such as cities, suburban areas, and their combinations.
Platform: | Size: 14336 | Author: Try Wahyudi | Hits:
« 12 3 »

CodeBus www.codebus.net