644 search results - page 60 / 129 » Decomposition Complexity |
107
Voted
AI
2006
Springer
15 years 4 months ago
2006
Springer
Abstract. A conditioning graph (CG) is a graphical structure that attempt to minimize the implementation overhead of computing probabilities in belief networks. A conditioning grap...
90
Voted
GECCO
2006
Springer
15 years 4 months ago
2006
Springer
We present two novel perturbation-based linkage learning algorithms that extend LINC [5]; a version of LINC optimised for decomposition tasks (oLINC) and a hierarchical version of...
109
click to vote
ECOOP
1995
Springer
15 years 4 months ago
1995
Springer
Abstract. Meta-levels are complex pieces of software with diverse demands in both the computation and interaction domains. Common techniques using just code to express behaviour fa...
88
Voted
UAI
2004
15 years 2 months ago
2004
The complexity of a reasoning task over a graphical model is tied to the induced width of the underlying graph. It is well-known that the conditioning (assigning values) on a subs...
75
Voted
UAI
1997
15 years 1 months ago
1997
It has been shown that a class of probabilistic domain models cannot be learned correctly by several existing algorithms which employ a single-link lookahead search. When a multil...