Searching with lies under error transition cost constraints

DOI10.1016/j.endm.2005.07.018zbMath1158.68487OpenAlexW2036571216MaRDI QIDQ3439239

Ferdinando Cicalese, Christian Deppe

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

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Perfect two-fault tolerant search with minimum adaptiveness
• The liar game over an arbitrary channel
• Computing and Combinatorics
• Algorithms and Computation
• Searching games with errors -- fifty years of coping with liars
• Least adaptive optimal search with unreliable tests

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