Sciweavers

4103 search results - page 105 / 821
» Some results on the Collatz problem
Sort
View
RSA
2010
81views more  RSA 2010»
15 years 4 months ago
Percolation of arbitrary words in one dimension
We consider a type of long-range percolation problem on the positive integers, motivated by earlier work of others on the appearance of (in)finite words within a site percolation...
Geoffrey R. Grimmett, Thomas M. Liggett, Thomas Ri...
ACL
2010
15 years 4 months ago
On the Computational Complexity of Dominance Links in Grammatical Formalisms
Dominance links were introduced in grammars to model long distance scrambling phenomena, motivating the definition of multiset-valued linear indexed grammars (MLIGs) by Rambow (19...
Sylvain Schmitz
WAOA
2010
Springer
251views Algorithms» more  WAOA 2010»
15 years 4 months ago
How to Play Unique Games on Expanders
In this paper, we improve a result by Arora, Khot, Kolla, Steurer, Tulsiani, and Vishnoi on solving the Unique Games problem on expanders. Given a (1-)-satisfiable instance of Uniq...
Konstantin Makarychev, Yury Makarychev
CDC
2010
IEEE
133views Control Systems» more  CDC 2010»
15 years 1 months ago
Estimating state-space models in innovations form using the expectation maximisation algorithm
The expectation maximisation (EM) algorithm has proven to be effective for a range of identification problems. Unfortunately, the way in which the EM algorithm has previously been ...
Adrian Wills, Thomas B. Schön, Brett Ninness
CORR
2006
Springer
140views Education» more  CORR 2006»
15 years 6 months ago
Nearly optimal exploration-exploitation decision thresholds
While in general trading off exploration and exploitation in reinforcement learning is hard, under some formulations relatively simple solutions exist. Optimal decision thresholds ...
Christos Dimitrakakis