Abstract
Given some unknown object belonging to a known finite set of n possibilities, it is required to determine its identity by successive comparisons with each of the possibilities. Associating with each of these possibilities a testing cost and a probability that it is identical to the unknown object, we would like to obtain such a testing procedure which has minimum expected testing cost. Intuitively, it would appear that one should proceed by always applying the remaining test with least cost/probability ratio. We show that this technique does not necessarily yield the optimal procedure and present an algorithm which determines the optimal testing sequence in a number of steps proportional to n · log <inf xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">2</inf> n.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
