Sciweavers

78 search results - page 10 / 16
» Reasoning about MDPs as Transformers of Probability Distribu...
Sort
View
AIPS
2009
13 years 7 months ago
Computing Robust Plans in Continuous Domains
We define the robustness of a sequential plan as the probability that it will execute successfully despite uncertainty in the execution environment. We consider a rich notion of u...
Christian Fritz, Sheila A. McIlraith
NIPS
2000
13 years 8 months ago
A Neural Probabilistic Language Model
A goal of statistical language modeling is to learn the joint probability function of sequences of words in a language. This is intrinsically difficult because of the curse of dim...
Yoshua Bengio, Réjean Ducharme, Pascal Vinc...
IMC
2004
ACM
14 years 4 days ago
A pragmatic approach to dealing with high-variability in network measurements
The Internet is teeming with high variability phenomena, from measured IP flow sizes to aspects of inferred router-level connectivity, but there still exists considerable debate ...
Walter Willinger, David Alderson, Lun Li
POPL
2009
ACM
14 years 7 months ago
Formal certification of code-based cryptographic proofs
As cryptographic proofs have become essentially unverifiable, cryptographers have argued in favor of developing techniques that help tame the complexity of their proofs. Game-base...
Benjamin Grégoire, Gilles Barthe, Santiago ...
WADT
1998
Springer
13 years 10 months ago
An Algebra of Graph Derivations Using Finite (co-) Limit Double Theories
Graph transformation systems have been introduced for the formal specification of software systems. States are thereby modeled as graphs, and computations as graph derivations acco...
Andrea Corradini, Martin Große-Rhode, Reiko ...