1806 search results - page 93 / 362 » Randomness and halting probabilities |
122
click to vote
DM
2007
15 years 3 months ago
2007
In this paper we deal with codes identifying sets of vertices in random networks; that is, (1, ≤ ℓ)-identifying codes. These codes enable us to detect sets of faulty processor...
112
click to vote
ALGORITHMICA
2005
15 years 3 months ago
2005
Abstract. We consider random tries and random patricia trees constructed from n independent strings of symbols drawn from any distribution on any discrete space. We show that many ...
121
Voted
ISPDC
2008
IEEE
15 years 10 months ago
2008
IEEE
Self-stabilizing token circulation algorithms are not always adapted for dynamic networks. Random walks are well known to play a crucial role in the design of randomized algorithm...
114
click to vote
GECCO
2005
Springer
15 years 9 months ago
2005
Springer
An analysis for the phase transition in a random NK landscape model is given. For the fixed ratio model, NK(n, k, z), Gao and Culberson [17] showed that a random instance generat...
139
Voted
VTS
2002
IEEE
15 years 8 months ago
2002
IEEE
We present a software-based weighted random pattern scheme for testing delay faults in IP cores of programmable SoCs. We describe a method for determining static and transition pr...