Sciweavers

1806 search results - page 49 / 362
» Randomness and halting probabilities
Sort
View
WCE
2007
13 years 8 months ago
Reliability of Fatigue Damaged Structure Using FORM, SORM and Fatigue Model
—The methodologies to calculate failure probability and to estimate the reliability of fatigue loaded structures are developed. The applicability of the methodologies is evaluate...
Ouk Sub Lee, Dong Hyeok Kim
LOGCOM
2007
89views more  LOGCOM 2007»
13 years 7 months ago
Algorithmic Randomness of Closed Sets
We investigate notions of randomness in the space C[2N ] of nonempty closed subsets of {0, 1}N . A probability measure is given and a version of the Martin-L¨of test for randomne...
George Barmpalias, Paul Brodhead, Douglas Cenzer, ...
CORR
2010
Springer
150views Education» more  CORR 2010»
13 years 4 months ago
On extracting common random bits from correlated sources
Suppose Alice and Bob receive strings of unbiased independent but noisy bits from some random source. They wish to use their respective strings to extract a common sequence of ran...
Andrej Bogdanov, Elchanan Mossel
ICALP
2009
Springer
14 years 2 months ago
A Better Algorithm for Random k-SAT
Let Φ be a uniformly distributed random k-SAT formula with n variables and m clauses. We present a polynomial time algorithm that finds a satisfying assignment of Φ with high p...
Amin Coja-Oghlan
MFCS
2007
Springer
14 years 1 months ago
Uncover Low Degree Vertices and Minimise the Mess: Independent Sets in Random Regular Graphs
Abstract. We present algorithmic lower bounds on the size of the largest independent sets of vertices in a random d-regular graph. Our bounds hold with probability approaching one ...
William Duckworth, Michele Zito