Sciweavers

3247 search results - page 650 / 650
» Randomized smoothing networks
Sort
View
FCT
2009
Springer
13 years 12 months ago
Competitive Group Testing and Learning Hidden Vertex Covers with Minimum Adaptivity
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...
Peter Damaschke, Azam Sheikh Muhammad
SAGA
2007
Springer
13 years 11 months ago
Probabilistic Techniques in Algorithmic Game Theory
We consider applications of probabilistic techniques in the framework of algorithmic game theory. We focus on three distinct case studies: (i) The exploitation of the probabilistic...
Spyros C. Kontogiannis, Paul G. Spirakis