92 search results - page 5 / 19 » Structuring Optimizing Transformations and Proving Them Soun... |
ECSQARU
2007
Springer
15 years 3 months ago
2007
Springer
Based on the canonical decomposition of belief functions, Smets introduced the concept of a latent belief structure (LBS). This concept is revisited in this article. The study of t...
101
click to vote
TPCD
1994
14 years 10 months ago
1994
Theorem proving techniques are particularly well suited for reasoning about arithmetic above the bit level and for relating di erent f abstraction. In this paper we show how a non-...
83
Voted
CC
2007
Springer
15 years 3 months ago
2007
Springer
As the amount of data used by programs increases due to the growth of hardware storage capacity and computing power, efficient memory usage becomes a key factor for performance. Si...
HICSS
2002
IEEE
15 years 2 months ago
2002
IEEE
As XML is gathering more and more importance in the field of data interchange in distributed business to business (B2B) applications, it is increasingly important to provide a for...
CPAIOR
2009
Springer
15 years 4 months ago
2009
Springer
There has been considerable interest in the identification of structural properties of combinatorial problems that lead, directly or indirectly, to the development of efficient al...