scientific article

Publication date: 1987

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

sorting stochastic approximation probability distribution coding counterfeit coin statistical decision theory worst case analysis binary search special element optimal search policy chance errors minimal allocation of limited resources weighting problems

Mathematics Subject Classification ID

Searching and sorting (68P10) Search theory (90B40) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Empirical decision procedures; empirical Bayes procedures (62C12) Coding theorems (Shannon theory) (94A24) General considerations in statistical decision theory (62C05)

Related Items

On binary search trees ⋮ Strategies for the Renyi--Ulam game with fixed number of lies ⋮ On the tree search problem with non-uniform costs ⋮ Querying with Uncertainty ⋮ Searching for a Non-adversarial, Uncooperative Agent on a Cycle ⋮ New lower bounds on the cost of binary search trees ⋮ Evacuating from \(\ell_p\) unit disks in the wireless model (extended abstract) ⋮ Edge search in hypergraphs ⋮ On Maximum Discounted Effort Reward Search Problem ⋮ Complexity of searching an immobile hider in a graph ⋮ Evacuating an Equilateral Triangle in the Face-to-Face Model ⋮ God save the queen ⋮ Evacuating Robots from a Disk Using Face-to-Face Communication (Extended Abstract) ⋮ Entangled rendezvous: a possible application of Bell non-locality for mobile agents on networks ⋮ Evacuating two robots from multiple unknown exits in a circle ⋮ Probabilistic existence theorems in group testing ⋮ Evacuating from \(\ell_p\) unit disks in the wireless model ⋮ Stacking Designs: Designing Multifidelity Computer Experiments with Target Predictive Accuracy ⋮ Optimal Sets of Questions for Twenty Questions ⋮ Overcoming probabilistic faults in disoriented linear search ⋮ Optimal circle search despite the presence of faulty robots ⋮ Delivery to safety with two cooperating robots ⋮ Algorithms for \(p\)-Faulty Search on a half-line ⋮ Evacuating equilateral triangles and squares in the face-to-face model ⋮ Treasure evacuation with one robot on a disk ⋮ A search problem on a bipartite network ⋮ Identification of partial disjunction, parity, and threshold functions ⋮ Dynamic Trees with Almost-Optimal Access Cost ⋮ Minimax trees in linear time with applications ⋮ Finding at least one excellent element in two rounds ⋮ Optimal binary search trees ⋮ Nonadaptive group testing with lies: probabilistic existence theorems ⋮ Searching games with errors -- fifty years of coping with liars ⋮ Searching for a non-adversarial, uncooperative agent on a cycle ⋮ Priority evacuation from a disk: the case of \(n = 1,2,3\) ⋮ Optimization of sequential-parallel search for objects for the model of the distributed Poisson flow of their appearance ⋮ Edge search in graphs and hypergraphs of bounded rank ⋮ Separation with restricted families of sets ⋮ Binary search with delayed and missing answers ⋮ Byzantine fault tolerant symmetric-persistent circle evacuation ⋮ Time-energy tradeoffs for evacuation by two robots in the wireless model ⋮ Byzantine fault tolerant symmetric-persistent circle evacuation ⋮ On the cost of unsuccessful searches in search trees with two-way comparisons ⋮ Rounds in a combinatorial search problem ⋮ Disjoint Spread Systems and Fault Location ⋮ On the cut-off point for combinatorial group testing ⋮ Searching for two counterfeit coins with two-arms balance ⋮ Weighted group search on a line \& implications to the priority evacuation problem ⋮ Testing of Hypothesis and Identification