两类“称球问题”的统一非序列解

A Nonsequential Solution for Two Different Versions of the Weighing Problem

讨论称球问题的两个版本,通过综合文中华[湘潭大学自然科学学报,2004,26(1):42-48]和Born[InformationProcessing Letters,2003,86:137-141]的研究结果,给出一种可同时用于解决两个问题的通用算法.算法生成的方案是非序列的,且对于这两个版本而言都是最优的.

By synthesizing results from Wen [Natural Science joumal of Xiangtan University ,2004,26（ 1 ） ：42 - 48] and Born et. al. [ Information Processing Letters, 2003,86 ： 137 - 141 ], this paper presents an algorithm that generates nonsequential schemes capable of solving two different versions （ the original one and the ＂search - only＂ one） of the weighing problem simultaneously. Schemes generated by the algorithm are shown to be optimal for both versions.