scientific article
From MaRDI portal
Publication:3861131
zbMath0425.90022MaRDI QIDQ3861131
Publication date: 1979
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
identificationstochastic approximationinformation theorysearch theoryprefix codesbinary search treessyphilisrank orderinghealth and carenoiseless codingalphabetic codesmedical investigation
Search theory (90B40) Medical applications (general) (92C50) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to operations research and mathematical programming (90-01) Operations research and management science (90B99) Information theory (general) (94A15) Prefix, length-variable, comma-free codes (94A45) Coding theorems (Shannon theory) (94A24)
Related Items
On polychotomous search problems ⋮ Search problems on graphs ⋮ A ternary search problem on graphs ⋮ A group testing problem for hypergraphs of bounded rank ⋮ On a group testing problem: characterization of graphs with 2-complexity and maximum number of edges ⋮ Upper and lower bounds for competitive group testing ⋮ A search problem on graphs which generalizes some group testing problems with two defectives ⋮ Ratewise-optimal non-sequential search strategies under constraints on the tests ⋮ An NP-completeness result of edge search in graphs ⋮ A Combinatorial Model of Two-Sided Search ⋮ Controlled search for targets arriving according to a spatio-temporal Poisson point process by an information measurement system with inhomogeneous scope ⋮ Creating order in sequence spaces with simple machines ⋮ Searching for an edge in a graph with restricted test sets ⋮ Edge search in graphs with restricted test sets ⋮ Optimal search paths for random variables ⋮ Universal retrieval trees ⋮ On finding non-randomized minimax tests for statistical decision problems with applications to signal detection
