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

DOI10.1134/S0032946019040057zbMath1458.68203OpenAlexW3001771833WikidataQ126292426 ScholiaQ126292426MaRDI QIDQ2190927

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

optimal algorithmtestadaptive strategycombinatorial search

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Fault-tolerant search algorithms. Reliable computation with unreliable information
• Coding with noiseless feedback
• A Combinatorial Model of Two-Sided Search
• A Combinatorial Model of Two-Sided Search

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