搜索资源列表
-
0下载：
问题算法源代码：骑士遍历、万年历、N皇后问题回溯算法、动态计算网络最长最短路线、货郎担分枝限界图形演示、货郎担限界算法、矩阵乘法动态规划、网络最短路径Dijkstra算法-problems algorithm source code : Knight traversal, calendar, N Queens backtracking algorithms, Dynamic computing network longest shortest routes, traveling salesman
-
-
0下载：
使用动态规划方法解决多个生产线上的调度问题，进而解决生产线调度的最小时间问题-use dynamic programming solution to a number of production line scheduling problem, thereby solving production line scheduling the minimum time
-
-
0下载：
问题：货郎担问题 实现方法：枚举，回溯，动态规划，分支界限法 -: traveling salesman problem Method : Enumeration, backtracking, dynamic programming, branch and bound
-
-
0下载：
半数集问题--动态规划算法,也是算法分析与设计的其中算法分析,用于数集问题.-half set of issues -- dynamic programming algorithm, as well as algorithm analysis and design of the algorithm analysis, Set for a few problems.
-
-
1下载：
用多种算法解决0－1背包问题，包括回朔法，动态规划，贪心算法等-algorithm used to solve a variety of 0-1 knapsack problem, including the retrospective method, dynamic programming, greedy algorithm
-
-
0下载：
这是计算机算法基础中的动态规划的方法的一个例子，多段图是一个很经典的问题！这里的程序用于求解最小成本路径，用类似的思想可以解决最优分配方案的问题！-This is a computer algorithm based on the dynamic programming methods of an example, many of the map is a classic question! Here the procedures for calculating the minimum cost
-
-
0下载：
运筹学算法的C++语言实现，如线性规划、动态规划等，是实现优化计算的-Operations research algorithms C++ language, such as linear programming, dynamic programming is optimal calculation
-
-
0下载：
关于动态规划的ppt ，内容不错，适合学生学习使用。-the special ppt for dynamic programming，the content is perfect， and suits college students very well.
-
-
0下载：
动态规划算法求解0-1背包问题,动态规划算法knapsack求最优值-Dynamic programming algorithm for solving 0-1 knapsack problem, dynamic programming algorithm for optimal value knapsack
-
-
0下载：
descr ipt the dynamic programming
-
-
0下载：
IMPLEMENTATION OF DYNAMIC PROGRAMMING ALGORITHMS FOR EDITDISTANCE PROBLEM IN C
-
-
0下载：
用动态规划算法解决电路分布问题-Using dynamic programming algorithm to solve the distribution problem of circuit
-
-
0下载：
本程序引入了连通性状态压缩动态规划方法，可以在非常快的时间内解决棋盘上的哈密顿回路个数的计数。
时间复杂度O(n*m*3^n)远低于搜索。-This procedure introduced in the state of connectivity compression methods of dynamic programming can be very fast in time to solve the Hamiltonian circuit board on the count of
-
-
0下载：
关于动态规划的ppt ，内容不错，适合学生学习使用。-the special ppt for dynamic programming，the content is perfect， and suits college students very well.
-
-
0下载：
动态规划(dynamic programming)是运筹学的一个分支，是求解决策过程(decision process)最优化的数学方法。-Dynamic programming (dynamic programming) is a branch of operations research, decision-making process is the solution (decision process) mathematical optimization methods.
-
-
0下载：
动态规划计算斐波那契数（后一个数等于前面两个数的和）1，1，2，3，5，8，13，21，34，55，89，144…… -Dynamic programming computes Fibonacci numbers (after a number equal to the previous two numbers) 1,1,2,3,5,8,13,21,34,55,89,144 ......
-
-
0下载：
SDP is speed dynamic progmam. Normally dynamic program have O(N^2) or (O(N^3), but we can speedly, O(NlogN) or O(N^2 logN).-SDP is speed dynamic progmam. Normally dynamic program have O(N^2) or (O(N^3), but we can speedly, O(NlogN) or O(N^2 logN).
-
-
1下载：
利用matlab语言，采用动态规划算法解决机器设备的调度问题，运行速度快，运行结果完美。-analyzes the allocation of resources in dynamic programming with Matlab , and conducts
procedure designs and computation with Matlab , simplifying complex issues and avoiding the cumbersome
calculation
-
-
0下载：
presented dynamic programming based on image denoising
-
-
0下载：
python实现动态规划算法，用于进行多矩阵连乘，随机化分析算法复杂度-Dynamic programming algorithm by python for metrics multipling，randomized for analyzing complexity of algorithm
-
