1806 search results - page 142 / 362 » Randomness and halting probabilities |
133
Voted
STOC
2006
ACM
16 years 3 months ago
2006
ACM
We consider the problem of bounded-error quantum state identification: given either state 0 or state 1, we are required to output `0', `1' or `?' ("don't ...
123
click to vote
HICSS
2006
IEEE
15 years 9 months ago
2006
IEEE
— Uniform sampling in networks is at the core of a wide variety of randomized algorithms. Random sampling can be performed by modeling the system as an undirected graph with asso...
157
click to vote
GECCO
2005
Springer
15 years 9 months ago
2005
Springer
Investigating and enhancing the performance of genetic algorithms in dynamic environments have attracted a growing interest from the community of genetic algorithms in recent year...
125
Voted
JCT
2000
15 years 3 months ago
2000
A partial order on Z obtained by taking the transitive closure of a random relation {i < j and there is an edge ij} is studied. Randomness stems from postulating that an edge ij...
131
Voted
RSA
2010
15 years 1 months ago
2010
In this paper we analyze the appearance of a Hamilton cycle in the following random process. The process starts with an empty graph on n labeled vertices. At each round we are pre...