Description: 最接近点对问题，分治法实现，随机生成N个数寻找最短路径的两个点-closest point of the problem, realizing the partition method, random number generation N to find the shortest path to the two points Platform: |
Size: 1369 |
Author:张亮 |
Hits:
Description: 给定一块宽度为W的矩形板，矩形板的高度不受限制。现需要从板上分别切割出n个高度为hi，宽度为wi的矩形零件。切割的规则是零件的高度方向与矩形板的高度方向保持一致。要求求出一种切割法使得所使用的矩形板的高度h最小．用递归及分治法解此问题-given a width of the rectangular plate W, the height of rectangular plate unrestricted. Board is required from the respective cut out n height of the hi, wi width of the rectangular parts. Cutting parts to the rules of the height of the rectangular plate with a high degree of consistent direction. Asked obtained a law made by cutting the use of the rectangular plate height h minimum. Using recursive and partition Solving this problem Platform: |
Size: 1373 |
Author:叶黎 |
Hits:
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:
Description: 该程序实现对一维数据轴上的最临近点的求解问题 采用方法：分治方法1（该方法在递归时由于使用数组的值，使得递归进栈的数据很多，消耗系统空间很大，所以处理的个数经测试不超过70个，可见在设计程序时，考虑空间的使用也是很必要的！）-the process of achieving a dimensional data axis near the point of the methodology used to solve the problem : a partition method (the method when the use of recursive array, which makes the recursive stack into many of the data, consume much space, the number of tested not more than 70, based in Visibility terms procedures, the use of space is also necessary!) Platform: |
Size: 1996 |
Author:杨晨 |
Hits:
Description: 实现查找一组给定点中的最近点对，通过分治方法将问题求解，简化问题的复杂性。-Lookup a group to the latest sentinel points right, adoption of the partition method of problem solving, simplifying the complexity of the problem. Platform: |
Size: 1378 |
Author:韩希先 |
Hits:
Description: 动态规划----矩阵连乘问题 动态规划法是解决问题的一种方法。它不规定为了得到结果需如何将问题划分为子问题的固定方法，而是按不同输入给出问题的具体实例的子问题划分方法，然后再进行运算、解答问题。 矩阵连乘问题的主要思想如下： 1）设置大小为连乘个数的方阵 2）主对角线上方各元素Di,j(i<j)表示矩阵Mi连乘到Mj的最小工作量 3）下方元素Di,j(i>j)记录获得该最小工作量矩阵分组的第一组的最后一个矩阵的序列号 最后通过下方元素可知最终结果的分组方式。-dynamic programming matrix continually multiply-dynamic programming problem is a problem-solving method. It does not require the results need to be how to divide the problems of the sub - problems fixed, but different input given by the specific example of the problem partition method, and then calculate, and answer questions. Matrix continually multiply the main idea is as follows : 1) the installation of the size of continually multiply the number phalanx 2) above the main diagonal elements Di, j (ilt; J) Matrix Mi continually multiply to the smallest workload 3) below elements Di, j (IGT; J) the record was the smallest workload of a matrix of the first group of a matrix of the final sequence, followed by the final element of the final results of the known clusters. Platform: |
Size: 27011 |
Author:莫非 |
Hits:
Description: This paper presents a novel segmentation algorithm for metallographic images, especially those objects without regular boundaries and homogeneous intensity. In metallographic quantification, the complex microstructures make the conventional approaches hard to achieve a satisfactory partition. We formulate the segmentation procedure as a new framework of iterative watershed region growing constrained by the ridge information. The seeds are selected by an effective double-threshold approach, and the ridges are superimposed as the highest waterlines in watershed transform. To tackle the over-segmentation problem, the blobs are merged iteratively with the utilization of Bayes classification rule. Experimental results show that the algorithm is effective in performing segmentation without too much parameter tuning. Platform: |
Size: 712264 |
Author:jjrs05 |
Hits:
Description: 数学隔板问题研究，对现实问题的较好解决，能都对一些编程问题有思路引导-Partition problem of mathematical research, the better to solve the practical problems that can have some ideas to guide programming problem Platform: |
Size: 32768 |
Author:张鹏 |
Hits:
Description: 這是有關一個名為set partition的原始碼
set partition是acm問題中的其中一個-It is about a named set partition of the source code is a set partition problem in one of the acm Platform: |
Size: 23552 |
Author:Wayne |
Hits:
Description: 计算两个字符串的最小公共子串划分（MCSP）。最小公共子串划分（MCSP)是指把两个字符串划分成相同的子串的集合，同时要求划分的子串数目最少。比如，S1 = cdabcdabceab，S2 = abceabcdabcd,求得的MCSP是(cdabcd, abceab), (abceab, cdabcd).MCSP问题是基因重组中的关键问题，并且与用逆转重复字串进行排序的问题十分相近。MCSP问题是NP难的。-The code is to compute MCSP of two given strings. The Minimum Common String Partition problem (MCSP) is to partition two given input strings into the same collection of substrings, where the number of substrings in the partition is minimized. This problem is a key problem in genome rearrangement, and is closely
related to the problem of sorting by reversals with duplicates. MCSP is NP-hard, even for the most trivial case, 2-MCSP, where each letter occurs at most twice in each input string. Platform: |
Size: 3072 |
Author:luckypig |
Hits:
Description: 算法设计与分析的一道题目：石子划分问题（适用于上课实验）-Algorithm design and analysis of a topic: stone partition problem (for class experiment) Platform: |
Size: 1024 |
Author:莫问天 |
Hits:
Description: 整数划分问题 整数划分问题 整数划分问题 -Integer integer partitioning problem by the problem division problem integer integer integer partition problem issue by issue integer division Platform: |
Size: 187392 |
Author:ilove |
Hits:
Description: 对图像进行高斯金字塔设计，以及根据多尺度划分问题。-To do image gaussian pyramid design, and according to the multi-scale partition problem. Platform: |
Size: 1024 |
Author:林王 |
Hits:
Description: 集合划分问题。给定正整数 n，计算出n 个元素的集合{1,2, , n }可以划分为多少个不同的非空子集。-Set partitioning problem. Given a positive integer n, calculate the n elements of the set {1,2, , n} can be divided into a number of different non-empty sets. Platform: |
Size: 1024 |
Author:Kerwin |
Hits:
Description: 里面有五个C语言初学者遇到的经典递归问题的代码及详解！八皇后、回文、顺转矩阵、斐波那契及整数分划问题。-There are five classic C language for beginners recursive problems encountered by the code and explain! Eight queens, palindrome, clockwise rotation matrix, Fibonacci and integer partition problem. Platform: |
Size: 47104 |
Author:李展 |
Hits:
Description: 本文包含本人亲自写的两个ACM的小算法，一个是石子划分问题另一个是服务器转移问题，全是用的是动态规划算法，经试验，这两个算法运行效率极高-This article contains personally wrote two small ACM algorithm, a stone partition problem is transferred to another is a server problem, all using a dynamic programming algorithm, and tested, these two very efficient algorithm runs Platform: |
Size: 1024 |
Author:110 |
Hits:
Description: 采用贪心算法来解决部分背包问题，简化了动态规划思想，提高了算法效率-Use the greedy algorithm to solve some of the knapsack problem, simplify the dynamic programming, improving the efficiency of the algorithm Platform: |
Size: 606208 |
Author:wlz |
Hits:
Description: 整数划分问题 编程序求某一个正整数的所有划分数-Integer partition problem all programmed to seek a number of divisions a positive integer. Platform: |
Size: 1024 |
Author:Adrian |
Hits:
Search - partition problem