[图书][B] Fault-Tolerant Search Algorithms

F Cicalese - 2013 - Springer
The study of the effect that errors may have on computation started at the very beginning of
the history of computer science. It dates back to the early 1950s, to the research by von …

Oml: Open, monetizable, and loyal ai

Z Cheng, E Contente, B Finch, O Golev… - arXiv preprint arXiv …, 2024 - arxiv.org
Artificial Intelligence (AI) has steadily improved across a wide range of tasks. However, the
development and deployment of AI are almost entirely controlled by a few powerful …

Recent developments of feedback coding and its relations with many-valued logic

F Cicalese*, D Mundici - Proof, Computation and Agency: Logic at the …, 2011 - Springer
The basic problem of feedback coding is vividly described by Rényi [23, p. 47] as a problem
of fault-tolerant adaptive search with errors, as follows:[…] I made up the following version …

Correcting one error in non-binary channels with feedback

I Vorobyev, V Lebedev… - 2023 IEEE International …, 2023 - ieeexplore.ieee.org
In this paper, the problem of correction of a single error in q-ary symmetric channel with
noiseless feedback is considered. We propose an algorithm to construct codes with …

Group testing

F Cicalese, F Cicalese - Fault-Tolerant Search Algorithms: Reliable …, 2013 - Springer
Group testing is a search model which first appeared in the context of a biomedical
application, in the last years of the Second World War. It became clear that large amounts of …

Two batch search with lie cost

R Ahlswede, F Cicalese, C Deppe… - IEEE transactions on …, 2009 - ieeexplore.ieee.org
We consider the problem of searching for an unknown number in the search space U={0,...,
M-1}. q-ary questions can be asked and some of the answers may be wrong. An arbitrary …

Two cooperative versions of the Guessing Secrets problem

G Sergioli, A Ledda, F Paoli, R Giuntini, T Kowalski… - Information …, 2009 - Elsevier
We investigate two cooperative variants (with and without lies) of the Guessing Secrets
problem, introduced in [L. Chung, R. Graham, FT Leighton, Guessing secrets, Electronic …

Correcting errors in asymmetric and generalized asymmetric channels with feedback

I Vorobyev, A Lebedev… - 2023 XVIII International …, 2023 - ieeexplore.ieee.org
We study generalized asymmetric channel with noiseless instantaneous feedback and
present a q-ary code of length n that transmits qn− t messages and corrects t errors for t≤ …

Two-batch liar games on a general bounded channel

RB Ellis, KL Nyman - Journal of Combinatorial Theory, Series A, 2009 - Elsevier
We consider an extension of the 2-person Rényi–Ulam liar game in which lies are governed
by a channel C, a set of allowable lie strings of maximum length k. Carole selects x∈[n], and …

[HTML][HTML] Minimum number of queries for an adaptive liar search game with small sets

K Meng, C Lin, Y Yang - Discrete Optimization, 2013 - Elsevier
To detect an unknown element x∗ from a finite set S={1, 2,…, n} by asking group-testing
queries is a classical combinatorial optimization problem. We consider a variation of the …