Ratewise-optimal non-sequential search strategies under constraints on the tests

DOI10.1016/J.DAM.2006.06.013zbMATH Open1181.68126OpenAlexW2076897626MaRDI QIDQ947084FDOQ947084

Authors: Rudolf Ahlswede 

Publication date: 29 September 2008

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2006.06.013

Recommendations

• scientific article; zbMATH DE number 1617287
• Least adaptive optimal search with unreliable tests
• Combinatorial search in two and more rounds
• Perfect minimally adaptive \(q\)-ary search with unreliable tests
• On two random search problems

zbMATH Keywords

search strategies

Mathematics Subject Classification ID

Combinatorics in computer science (68R05) Measures of information, entropy (94A17) Searching and sorting (68P10)

Cites Work

• On the covering of vertices for fault diagnosis in hypercubes
• Title not available (Why is that?)
• Elimination of correlation in random codes for arbitrarily varying channels
• Title not available (Why is that?)
• Title not available (Why is that?)
• On separating systems of a finite set
• On separating systems whose elements are sets of at most k elements
• On the theory of random search

Cited In (9)

• Optimal versus randomized search of fixed length binary words
• Title not available (Why is that?)
• Title not available (Why is that?)
• Rounds in combinatorial search
• Identifying defective sets using queries of small size
• On separating systems with bounded set size
• Title not available (Why is that?)
• Evolutionary Computation in Combinatorial Optimization
• On two random search problems

This page was built for publication: Ratewise-optimal non-sequential search strategies under constraints on the tests

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q947084)