1806 search results - page 238 / 362 » Randomness and halting probabilities |
136
click to vote
ICALP
2004
Springer
15 years 9 months ago
2004
Springer
In order to enable communication between a dynamic collection of peers with given ID’s, such as “machine.cs.school.edu”, over the Internet, a distributed name service must b...
138
click to vote
STACS
2004
Springer
15 years 9 months ago
2004
Springer
Motivated by problems of pattern statistics, we study the limit distribution of the random variable counting the number of occurrences of the symbol a in a word of length n chosen...
120
click to vote
STACS
2004
Springer
15 years 9 months ago
2004
Springer
We present two simple algorithms for SAT and prove upper bounds on their running time. Given a Boolean formula F in conjunctive normal form, the first algorithm finds a satisfyin...
131
click to vote
CDC
2009
IEEE
15 years 9 months ago
2009
IEEE
Abstract— In WiFi networks, mobile nodes compete for accessing a shared channel by means of a random access protocol called Distributed Coordination Function (DCF). Although this...
130
click to vote
CDC
2009
IEEE
15 years 9 months ago
2009
IEEE
— We study the problem of optimal estimation using quantized innovations, with application to distributed estimation over sensor networks. We show that the state probability dens...