Sciweavers

1806 search results - page 91 / 362
» Randomness and halting probabilities
Sort
View
JCST
2008
102views more  JCST 2008»
13 years 9 months ago
Random and Periodic Sleep Schedules for Target Detection in Sensor Networks
Abstract--We study Random and Periodic sleep schedules from the point of view of delay in detecting the target. We consider sleep schedules in which a sensor in `inactive' mod...
Vaishali P. Sadaphal, Bijendra N. Jain
TIT
1998
89views more  TIT 1998»
13 years 8 months ago
The Common Randomness Capacity of a Pair of Independent Discrete Memoryless Channels
—We study the following problem: two agents Alice and Bob are connected to each other by independent discrete memoryless channels. They wish to generate common randomness, i.e., ...
Sivarama Venkatesan, Venkat Anantharam
ATAL
2009
Springer
14 years 3 months ago
Analyzing the performance of randomized information sharing
In large, collaborative, heterogeneous teams, team members often collect information that is useful to other members of the team. Recognizing the utility of such information and d...
Prasanna Velagapudi, Oleg A. Prokopyev, Katia P. S...
SAGA
2007
Springer
14 years 3 months ago
Approximate Discovery of Random Graphs
In the layered-graph query model of network discovery, a query at a node v of an undirected graph G discovers all edges and non-edges whose endpoints have different distance from ...
Thomas Erlebach, Alexander Hall, Matús Miha...
ICALP
2004
Springer
14 years 2 months ago
Online Scheduling of Equal-Length Jobs: Randomization and Restarts Help
We consider the following scheduling problem. The input is a set of jobs with equal processing times, where each job is specified by its release time and deadline. The goal is to ...
Marek Chrobak, Wojciech Jawor, Jiri Sgall, Tom&aac...