Search
This paper reviews the theory of search. The viewpoint is mainly statistical but connections with other fields such as logic and optimization are explored also. Within statistics, screening and group- testing are areas where search methodologies have been employed directly. The dominating ideas of the basic theory are consistency, entropy and Bayes methods. The links between search methods, logic (true, false) and coding theory are shown in depth but the more profound relationships such as between search, packing information and computability are briefly discussed. A broad separation in the area of such methods is between sequential and nonsequential procedures. Most of the review is taken up by sequential procedures. However, some basic work on nonsequential procedures which provide bench-marks for the optimality of sequential procedures, is also explored.
- Search mechanisms
- A universal search scheme for a single significant factor in a disjunctive model
- Search problems: One, two or many rounds
- The theory of search from a statistical viewpoint. (With discussion)
- Probabilistic existence theorems in group testing
- An asymptotic theory for recurrence relations based on minimization and maximization.
- Existence theorems for some group testing strategies
- Random and quasi-random designs in group testing
- Sure success partial search
- scientific article; zbMATH DE number 2079406 (Why is no real title available?)
- Search combinators
- Bayesian criteria for non-zero effects detection under skew-normal search model
- Physical search
- Human-guided search
- Nonadaptive group testing with lies: probabilistic existence theorems
This page was built for publication: Search
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1194277)
