429 search results - page 44 / 86 » Noisy Turing Machines |
SSS
2010
Springer
14 years 8 months ago
2010
Springer
We consider the question of how much information can be stored by labeling the vertices of a connected undirected graph G using a constant-size set of labels, when isomorphic label...
106
click to vote
NC
2011
14 years 4 months ago
2011
We consider recognizer P systems having three polarizations associated to the membranes, and we show that they are able to solve the PSPACEcomplete problem Quantified 3SAT when wo...
112
click to vote
NC
2011
14 years 18 days ago
2011
In this paper we consider three variants of accepting networks of evolutionary processors. It is known that two of them are equivalent to Turing machines. We propose here a direct ...
ICML
2003
IEEE
15 years 10 months ago
2003
IEEE
The use of domain knowledge in a learner can greatly improve the models it produces. However, high-quality expert knowledge is very difficult to obtain. Traditionally, researchers...
ECML
2006
Springer
15 years 1 months ago
2006
Springer
Causal independence modelling is a well-known method both for reducing the size of probability tables and for explaining the underlying mechanisms in Bayesian networks. In this pap...