Searching with lies under error transition cost constraints

DOI10.1016/J.ENDM.2005.07.018MaRDI QIDQ3439239zbMATH OpenOpenAlexFDO

Authors Ferdinando Cicalese, Christian Deppe, Rudolf Ahlswede

Publication date 29 May 2007

Published in Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.endm.2005.07.018

Mathematics Subject Classification ID

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

Cites work

• scientific article; zbMATH DE number 1577986 (Why is no real title available?)
• scientific article; zbMATH DE number 3547240 (Why is no real title available?)
• scientific article; zbMATH DE number 1226239 (Why is no real title available?)
• scientific article; zbMATH DE number 1405795 (Why is no real title available?)
• scientific article; zbMATH DE number 3205803 (Why is no real title available?)
• scientific article; zbMATH DE number 3282350 (Why is no real title available?)
• Algorithms and Computation
• Computing and Combinatorics
• Least adaptive optimal search with unreliable tests
• Perfect two-fault tolerant search with minimum adaptiveness
• Searching games with errors -- fifty years of coping with liars
• The liar game over an arbitrary channel

This page was built for publication: Searching with lies under error transition cost constraints

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