Sciweavers

3257 search results - page 33 / 652
» Some Results on Effective Randomness
Sort
View
CIE
2010
Springer
14 years 2 months ago
Ergodic-Type Characterizations of Algorithmic Randomness
A useful theorem of Kuˇcera states that given a Martin-L¨of random infinite binary sequence ω and an effectively open set A of measure less than 1, some tail of ω is not in A...
Laurent Bienvenu, Adam R. Day, Ilya Mezhirov, Alex...
TSMC
2002
69views more  TSMC 2002»
13 years 9 months ago
A new learning algorithm for the hierarchical structure learning automata operating in the nonstationary S-model random environm
An extended algorithm of the relative reward strength algorithm is proposed. It is shown that the proposed algorithm ensures the convergence with probability 1 to the optimal path ...
Norio Baba, Yoshio Mogami
KI
1999
Springer
14 years 1 months ago
Systematic vs. Local Search for SAT
Abstract. Due to its prominence in artificial intelligence and theoretical computer science, the propositional satisfiability problem (SAT) has received considerable attention in...
Holger H. Hoos, Thomas Stützle
TSP
2010
13 years 4 months ago
Distributed estimation of channel gains in wireless sensor networks
We consider the problem of distributed channel estimation in a sensor network which employs a random sleep strategy to conserve energy. If the N network nodes are randomly placed a...
Sivagnanasundaram Ramanan, John MacLaren Walsh
COMBINATORICA
2000
157views more  COMBINATORICA 2000»
13 years 9 months ago
Concentration of Multivariate Polynomials and Its Applications
Suppose t1, ..., tn are independent random variables which take value either 0 or 1, and Y is a multi-variable polynomial in ti's with positive coefficients. We give a conditi...
Jeong Han Kim, Van H. Vu