Suppose that some of the n elements of a totally ordered structure is defective, and several repair robots are at our disposal. They can dock at a random element, move at unit speed or leave, and send each other signals if there is no defective between them. We show that, by using only two robots that obey simple rules, the defective can be localized in square-root(n) time, which is also optimal. A variation of our strategy needs three robots but has a more predictable behaviour. The model is motivated by a conjectured DNA repair mechanism, and it combines group testing with geometric search
AbstractRecently the problem of determining the minimax number of group tests for finding two defect...
We consider the following constrained version of the classical Group Testing problem: Given a finite...
Consider two robots that start at the origin of the infinite line in search of an exit at an unknown...
Suppose that some of the n elements of a totally ordered structure is defective, and several repair ...
We consider (n,f)-search on a circle, a search problem of a hidden exit on a circle of unit radius f...
A collection of k mobile robots, initially placed at the origin of the plane, are searching for a st...
We consider the problem of searching on a line using n mobile robots, of which at most f are faulty,...
For the well-established group testing problem, i.e., finding defective elements in a set by testing...
The group testing problem asks to find d<n defective elements out of n elements, by testing subsets ...
We consider the problem of fault-tolerant parallel search on an infinite line by n robots. Starting ...
Group testing is the problem of finding d defectives in a set of n elements, by asking carefully cho...
Abstract. We study here the problem of solving the traditional n-queens puzzle by a group of homogen...
Deppe C, Lebedev VS. Group testing problem with two defectives. Problems of Information Transmission...
International audienceWe consider a variant of the crash-fault gathering problem called stand-up ind...
An exit (or target) is at an unknown location on the perimeter of a unit disk. A group of n+1 robots...
AbstractRecently the problem of determining the minimax number of group tests for finding two defect...
We consider the following constrained version of the classical Group Testing problem: Given a finite...
Consider two robots that start at the origin of the infinite line in search of an exit at an unknown...
Suppose that some of the n elements of a totally ordered structure is defective, and several repair ...
We consider (n,f)-search on a circle, a search problem of a hidden exit on a circle of unit radius f...
A collection of k mobile robots, initially placed at the origin of the plane, are searching for a st...
We consider the problem of searching on a line using n mobile robots, of which at most f are faulty,...
For the well-established group testing problem, i.e., finding defective elements in a set by testing...
The group testing problem asks to find d<n defective elements out of n elements, by testing subsets ...
We consider the problem of fault-tolerant parallel search on an infinite line by n robots. Starting ...
Group testing is the problem of finding d defectives in a set of n elements, by asking carefully cho...
Abstract. We study here the problem of solving the traditional n-queens puzzle by a group of homogen...
Deppe C, Lebedev VS. Group testing problem with two defectives. Problems of Information Transmission...
International audienceWe consider a variant of the crash-fault gathering problem called stand-up ind...
An exit (or target) is at an unknown location on the perimeter of a unit disk. A group of n+1 robots...
AbstractRecently the problem of determining the minimax number of group tests for finding two defect...
We consider the following constrained version of the classical Group Testing problem: Given a finite...
Consider two robots that start at the origin of the infinite line in search of an exit at an unknown...