Sciweavers

494 search results - page 59 / 99
» Probabilistic Programming in Anglican
Sort
View
ESOP
2005
Springer
15 years 3 months ago
Computationally Sound, Automated Proofs for Security Protocols
Since the 1980s, two approaches have been developed for analyzing security protocols. One of the approaches relies on a computational model that considers issues of complexity and ...
Véronique Cortier, Bogdan Warinschi
86
Voted
JSAI
2005
Springer
15 years 3 months ago
Learning Stochastic Logical Automaton
Abstract. This paper is concerned with algorithms for the logical generalisation of probabilistic temporal models from examples. The algorithms combine logic and probabilistic mode...
Hiroaki Watanabe, Stephen Muggleton
89
Voted
APWEB
2006
Springer
15 years 1 months ago
Providing an Uncertainty Reasoning Service for Semantic Web Application
In the semantic web context,the formal representation of knowledge is not resourceful while the informal one with uncertainty prevails. In order to provide an uncertainty reasoning...
Lei Li, Qiaoling Liu, Yunfeng Tao, Lei Zhang, Jian...
104
Voted
CSR
2011
Springer
14 years 1 months ago
Improving the Space-Bounded Version of Muchnik's Conditional Complexity Theorem via "Naive" Derandomization
Abstract. Many theorems about Kolmogorov complexity rely on existence of combinatorial objects with specific properties. Usually the probabilistic method gives such objects with b...
Daniil Musatov
HPCA
2007
IEEE
15 years 4 months ago
Perturbation-based Fault Screening
Fault screeners are a new breed of fault identification technique that can probabilistically detect if a transient fault has affected the state of a processor. We demonstrate that...
Paul Racunas, Kypros Constantinides, Srilatha Mann...