Referenced Items are not available for this document.
A combinatorial search problem can be defined as follows: Given a set W={w 1, w2,..., wm} of m words over a (binary) alphabet Σ, design a sequence of tests that successfully find the word w* ∈ W being sought. The prime goal of the optimal search is to find the sought word w* with the smallest maximum or average search time. Here, we deal with a randomly selected set W of m binary words of fixed length n, that is, the set W={w1,... wm} is chosen with equal probability among all possible subsets of size m.
Published in:
Information Theory, 2002. Proceedings. 2002 IEEE International Symposium on
Date of Conference: 2002
- Print ISBN:
- 0-7803-7501-7
- INSPEC Accession Number:
- 7636038
- Digital Object Identifier :
- 10.1109/ISIT.2002.1023477
- Product Type:
- Conference Publications
About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies
A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.
