On the theory of random search
From MaRDI portal
Publication:5512642
DOI10.1090/S0002-9904-1965-11402-1zbMath0138.14706MaRDI QIDQ5512642
Publication date: 1965
Published in: Bulletin of the American Mathematical Society (Search for Journal in Brave)
Related Items
On the most rational algorithm of recognition, COMPARISON OF COSTS FOR MULTI-STAGE GROUP TESTING METHODS IN THE PHARMACEUTICAL INDUSTRY, Exact learning from an honest teacher that answers membership queries, Searching with known error probability, Traitement des informations chez les etres vivants: Systemes a services par essais successifs, Probabilistic existence theorems in group testing, Sequential search using question-sets with bounded intersections, Ratewise-optimal non-sequential search strategies under constraints on the tests, Unnamed Item, Superimposed codes for the search model of a. renyi, Nonadaptive group testing with lies: probabilistic existence theorems, Optimal superimposed codes and designs for Renyi's search model, A discrete theory of search. II, Existence theorems for some group testing strategies, Pharmaceutical Applications of a Multi-Stage Group Testing Method, Counting distinctions: on the conceptual foundations of Shannon's information theory, Random rates in anisotropic regression. (With discussion), On two random search problems
Cites Work
