| 油井管道问题的分治解法 |
| |
| 引用本文： | 时书剑,王相海. 油井管道问题的分治解法[J]. 计算机工程与应用, 2004, 40(21): 210-212 |
| |
| 作者姓名： | 时书剑 王相海 |
| |
| 作者单位： | 辽宁师范大学 |
| |
| 基金项目： | 信息安全国家重点实验室开放课题基金项目，大连市科技基金项目资助 |
| |
| 摘 要： | 分治算法是解决许多实际问题的重要而有效的方法。该文首先对油井的管道问题进行了分析,然后提出一种基于分治策略的解决方案,并给出了其实现算法,最后对所提出算法的复杂度进行了分析。
|
| 关 键 词： | 管道 分治算法 时间复杂性 |
| 文章编号： | 1002-8331-(2004)21-0210-03 |
The Divide-and-Conquer Algorithm to Find the Pipeline for Oil Well |
| |
| Shi Shujian Wang Xianghai. The Divide-and-Conquer Algorithm to Find the Pipeline for Oil Well[J]. Computer Engineering and Applications, 2004, 40(21): 210-212 |
| |
| Authors: | Shi Shujian Wang Xianghai |
| |
| Abstract: | The divide and conquer algorithm is an important and efficient method to many problems.In this paper,the pipeline problem of the oil well is analzed firstly.And then an efficient algorithm based on divide -and -conquer algorithm is proposed.At the end,the time complexity of the proposed algorithm is analyzed.Simulation results show the proposed algorithm is effective. |
| |
| Keywords: | pipeline divide-and-conquer algorithm time complexity |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
