1806 search results - page 35 / 362 » Randomness and halting probabilities |
UC
2009
Springer
15 years 6 months ago
2009
Springer
Abstract. We investigate methods for exploiting nondeterminism inherent within the Tile Assembly Model in order to generate uniform random numbers. Namely, given an integer range {...
102
click to vote
SODA
1998
ACM
15 years 1 months ago
1998
ACM
We consider the problem of on-line call admission and routing on trees and meshes. Previous work gave randomized on-line algorithms for these problems and proved that they have opt...
ANOR
2004
14 years 11 months ago
2004
A method for calculating the probability of customer demand satisfaction in production
CSR
2007
Springer
15 years 6 months ago
2007
Springer
We propose a simple modification of a well-known Random Walk algorithm for solving the Satisfiability problem and analyze its performance on random CNFs with a planted solution. ...
108
click to vote
FCCM
2006
IEEE
15 years 3 months ago
2006
IEEE
This paper presents a technique for efficiently generating random numbers from a given probability distribution. This is achieved by using a generic hardware architecture, which t...