1806 search results - page 75 / 362 » Randomness and halting probabilities |
ECAL
2003
Springer
15 years 5 months ago
2003
Springer
Abstract. We propose the use of Deterministic Generalized Asynchronous Random Boolean Networks [1] as models of contextual deterministic discrete dynamical systems. We show that ch...
101
click to vote
DNA
2000
Springer
15 years 3 months ago
2000
Springer
We present a randomized DNA algorithm for k-SAT based on the classical algorithm of Paturi et al. [8]. For an n-variable, m-clause instance of k-SAT (m > n), our algorithm finds...
116
click to vote
ACL
2008
15 years 1 months ago
2008
This paper presents a semi-supervised training method for linear-chain conditional random fields that makes use of labeled features rather than labeled instances. This is accompli...
JUCS
2007
14 years 11 months ago
2007
Abstract: We present a new type of sat problem called the k-gd-sat, which generalizes k-sat and gd-sat. In k-gd-sat, clause lengths have geometric distribution, controlled by a pro...
111
click to vote
IPL
2002
14 years 11 months ago
2002
Splay trees are self-organizing binary search trees that were introduced by Sleator and Tarjan [12]. In this paper we present a randomized variant of these trees. The new algorith...