文件名称:dongtaiguihua-suanfa-source-code
- 所属分类:
- 数值算法/人工智能
- 资源属性:
- [Windows] [Visual C] [源码]
- 上传时间:
- 2012-11-26
- 文件大小:
- 315kb
- 下载次数:
- 0次
- 提 供 者:
- liuxi*****
- 相关连接:
- 无
- 下载说明:
- 别用迅雷下载,失败请重下,重下不扣分!
介绍说明--下载内容均来自于网络,请自行研究使用
分别用动态规划的算法,用手工解决资源分配的问题。另一个是编程解决下面的问题:
一凸8 边形P 的顶点顺时针为{v1,v2,… ,v8},任意两顶点间的线段的权重由矩阵D 给出。若vi 与vj 是P 上不相邻的两个顶点,则线段vivj 称为P 的一条弦。求P 的一个弦的集合T,使得T 中所有的弦恰好将P 分割成互不重迭的三角形,且各三角形的权重之和为最小(一个三角形的权重是其各边的权重之和)。-Respectively dynamic programming algorithm, hand address the resource allocation problem. The other is programmed to solve the following problem: a convex 8-gon P, vertex clockwise of (v1, v2, ..., v8), any two vertices of the segment between the weight given by the matrix D. If vi and vj is the P is not adjacent to two vertices, then the line segment vivj known as P, a string. Seeking P, a set of strings T, makes the T all the strings just to P divided into non-overlapping triangles, and the weight of each triangle and for the minimum (the weight of a triangle is its weight of each side and) .
一凸8 边形P 的顶点顺时针为{v1,v2,… ,v8},任意两顶点间的线段的权重由矩阵D 给出。若vi 与vj 是P 上不相邻的两个顶点,则线段vivj 称为P 的一条弦。求P 的一个弦的集合T,使得T 中所有的弦恰好将P 分割成互不重迭的三角形,且各三角形的权重之和为最小(一个三角形的权重是其各边的权重之和)。-Respectively dynamic programming algorithm, hand address the resource allocation problem. The other is programmed to solve the following problem: a convex 8-gon P, vertex clockwise of (v1, v2, ..., v8), any two vertices of the segment between the weight given by the matrix D. If vi and vj is the P is not adjacent to two vertices, then the line segment vivj known as P, a string. Seeking P, a set of strings T, makes the T all the strings just to P divided into non-overlapping triangles, and the weight of each triangle and for the minimum (the weight of a triangle is its weight of each side and) .
(系统自动生成,下载前可以参看下载内容)
下载文件列表
两个动态规划的问题.pdf
这两个问题的解决办法-手工算法和程序说明.doc
project-algrithm\Debug\trangle.obj
................\.....\trangle.sbr
................\.....\vc60.idb
................\.....\vc60.pdb
................\.....\xiaoxia_algrithm.bsc
................\.....\xiaoxia_algrithm.exe
................\.....\xiaoxia_algrithm.ilk
................\.....\xiaoxia_algrithm.pch
................\.....\xiaoxia_algrithm.pdb
................\trangle.c
................\xiaoxia_algrithm.dsp
................\xiaoxia_algrithm.dsw
................\xiaoxia_algrithm.ncb
................\xiaoxia_algrithm.opt
................\xiaoxia_algrithm.plg
................\Debug
project-algrithm
这两个问题的解决办法-手工算法和程序说明.doc
project-algrithm\Debug\trangle.obj
................\.....\trangle.sbr
................\.....\vc60.idb
................\.....\vc60.pdb
................\.....\xiaoxia_algrithm.bsc
................\.....\xiaoxia_algrithm.exe
................\.....\xiaoxia_algrithm.ilk
................\.....\xiaoxia_algrithm.pch
................\.....\xiaoxia_algrithm.pdb
................\trangle.c
................\xiaoxia_algrithm.dsp
................\xiaoxia_algrithm.dsw
................\xiaoxia_algrithm.ncb
................\xiaoxia_algrithm.opt
................\xiaoxia_algrithm.plg
................\Debug
project-algrithm