16430 search results - page 1 / 3286 » On Computable Tree Functions |
ECSQARU
2003
Springer
13 years 11 months 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...
ASIAN
2000
Springer
13 years 10 months ago
2000
Springer
RECOMB
2003
Springer
14 years 6 months ago
2003
Springer
CSCWD
2008
Springer
13 years 8 months ago
2008
Springer
Task partition is a critical problem of collaborative conceptual design. Aiming at the shortage that current task partition methods don't accord to innovative functional reas...
IWOCA
2009
Springer
14 years 24 days ago
2009
Springer
The notion of submodular partition functions generalizes many of well-known tree decompositions of graphs. For fixed k, there are polynomial-time algorithms to determine whether ...