### Table 3: Probabilistic network characteristics

"... In PAGE 18: ...2 Probabilistic networks We continue our computational study with 8 real-life probabilistic networks from the field of medicine. Table3 shows the origin of the instances and the size of the network. The most effi- cient way to compute the inference in a probabilistic network is by the use of the junction-tree propagation algorithm of Lauritzen and Spiegelhalter [24].... In PAGE 18: ... The moralization of a network (or directed graph) D = (V, A) is the undirected graph G = (V, E) obtained from D by adding edges between every pair of non-adjacent vertices that have a common successor, and then dropping arc directions. The size of the edge set E is also reported in Table3 . After the application of pre-processing... In PAGE 18: ...Table 3: Probabilistic network characteristics techniques for computing the treewidth [8], an additional four instances to conduct our heuris- tics on are available. The size of these four instances is reported in Table3 as well. After [8], henceforth we refer to these instances as instancename {3,4}.... ..."

### Table 1: Moralisation of probabilistic networks

Cited by 6

### Table 1: Moralisation of probabilistic networks

### Table 1: Comparison of current PDE approaches.

1999

"... In PAGE 3: ... Table 1: Comparison of current PDE approaches. The relative merits of the three approaches are compared in Table1 . Note that no single approach satisfies all the criteria for an ideal protocol development environment.... ..."

Cited by 22

### Table 1: Comparison of current PDE approaches.

1999

"... In PAGE 3: ... Table 1: Comparison of current PDE approaches. The relative merits of the three approaches are compared in Table1 . Note that no single approach satisfies all the criteria for an ideal protocol development environment.... ..."

Cited by 22

### Table 1: Comparison of current PDE approaches.

"... In PAGE 3: ... Table 1: Comparison of current PDE approaches. The relative merits of the three approaches are compared in Table1 . Note that no single approach satisfies all the criteria for an ideal protocol development environment.... ..."

### Table 5: Behavior Network for Probabilistic Foraging

"... In PAGE 6: ... The combination of these two probabilistic activation conditions used in the Probabilistic Foraging behavior network increases the effectiveness of sequential foraging. To implement the Probabilistic Foraging algorithm on the robot, we used the the behavior network shown in Table5 . The activation conditions Ignore and Drop were random variables in the range [0,1], selected at every time-step.... ..."

Cited by 2

### Table 5: Behavior Network for Probabilistic Foraging

"... In PAGE 6: ... The combination of these two probabilistic activation conditions used in the Probabilistic Foraging behavior network increases the e ectiveness of sequential foraging. To implement the Probabilistic Foraging algorithm on the robot, we used the the behavior network shown in Table5 . The activation conditions Ignore and Drop were random variables in the range [0,1], selected at every time-step.... ..."

### Table 3. Probabilistic network induction results

2001

Cited by 5