| 多装置并行搜索单目标的最优方法 |
| |
| 引用本文： | 刘文安,崔欢欢,刘洋. 多装置并行搜索单目标的最优方法[J]. 河南师范大学学报(自然科学版), 2006, 34(3): 211-214 |
| |
| 作者姓名： | 刘文安 崔欢欢 刘洋 |
| |
| 作者单位： | 1. 河南师范大学,数学与信息科学学院,河南,新乡,453007
2. 北京大学,数学科学学院,北京100871 |
| |
| 基金项目： | 国家高技术研究发展计划(863计划) |
| |
| 摘 要： | 研究以b个天平为试验装置,如何用最少的试验次数从n个硬币中识别出所含的唯一轻币的并行搜索模型.这是对试验装置为一个天平的推广.论文构造出具有最少试验次数的最坏情况序列算法以及最坏情况预确定算法.此外研究了两个相关的模型,得到了精确的最少试验次数.
|
| 关 键 词： | 搜索 b个天平 最坏情况 序列算法 预确定算法 |
| 文章编号： | 1000-2367(2006)03-0211-04 |
| 收稿时间： | 2005-10-13 |
| 修稿时间： | 2005-10-13 |
Optimal Approach of Parallel Search for an Object with Multi-devices |
| |
| LIU Wen-an,CUI Huan-huan,LIU Yang. Optimal Approach of Parallel Search for an Object with Multi-devices[J]. Journal of Henan Normal University(Natural Science), 2006, 34(3): 211-214 |
| |
| Authors: | LIU Wen-an CUI Huan-huan LIU Yang |
| |
| Affiliation: | 1. College of Mathematics and Information Science, Henan Normal University, Xinxiang 453007, China; 2. School of Mathematics Science,Peking Unlversity,Beijing 100871 ,China |
| |
| Abstract: | The following parallel search model is studied: How to identify the only one light coin from a set of n coins by using the minimal number of tests when the test devices are b balances.This model is the generalization of one balance.We establish the worst-case sequential and predetermined algorithms with the minimal number of tests.Meanwhile,two relative models are also studied,the exact results on the minimal number of tests are determined for both models. |
| |
| Keywords: | search b balances worst-case sequential algorithm predetermined algorithm |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
