Sciweavers

1204 search results - page 240 / 241
» Hybrid Probabilistic Programs
Sort
View
JAIR
2006
157views more  JAIR 2006»
13 years 7 months ago
Decision-Theoretic Planning with non-Markovian Rewards
A decision process in which rewards depend on history rather than merely on the current state is called a decision process with non-Markovian rewards (NMRDP). In decisiontheoretic...
Sylvie Thiébaux, Charles Gretton, John K. S...
ECCC
2007
122views more  ECCC 2007»
13 years 7 months ago
Infeasibility of Instance Compression and Succinct PCPs for NP
The OR-SAT problem asks, given Boolean formulae φ1, . . . , φm each of size at most n, whether at least one of the φi’s is satisfiable. We show that there is no reduction fr...
Lance Fortnow, Rahul Santhanam
NC
2008
122views Neural Networks» more  NC 2008»
13 years 7 months ago
Computation with finite stochastic chemical reaction networks
A highly desired part of the synthetic biology toolbox is an embedded chemical microcontroller, capable of autonomously following a logic program specified by a set of instructions...
David Soloveichik, Matthew Cook, Erik Winfree, Jeh...
IFM
2010
Springer
190views Formal Methods» more  IFM 2010»
13 years 6 months ago
On Model Checking Techniques for Randomized Distributed Systems
Abstract. The automata-based model checking approach for randomized distributed systems relies on an operational interleaving semantics of the system by means of a Markov decision ...
Christel Baier
IPL
2010
98views more  IPL 2010»
13 years 6 months ago
Distinguishing attacks on stream ciphers based on arrays of pseudo-random words
In numerous modern stream ciphers, the internal state consists of a large array of pseudo-random words, and the output key-stream is a relatively simple function of the state. In ...
Nathan Keller, Stephen D. Miller