Sciweavers

1806 search results - page 207 / 362
» Randomness and halting probabilities
Sort
View
CORR
2008
Springer
88views Education» more  CORR 2008»
15 years 3 months ago
Lower bounds for distributed markov chain problems
We study the worst-case communication complexity of distributed algorithms computing a path problem based on stationary distributions of random walks in a network G with the caveat...
Rahul Sami, Andy Twigg
EOR
2006
66views more  EOR 2006»
15 years 3 months ago
Performance prediction of an unmanned airborne vehicle multi-agent system
Consider unmanned airborne vehicle (UAV) control agents in a dynamic multi-agent system. The agents must have a set of goals such as destination airport and intermediate positions...
Zhaotong Lian, Abhijit Deshmukh
113
Voted
ETT
2006
88views Education» more  ETT 2006»
15 years 3 months ago
On the outage behaviour of large DS-CDMA systems with LMMSE detection
Abstract-- The outage behaviour of the single cell DSCDMA uplink is investigated for flat Rayleigh fading channels. Goal of the work is to find an analytical way for the optimisati...
Oliver Prätor, Gerhard Fettweis
136
Voted
SMA
2008
ACM
110views Solid Modeling» more  SMA 2008»
15 years 3 months ago
Probabilistic model of triangulation
This paper analyses the probability that randomly deployed sensor nodes triangulate any point within the target area. Its major result is the probability of triangulation for any p...
Xiaoyun Li, David K. Hunter
TIT
2008
87views more  TIT 2008»
15 years 3 months ago
Coding Theorems on the Threshold Scheme for a General Source
In this paper, coding theorems on the (t; m)-threshold scheme for a general source are discussed, where m means the number of the shares and t means a threshold. The (t; m)-thresho...
Hiroki Koga