Sciweavers

1414 search results - page 39 / 283
» Cover Time and Broadcast Time
Sort
View
STOC
2010
ACM
224views Algorithms» more  STOC 2010»
14 years 2 months ago
Satisfiability Allows No Nontrivial Sparsification Unless The Polynomial-Time Hierarchy Collapses
Consider the following two-player communication process to decide a language L: The first player holds the entire input x but is polynomially bounded; the second player is computa...
Holger Dell and Dieter van Melkebeek
CORR
2004
Springer
103views Education» more  CORR 2004»
13 years 9 months ago
The Freeze-Tag Problem: How to Wake Up a Swarm of Robots
An optimization problem that naturally arises in the study of swarm robotics is the Freeze-Tag Problem (FTP) of how to awaken a set of "asleep" robots, by having an awak...
Esther M. Arkin, Michael A. Bender, Sándor ...
FGCN
2007
IEEE
149views Communications» more  FGCN 2007»
14 years 4 months ago
Cover Set Problem in Directional Sensor Networks
— A directional sensor network consists of a number of directional sensors, which can switch to several directions to extend their sensing ability to cover the interested targets...
Yanli Cai, Wei Lou, Minglu Li
DCG
2007
71views more  DCG 2007»
13 years 10 months ago
Covering Spheres with Spheres
Given a sphere of any radius r in an n-dimensional Euclidean space, we study the coverings of this sphere with solid spheres of radius one. Our goal is to design a covering of the...
Ilya Dumer
STOC
2010
ACM
211views Algorithms» more  STOC 2010»
14 years 7 months ago
Maintaining a Large Matching or a Small Vertex Cover
We consider the problem of maintaining a large matching or a small vertex cover in a dynamically changing graph. Each update to the graph is either an edge deletion or an edge ins...
Krzysztof Onak and Ronitt Rubinfeld