Sciweavers

12 search results - page 1 / 3
» Delayed path coupling and generating random permutations
Sort
View
RSA
2000
170views more  RSA 2000»
13 years 4 months ago
Delayed path coupling and generating random permutations
We analyze various stochastic processes for generating permutations almost uniformly at random in distributed and parallel systems. All our protocols are simple, elegant and are b...
Artur Czumaj, Miroslaw Kutylowski
IOLTS
2000
IEEE
105views Hardware» more  IOLTS 2000»
13 years 9 months ago
Comparison between Random and Pseudo-Random Generation for BIST of Delay, Stuck-at and Bridging Faults
The combination of higher quality requirements and sensitivity of high performance circuits to delay defects has led to an increasing emphasis on delay testing of VLSI circuits. A...
Patrick Girard, Christian Landrault, Serge Pravoss...
ICCAD
1998
IEEE
98views Hardware» more  ICCAD 1998»
13 years 8 months ago
Determination of worst-case aggressor alignment for delay calculation
Increases in delay due to coupling can have a dramatic impact on IC performance for deep submicron technologies. To achieve maximum performance there is a need for analyzing logic...
Paul D. Gross, Ravishankar Arunachalam, Karthik Ra...
CORR
2010
Springer
162views Education» more  CORR 2010»
13 years 4 months ago
Random sampling of lattice paths with constraints, via transportation
We investigate Monte Carlo Markov Chain (MCMC) procedures for the random sampling of some one-dimensional lattice paths with constraints, for various constraints. We will see that...
Lucas Gerin
COMBINATORICS
2000
101views more  COMBINATORICS 2000»
13 years 4 months ago
Random Sampling of Labeled Tournaments
This note extends a recent result of Kannan, Tetali and Vempala to completely solve, via a simple proof, the problem of random generation of a labeled tournament with a given scor...
Lisa McShine