Searching with lies under error transition cost constraints

DOI10.1016/J.ENDM.2005.07.018zbMATH Open1158.68487OpenAlexW2036571216MaRDI QIDQ3439239FDOQ3439239

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

• Title not available (Why is that?)
• Title not available (Why is that?)
• Searching games with errors -- fifty years of coping with liars
• Perfect two-fault tolerant search with minimum adaptiveness
• The liar game over an arbitrary channel
• Title not available (Why is that?)
• Algorithms and Computation
• Title not available (Why is that?)
• Least adaptive optimal search with unreliable tests
• Computing and Combinatorics
• Title not available (Why is that?)
• Title not available (Why is that?)

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)