Sciweavers

1541 search results - page 54 / 309
» Analysis of Random Noise and Random Walk Algorithms
Sort
View
VTC
2007
IEEE
14 years 3 months ago
Mellin Transform Based Performance Analysis of FFH M-ary FSK Using Product Combining Against Partial Band Noise Jamming
— We propose a novel bit error ratio (BER) analysis technique for fast frequency hopping (FFH) assisted M-ary frequency shift keying (MFSK) using product combining (PC), when the...
Sohail Ahmed, Lie-Liang Yang, Lajos Hanzo
PODC
1999
ACM
14 years 1 months ago
Analysis of Timing-Based Mutual Exclusion with Random Times
Various timing-based mutualexclusion algorithms have been proposed that guarantee mutual exclusion if certain timing assumptions hold. In this paper, we examine how these algorith...
Eli Gafni, Michael Mitzenmacher
PODS
2012
ACM
276views Database» more  PODS 2012»
11 years 11 months ago
Randomized algorithms for tracking distributed count, frequencies, and ranks
We show that randomization can lead to significant improvements for a few fundamental problems in distributed tracking. Our basis is the count-tracking problem, where there are k...
Zengfeng Huang, Ke Yi, Qin Zhang
AE
2001
Springer
14 years 1 months ago
Markov Random Field Modelling of Royal Road Genetic Algorithms
Abstract. Markov Random Fields (MRFs) 5] are a class of probabalistic models that have been applied for many years to the analysis of visual patterns or textures. In this paper, ou...
Deryck F. Brown, A. Beatriz Garmendia-Doval, John ...
DATE
2006
IEEE
127views Hardware» more  DATE 2006»
14 years 3 months ago
A signal theory based approach to the statistical analysis of combinatorial nanoelectronic circuits
In this paper we present a method which allows the statistical analysis of nanoelectronic Boolean networks with respect to timing uncertainty and noise. All signals are considered...
Oliver Soffke, Peter Zipf, Tudor Murgan, Manfred G...