Location:
Search - conquer
Search list
Description: Divide:
the problem into a number of subproblems that are themselves smaller instances of the same type of problem.
Conquer:
Recursively solving these subproblems. If the subproblems are small enough, solve them straightforward.
Combine:
the solutions to the subproblems into
the solution of original problem.
Platform: |
Size: 279699 |
Author: supercat188 |
Hits:
Description: 这是一个分治法应用和递归的完美体现，它根据输入的数字在屏幕上打出美丽的图案。-this is a separate rule and the application of recursive the perfect embodiment of its import figures on the screen making beautiful designs.
Platform: |
Size: 1024 |
Author: 唐海浪 |
Hits:
Description: Delaunay三角网作为一种主要的DTM表尔法，具有权其广泛的用途。经过二十多年来的研究，它的生成算法巳趋于成熟。本文简要介绍了Delaunay三角网的定又及其特性，在简单回顾和评价了分割—归并法，逐点插入法，三角冈生长法等三类主沈算法的基础上，提出了一个融以上算法优点于一体，兼顾空间与时间性能的合成算法。经测试，一般情况下它的运算速度远快于逐点插入法，与分割—归并法相当，较好的情况下快于分割—归并法。-Delaunay Triangulation as a major DTM Fall table, with the right to its extensive use. After 20 years of study, which had been generating algorithm is maturing. This paper introduces a Delaunay Triangulation and another set of characteristics, in a brief review and evaluation of the divide-conquer method, point by point insertion method, the supraspinatus Growth Triangle law Shen three main algorithm on the basis of the above algorithm into an advantage in that balanced space and time performance of synthesis algorithm. After tests, under normal circumstances it's computational speed much faster than the insertion point by point, and the divide-conquer method rather, a better situation faster than divide-conquer method.
Platform: |
Size: 3833856 |
Author: 苏聪 |
Hits:
Description: 残缺棋盘问题的VC++实现，用分而治之方法解决此问题-Defective chessboard problem VC++ Realize, using divide and conquer method to solve this problem
Platform: |
Size: 477184 |
Author: 吕鹏 |
Hits:
Description: Divide:
the problem into a number of subproblems that are themselves smaller instances of the same type of problem.
Conquer:
Recursively solving these subproblems. If the subproblems are small enough, solve them straightforward.
Combine:
the solutions to the subproblems into
the solution of original problem.-Divide: the problem into a number of subproblems that are themselves smaller instances of the same type of problem. Conquer: Recursively solving these subproblems. If the subproblems are small enough, solve them straightforward.Combine: the solutions to the subproblems into the solution of original problem.
Platform: |
Size: 279552 |
Author: supercat188 |
Hits:
Description: 征服服务端需要的东西!1、framework 2.0
2、PostgreSQL 8.2
3、征服服务端模拟器
4、征服最新客户端
5、征服1.6版补丁 -To conquer the server needs! 1, framework 2.0 2, PostgreSQL 8.2 3, to conquer the server simulator 4, conquest最新客户端5, conquest version 1.6 patch
Platform: |
Size: 1360896 |
Author: 123 |
Hits:
Description: 网络游戏征服的服务端部分完整源码 VC编译
绝少的源码
有兴趣的可以-Conquer online game service client part of the full source code VC compiler source code is rarely of interest can be
Platform: |
Size: 212992 |
Author: octal |
Hits:
Description: 征服私服要有的东西 /-Things have conquer私服/
Platform: |
Size: 486400 |
Author: 123 |
Hits:
Description: 基于divide and conquer策略的Sutherland-Hodgeman多边形裁剪算法的Matlab程序-Divide and conquer strategy based on the Sutherland-Hodgeman polygon clipping algorithm of Matlab procedures
Platform: |
Size: 2048 |
Author: 章礼平 |
Hits:
Description: Conquer Database working 100 percent-Conquer Database working 100 percent
Platform: |
Size: 327680 |
Author: Spy520 |
Hits:
Description: Conquer Database v2 working
Platform: |
Size: 466944 |
Author: Spy520 |
Hits:
Description: Conquer v3 Database working
Platform: |
Size: 221184 |
Author: Spy520 |
Hits:
Description: DIVIDE AND CONQUER SLIDES IN ALGORITHMS
Platform: |
Size: 50176 |
Author: ali |
Hits:
Description: 本算法使用分治法求解最近点对问题。事先用O(nlogn)时间对x坐标进行排序，使得所有的点是按x坐标从小到大排好序的（x坐标相同时y坐标小的排前），然后取下标小于n/2属于左边的点集PL，取下标大于n/2属于右边的点集PR，即用O(1)时间就可以将规模为n的问题分解为两个规模为n/2的、同类型的子问题。分割完毕之后就可以采用分治法，分别求出PL和PR中的最近点对，最终通过递归实现。-This algorithm uses divide and conquer to solve the problem closest point. Prior to use O (nlogn) time to sort the x coordinate so that all points are based on x coordinates from small to large sorted (x coordinates with the same y coordinates of the small, the top), and then remove the standard is less than n/2 the set of points belonging to the left PL, remove the standard is greater than n/2 set of points belonging to the right of PR, that is to use O (1) time can be the problem size n divided into two size n/2, the same type The sub-problems. Segmentation can be used after completion of sub-rule method, respectively, find the PL and PR in the last points and eventually through the recursion.
Platform: |
Size: 25600 |
Author: lhguo |
Hits:
Description: 这本书的名字是《战胜VC++必备50题》，由浅入深，简单易懂，初学者必备。-the name of this book is <50 exercise to conquer VC++>, from easy to hard, it s of value for beginner.
Platform: |
Size: 7742464 |
Author: wangxiaoli |
Hits:
Description: Co luncher for conquer privite server
Platform: |
Size: 811008 |
Author: zeko2010ss |
Hits:
Description: VC++ 分治法大整数乘法-VC++ divide and conquer large integer multiplication
Platform: |
Size: 10240 |
Author: dnybz |
Hits:
Description: Conquer online Source Code Patch 5165
Platform: |
Size: 8726528 |
Author: mahmoud |
Hits:
Description: Kings^OF^Binary Source File Conquer Online
Platform: |
Size: 2102272 |
Author: Kings_Of_Binary |
Hits:
Description: 征服5506版，带数据库，正常编译，能开区。(Conquer the 5506 edition, with database, normal compilation, can open area.)
Platform: |
Size: 8915968 |
Author: Dirpunk |
Hits:
« 12
3
4
5
6
7
8
9
10
...
30
»