Sciweavers

148 search results - page 8 / 30
» Data Structures with Arithmetic Constraints: A Non-disjoint ...
Sort
View
CADE
2007
Springer
14 years 7 months ago
Combination Methods for Satisfiability and Model-Checking of Infinite-State Systems
Manna and Pnueli have extensively shown how a mixture of first-order logic (FOL) and discrete Linear time Temporal Logic (LTL) is sufficient to precisely state verification problem...
Silvio Ghilardi, Enrica Nicolini, Silvio Ranise, D...
ICPR
2008
IEEE
14 years 1 months ago
Improving Bayesian Network parameter learning using constraints
This paper describes a new approach to unify constraints on parameters with training data to perform parameter estimation in Bayesian networks of known structure. The method is ge...
Cassio Polpo de Campos, Qiang Ji
CIDM
2009
IEEE
14 years 2 months ago
A new hybrid method for Bayesian network learning With dependency constraints
Abstract— A Bayes net has qualitative and quantitative aspects: The qualitative aspect is its graphical structure that corresponds to correlations among the variables in the Baye...
Oliver Schulte, Gustavo Frigo, Russell Greiner, We...
ICDE
2007
IEEE
119views Database» more  ICDE 2007»
14 years 1 months ago
Practical Preference Relations for Large Data Sets
User-defined preferences allow personalized ranking of query results. A user provides a declarative specification of his/her preferences, and the system is expected to use that ...
Kenneth A. Ross, Peter J. Stuckey, Amélie M...
VMCAI
2004
Springer
14 years 24 days ago
Boolean Algebra of Shape Analysis Constraints
Shape analysis is a promising technique for statically verifying and extracting properties of programs that manipulate complex data structures. We introduce a new characterization...
Viktor Kuncak, Martin C. Rinard