Sciweavers

1162 search results - page 63 / 233
» An Information-Based Theory of Conditionals
Sort
View
POPL
2012
ACM
13 years 7 months ago
Playing in the grey area of proofs
Interpolation is an important technique in verification and static analysis of programs. In particular, interpolants extracted from proofs of various properties are used in invar...
Krystof Hoder, Laura Kovács, Andrei Voronko...
ALDT
2009
Springer
140views Algorithms» more  ALDT 2009»
15 years 6 months ago
Directional Decomposition of Multiattribute Utility Functions
Abstract. Several schemes have been proposed for compactly representing multiattribute utility functions, yet none seems to achieve the level of success achieved by Bayesian and Ma...
Ronen I. Brafman, Yagil Engel
DATE
2006
IEEE
151views Hardware» more  DATE 2006»
15 years 5 months ago
Designing MRF based error correcting circuits for memory elements
As devices are scaled to the nanoscale regime, it is clear that future nanodevices will be plagued by higher soft error rates and reduced noise margins. Traditional implementation...
Kundan Nepal, R. Iris Bahar, Joseph L. Mundy, Will...
SAC
2006
ACM
15 years 5 months ago
Provably faithful evaluation of polynomials
We provide sufficient conditions that formally guarantee that the floating-point computation of a polynomial evaluation is faithful. To this end, we develop a formalization of ...
Sylvie Boldo, César Muñoz
GG
2004
Springer
15 years 5 months ago
Representing First-Order Logic Using Graphs
We show how edge-labelled graphs can be used to represent first-order logic formulae. This gives rise to recursively nested structures, in which each level of nesting corresponds ...
Arend Rensink