Sciweavers

244 search results - page 2 / 49
» On-Line Probability, Complexity and Randomness
Sort
View
DAC
2007
ACM
14 years 5 months ago
Characterization and Estimation of Circuit Reliability Degradation under NBTI using On-Line IDDQ Measurement
Negative bias temperature instability (NBTI) in MOSFETs is one of the major reliability challenges in nano-scale technology. This paper presents an efficient technique to characte...
Kunhyuk Kang, Kee-Jong Kim, Ahmad E. Islam, Muhamm...
WSC
2008
13 years 7 months ago
Efficient simulation for tail probabilities of Gaussian random fields
We are interested in computing tail probabilities for the maxima of Gaussian random fields. In this paper, we discuss two special cases: random fields defined over a finite number...
Robert J. Adler, Jose Blanchet, Jingchen Liu
CPC
1998
91views more  CPC 1998»
13 years 4 months ago
Complexity and Probability of Some Boolean Formulas
For any Boolean functionf letL(f) be its formulasizecomplexityin the basis f^ 1g. For every n and every k n=2, we describe a probabilistic distribution on formulas in the basis f^...
Petr Savický
AINA
2006
IEEE
13 years 6 months ago
Distributed Tuning Attempt Probability for Data Gathering in Random Access Wireless Sensor Networks
In this paper, we study the problem of data gathering in multi-hop wireless sensor networks. To tackle the high degree of channel contention and high probability of packet collisi...
Haibo Zhang, Hong Shen
FSEN
2009
Springer
13 years 11 months ago
The Complexity of Reachability in Randomized Sabotage Games
Abstract. We analyze a model of fault-tolerant systems in a probabilistic setting. The model has been introduced under the name of “sabotage games”. A reachability problem over...
Dominik Klein, Frank G. Radmacher, Wolfgang Thomas