Sciweavers

5863 search results - page 209 / 1173
» Calculating Functional Programs
Sort
View
UAI
1997
15 years 7 months ago
Robustness Analysis of Bayesian Networks with Local Convex Sets of Distributions
Robust Bayesian inference is the calculation of posterior probability bounds given perturbations in a probabilistic model. This paper focuses on perturbations that can be expresse...
Fabio Gagliardi Cozman
SQJ
2002
90views more  SQJ 2002»
15 years 6 months ago
Critical Analysis of the PIE Testability Technique
Abstract. The work of Voas and colleagues has introduced, refined and applied the propagation, infection and execution (PIE) analysis technique for measuring testability of program...
Zuhoor A. Al-Khanjari, Martin R. Woodward, Haider ...
POPL
2005
ACM
16 years 6 months ago
Statically checking confidentiality via dynamic labels
This paper presents a new approach for verifying confidenfor programs, based on abstract interpretation. The framework is formally developed and proved correct in the theorem prov...
Bart Jacobs, Wolter Pieters, Martijn Warnier
VLDB
1991
ACM
101views Database» more  VLDB 1991»
15 years 10 months ago
Solving Domain Mismatch and Schema Mismatch Problems with an Object-Oriented Database Programming Language
Domain mismatch and schema mismatch are two of the important semantic integration problems for interoperating heterogeneous databases. This paper structures the domain mismatch pr...
William Kent
AIPS
2004
15 years 7 months ago
Heuristic Refinements of Approximate Linear Programming for Factored Continuous-State Markov Decision Processes
Approximate linear programming (ALP) offers a promising framework for solving large factored Markov decision processes (MDPs) with both discrete and continuous states. Successful ...
Branislav Kveton, Milos Hauskrecht