89 search results - page 11 / 18 » Belief functions and default reasoning |
ECSQARU
2007
Springer
14 years 1 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...
RECOMB
2007
Springer
14 years 7 months ago
2007
Springer
Abstract. Side-chain prediction is an important subproblem of the general protein folding problem. Despite much progress in side-chain prediction, performance is far from satisfact...
JAR
2010
13 years 2 months ago
2010
Based on inductive definitions, we develop a tool that automates the definition of partial recursive functions in higher-order logic (HOL) and provides appropriate proof rules for ...
ECSQARU
2003
Springer
14 years 23 days ago
2003
Springer
Abstract. Binary join trees have been a popular structure to compute the impact of multiple belief functions initially assigned to nodes of trees or networks. Shenoy has proposed t...
IFL
2005
Springer
14 years 1 months ago
2005
Springer
In programs written in lazy functional languages such as for example Clean and Haskell, the programmer can choose freely whether particular subexpressions will be evaluated lazily ...