Sciweavers

242 search results - page 34 / 49
» Zigzags in Turing Machines
Sort
View
DLT
2008
13 years 9 months ago
Emptiness of Multi-pushdown Automata Is 2ETIME-Complete
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...
Mohamed Faouzi Atig, Benedikt Bollig, Peter Haberm...
LREC
2008
112views Education» more  LREC 2008»
13 years 9 months ago
Can we Evaluate the Quality of Generated Text?
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...
David Hardcastle, Donia Scott
AIPS
2004
13 years 9 months ago
Complexity of Planning with Partial Observability
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 ...
Jussi Rintanen
PODC
2010
ACM
13 years 7 months ago
Brief announcement: swarming secrets
We present information-theoretically secure schemes for sharing and modifying secrets among a dynamic swarm of computing devices. The schemes support an unlimited number of change...
Shlomi Dolev, Juan A. Garay, Niv Gilboa, Vladimir ...
ACTA
2010
104views more  ACTA 2010»
13 years 7 months ago
Reachability results for timed automata with unbounded data structures
Systems of Data Management Timed Automata (SDMTAs) are networks of communicating timed automata with structures to store messages and functions to manipulate them. We prove the dec...
Ruggero Lanotte, Andrea Maggiolo-Schettini, Angelo...