摘要
在分析最优解结构的基础上,用Java语言给出解决该问题的一个通用的程序。全文分为四个部分,首先讨论了动态规划时间效率优化的可行性和必要性,接着给出了动态规划时间复杂度的决定因素,然后分别阐述了对各个决定因素的优化方法,最后总结全文。
In the analysis of the optimal solution based on the structure,with the Java language to solve the problem giwn a common procedure.Paper is divided into four parts,the first time discussed the efficiency of dynamic programming optimization of the feasibility and necessity of dynamic programming is given then the time complexity of the determinants and then introduced the various determinants of optimization methods and,finally, full-text.
出处
《计算机光盘软件与应用》
2011年第2期142-142,共1页
Computer CD Software and Application
关键词
矩阵链乘积
动态规划算法
JAVA编程
Matrix chain multiplication
Dynamic programming algorithm
Java programming