搜索资源列表
POSTagger
- （1）从已经标注好词性的语料中统计得到词性标记的二元转移矩阵，以及每个词以确定的词性标记出现的次数等数据（训练阶段） （2）利用动态规划算法快速选取词性标记路径，得到词性标记结果 （3）可以选择不同的词性标记集 -(1) has been marked from the Corpus POS good statistical POS be labeled binary transfer matrix, and every word to determine the POS m
xinchengxu
- 包括GRAY码，工作分配问题，会场安排，石子，行数字三角形，最长递增子序列和最小重量机器算法。利用动态规划、回溯法和贪心法-including GRAY code, work assignment, venue arrangements, gravel, and digital triangle, the longest sequences and increase the minimum weight machine algorithm. Using dynamic programming,
thesis2000_fangqi
- 算法分析和设计的主要原理,动态规划 贪心算法 背包问题的实例-algorithm analysis and design of the main principle of dynamic programming greedy algorithm examples knapsack problem
谢宾治三角形的输出
- 谢宾治三角形的输出算法的具体实现，采用动态规划算法，使用vc++6.0编写。-Xie Bin Fan governance triangle output to achieve the specific algorithm using dynamic programming algorithm, vc 6.0 preparation.
my0-1knapsack
- 给定n 个物品, 物品i重为wi 并且价值为 vi ，背包所能承载的最大容量为 W. 0-1 背包问题即是选择含有着最大总价值的物品的子集且它的容量 ≤W ． 用动态规划实现-given n goods, items i weight of wi and value of vi, the backpack can carry a maximum capacity of W. 0-1 knapsack problem that is a choice with a maximum tot
BinPacking
- 这是最难的一个程序了，算法是运筹学里的branch band的集装箱问题的最优动态规划解法，当年我的头都大了才实现的，绝得数学加实践的程序-this is the most difficult of a process, the algorithm is tacticians band's branch of the container optimal dynamic programming solution, for the first time, I have to get bigg
背包算法
- 高级算法中的背包问题求解，算法简便高效，主要解决动态规划0-1背包问题-senior algorithm to solve the knapsack problem, the algorithm is simple and efficient, dynamic programming solution 0-1 knapsack problem
id5
- 介绍动态规划方法在解决背包问题、图象压缩、矩阵乘法链、最短路径、无交叉子集和元件折叠等方面的应用。-on dynamic programming methods in solving knapsack problem, image compression, the matrix multiplication chains, the shortest path, non-overlapping subsets of folding and components such applications.
流水线作业调度
- 按动态规划原理球解一类特定条件下的流水线调度问题的具体做法-according to the principles of dynamic programming ball a particular type of solution under the conditions of the pipeline scheduling problems, the specific way
Knap12121
- 用动态规划算法编写的有关旅行商问题的java程序-dynamic programming algorithm used in the preparation of the Traveling Salesman Problem java programs
货郎担问题四种解法
- 货郎担问题的回溯，枚举，分支界限，动态规划解法-back the traveling salesman problem, except, branch line, dynamic programming solution
综合算法
- 数值类综合算法 常用数值计算工具包（龙贝格算法、改进欧拉法、龙格库塔方法、复合辛普森），Matlab数学建模工具箱（以及众多实例）。 常用算法：如Floyd算法、分治算法、动态规划、组合算法、贪婪算法-composite numerical algorithm commonly used numerical Kit (Romberg algorithm, improved Euler, Runge Kutta method composite Simpson), Matlab ma
Microgrid_dynamic_programming
- 孤岛型微电网能量管理，包含PV, wind, microturbine generator, diesel generator， 采用动态二次规划和内点法。(Matlab scr ipt for energy management of islanded microgrid with PV, wind, microturbine generator, diesel genrator. Dynamic quadratic programming using interior point metho
Maxsum
- 用蛮力法、分治法、动态规划法实现最大子段和(There is MaxSums in three way.)
动态规划与排队论程序代码-5
- 排队论，解决一系列动态排队的问题，是很好的算法代码，可以直接用(Queuing theory, to solve a series of dynamic queuing problems, is a good algorithm code, can be used directly)
路径规划避碰
- 使用matlab做的一个模拟避碰的路径规划，包含一个静态障碍物与一个动态障碍物，可以运行！
数学建模算法全收录799页
- 数学建模 线性规划 整数规划 非线性规划 动态规划(mathematical modeling)
Dstar动态路径规划算法
- 用于动态路径寻优的D*算法，可以运行出完整的路径，具有一定的参考价值(D* algorithm for dynamic path optimization, can run)
Matlab_动态窗口法_demo
- 本文件是机器人动态窗口法的源代码，用于实现机器人在障碍环境下的模拟避碰仿真。(This file contains the source code of the robot dynamic window method, which is used to realize the simulation of the robot in the obstacle environment.)