Search for a moving element with the minimum total cardinality of tests

DOI10.1134/S0032946019040057MaRDI QIDQ2190927zbMATH OpenOpenAlexWikidataFDO

Authors Yanyan Li

Publication date 23 June 2020

Published in Problems of Information Transmission (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1134/s0032946019040057

zbMATH Keywords

adaptive strategycombinatorial searchoptimal algorithmtest

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Recommendations

• scientific article; zbMATH DE number 3900555
• Technical Note—An Upper Bound Useful in Optimizing Search for a Moving Target
• Optimal search for a randomly moving object
• Optimal search for moving objects in a discrete domain
• Search for a moving object in a problem with many searchers
• scientific article; zbMATH DE number 3910122
• Search for a moving target in a graph
• On Discrete Search for a Multiple Number of Objects
• Solving the moving target search problem using indistinguishable searchers
• scientific article; zbMATH DE number 3968305

Cites work

• A combinatorial model of two-sided search
• A Combinatorial Model of Two-Sided Search
• Coding with noiseless feedback
• Fault-tolerant search algorithms. Reliable computation with unreliable information
• scientific article; zbMATH DE number 4209901 (Why is no real title available?)
• scientific article; zbMATH DE number 1508646 (Why is no real title available?)

This page was built for publication: Search for a moving element with the minimum total cardinality of tests

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