Sciweavers

2996 search results - page 38 / 600
» Numberings and Randomness
Sort
View
RSA
2008
63views more  RSA 2008»
15 years 1 months ago
The cutoff phenomenon for randomized riffle shuffles
We study the cutoff phenomenon for generalized riffle shuffles where, at each step, the deck of cards is cut into a random number of packs of multinomial sizes which are then riffl...
Guan-Yu Chen, Laurent Saloff-Coste
RSA
2000
112views more  RSA 2000»
15 years 1 months ago
Growth of components in random graphs
The creation and growth of components of a given complexity in a random graph process are studied. In particular, the expected number and total size of all such components is found...
Svante Janson
IM
2007
15 years 1 months ago
Pursuit-Evasion in Models of Complex Networks
Vertex pursuit games, such as the game of Cops and Robbers, are a simplified model for network security. In these games, cops try to capture a robber loose on the vertices of the ...
Anthony Bonato, Pawel Pralat, Changping Wang
SAINT
2006
IEEE
15 years 8 months ago
Anti-collision performance of Gen2 Air Protocol in Random Error Communication Link
When a multitude of RFID tags are in the interrogating field, an anti-collision technology must be used. In literatures, the reading performance was mainly investigated on the er...
Yuusuke Kawakita, Jin Mitsugi
JDA
2008
85views more  JDA 2008»
15 years 1 months ago
A robust randomized algorithm to perform independent tasks
The Do-All problem is about scheduling t similar and independent tasks to be performed by p processors prone to crashes. We assume that the distributed system is synchronous with ...
Bogdan S. Chlebus, Leszek Gasieniec, Dariusz R. Ko...