362 search results - page 11 / 73 » A Theory of Probabilistic Functional Testing |
145
click to vote
CCS
1998
ACM
15 years 8 months ago
1998
ACM
We develop a framework for analyzing security protocols in which protocol adversaries may be arbitrary probabilistic polynomial-time processes. In this framework, protocols are wr...
111
click to vote
ACL
2010
15 years 1 months ago
2010
We present a probabilistic model extension to the Tesni`ere Dependency Structure (TDS) framework formulated in (Sangati and Mazza, 2009). This representation incorporates aspects ...
139
click to vote
AAAI
2006
15 years 5 months ago
2006
We study how to find plans that maximize the expected total utility for a given MDP, a planning objective that is important for decision making in high-stakes domains. The optimal...
124
Voted
CORR
2008
Springer
15 years 4 months ago
2008
Springer
The paper is organized as a self-contained literate Haskell program that implements elements of an executable finite set theory with focus on combinatorial generation and arithmet...
106
click to vote
JC
2006
15 years 3 months ago
2006
We prove upper bounds on the order and degree of the polynomials involved in a resolvent representation of the prime differential ideal associated with a polynomial differential s...