### Table 1: Accuracy and time on Random CSPs.

2002

"... In PAGE 6: ... The first thing to observe from the tables is that even the weakest (but most efficient) level of approximation is supe- rior to the naive uniform distribution, sometimes substan- tially. We also see from Table1 that as i increases, the run- ning time of MBE(i) increases, as expected. Looking at each horizontal block, corresponding to a specific value of T, we see that as i increases, the KL-distance as well as absolute and relative error decrease.... ..."

Cited by 4

### Table 1: Accuracy and time on Random CSPs.

2002

"... In PAGE 6: ... The first thing to observe from the tables is that even the weakest (but most efficient) level of approximation is supe- rior to the naive uniform distribution, sometimes substan- tially. We also see from Table1 that as i increases, the run- ning time of MBE(i) increases, as expected. Looking at each horizontal block, corresponding to a specific value of T, we see that as i increases, the KL-distance as well as absolute and relative error decrease.... ..."

Cited by 4

### Table 3: The same comparison as Table 1, but with dynamic backtracking modi ed to undo unit propagation when it backtracks.

1994

Cited by 25

### Table 9: Speed distribution for concurrent run. percent of

2003

Cited by 63

### Table 3: Accuracy and time on 8x8 grid CSPs.

2002

"... In PAGE 6: ... We had to stay with relatively small problems in order to apply the exact algorithm. The results with ran- dom CSPs are given in Tables 1 and 2, and results with 8x8 grids are given in Table3 . In the first column we have tight- ness T, in the second column the KL-distance between the exact distribution and uniform distribution (C3C4D9), and in the remaining columns various values of the i-bound.... ..."

Cited by 4

### Table 3: Accuracy and time on 8x8 grid CSPs.

2002

"... In PAGE 6: ... We had to stay with relatively small problems in order to apply the exact algorithm. The results with ran- dom CSPs are given in Tables 1 and 2, and results with 8x8 grids are given in Table3 . In the first column we have tight- ness T, in the second column the KL-distance between the exact distribution and uniform distribution (a0a5a4a17a68 ), and in the remaining columns various values of the i-bound.... ..."

Cited by 4

### Table 4.3: The same comparison as Table 1, but with dynamic backtracking modi ed to undo unit propagation when it backtracks.

### Table 5: Efficiency obtained by the concurrent method for consistent problems.

"... In PAGE 16: ... Table 4 shows the efficiency obtained by this concurrent method without cooperation for the five considered classes of random CSPs (for consistent and inconsistent problems). Table5 (respectively table 6) provides these results for consistent problems (resp. inconsistent ones).... ..."

### Table 1: CBP method. All runtimes of CSPs of an individual QSim model are sum-

1995

"... In PAGE 6: ... 4.2 Partitioning Methods The most interesting runtimes for evaluating the two partitioning methods #28CBP and VBP#29 and its variants are presented in #5B Table1 #5D and #5BTable 2#5D. Only the runtime of the backtracking algorithm for solving the subproblems is shown in these tables.... ..."

Cited by 5