451 search results - page 87 / 91 » Some Lower Bounds on Geometric Separability Problems |
FCT
2009
Springer
15 years 4 months ago
2009
Springer
Suppose that we are given a set of n elements d of which are “defective”. A group test can check for any subset, called a pool, whether it contains a defective. It is well know...
84
Voted
ALGOSENSORS
2009
Springer
15 years 4 months ago
2009
Springer
In this paper we consider the model of communication where wireless devices can either switch their radios off to save energy (and hence, can neither send nor receive messages), o...
72
Voted
STACS
2007
Springer
15 years 3 months ago
2007
Springer
A coloring of a graph is convex if it induces a partition of the vertices into connected subgraphs. Besides being an interesting property from a theoretical point of view, tests f...
EDCC
2010
Springer
15 years 2 months ago
2010
Springer
: While lots of consensus algorithms have been proposed for crash-prone asynchronous message-passing systems enriched with a failure detector of the class Ω (the class of eventua...
IEAAIE
1994
Springer
15 years 1 months ago
1994
Springer
Genetic Algorithms are heuristic search schemes based on a model of Darwinian evolution. Although not guaranteed to find the optimal solution, genetic algorithms have been shown t...