429 search results - page 42 / 86 » Noisy Turing Machines |
RTA
2010
Springer
15 years 1 months ago
2010
Springer
In earlier work, we have shown that for confluent term rewrite systems (TRSs for short), innermost polynomial runtime complexity induces polytime computability of the functions de...
PNPM
1987
15 years 1 months ago
1987
Some insight on the meaning of "modeling power" for Stochastic Petri Net models is given. Extensions characterizing a Stochastic Petri Net are categorized as logical or ...
DLT
2008
14 years 11 months ago
2008
We consider multi-pushdown automata, a multi-stack extension of pushdown automata that comes with a constraint on stack operations: a pop can only be performed on the first non-emp...
LREC
2008
14 years 11 months ago
2008
Evaluating the output of NLG systems is notoriously difficult, and performing assessments of text quality even more so. A range of automated and subject-based approaches to the ev...
AIPS
2004
14 years 11 months ago
2004
We show that for conditional planning with partial observability the existence problem of plans with success probability 1 is 2-EXP-complete. This result completes the complexity ...