### Table 1: Algorithm performance

"... In PAGE 5: ... In spite of the ambiguous situation concerning all the anomalies generated by the algorithm, we found that the experimental results regarding SYN packets give good re- sults. Table1 summarizes the algorithm performance in the experiments described above. The table also summarizes the performance of the algorithm in terms of precision, re- call and F1.... ..."

### Table 1: Algorithm performance

"... In PAGE 5: ... In spite of the ambiguous situation concerning all the anomalies generated by the algorithm, we found that the experimental results regarding SYN packets give good re- sults. Table1 summarizes the algorithm performance in the experiments described above. The table also summarizes the performance of the algorithm in terms of precision, re- call and F1.... ..."

### Table 2. Algorithm Performance.

"... In PAGE 13: ... Algorithm Performance. of constraint violations found in each run was kept and the results summarised in Table2 . The first column of results shows the mean (and standard deviation in brackets) of the number of constraint violations in the solutions found over each of the 10 runs of each algorithm.... In PAGE 13: ... The final column contains the percentage of nurse shift preferences satisfied. It is clear from the results in Table2 that all of the algorithms that employed case-based repair generation were able to find solutions with fewer constraint violations than those that used randomly generated repairs. Figure 2 compares the mean, minimum, and maximum number of constraint violations in the solutions found by each algorithm.... ..."

### Table 1: algorithm performance

"... In PAGE 6: ...poles of (A + BK) and greater tends to be the speed of the convergence of the trajectories to the origin inside the region of linearity. Considering the data above, Table1 shows the nal values 2 of , , obtained from the iterative algorithm proposed in Section 5 from di erent initial vectors and and di erentvalues of . The number of itera-... In PAGE 6: ...Table 1: algorithm performance Regarding Table1 we can notice the following: Smaller are the components of and , greater tends to be the obtained from (18). This illustrates the fact that by allowing saturation we can stabilize the system for a larger set of initial conditions.... ..."

### Table 3: Algorithm Performance.

"... In PAGE 8: ...Table 3: Algorithm Performance. The main conclusions taken from comparison of Table 2 and Table3 , are G70 The overall computing performance is reduced by approximately 13% when there is data communication. Communication processes have a minimum memory (cache memory, in particular) requirement by which there is contention with computing processes, and it is reflected on the computing performance reduction.... In PAGE 8: ...etween the maximum and minimum local computing times (16.42 and 15.6 respectively) is about 5%. The analysis on workload becomes non relevant when the communication times are taken into consideration (Table 2 and Table3 just show computing times). The amount of time taken by the communication routines is between 76 and 108 seconds for this problem size (n = 2000).... ..."

### Table 1: Algorithmic performance

2003

"... In PAGE 18: ... In our real world data, constellations of demand points and candidate locations which result in submatrices violating this property are rare. Thus, the test problems almost have the consecutive ones property, as can be seen in the Table1 (which will be described in detail below). In particular, the more rows of Acov already have the consecutive ones property, the fewer branchings are required by the algorithm in worst case.... In PAGE 20: .... Finally, C1, . . . , C5 are similar to the Bi, but with a density of 5 %. Table1 shows how our algorithm performed on these instances (where we set a time limit of one hour running time). It lists the following information: Before Reduction: Here we list the number of columns (Cols) and rows (Rows), where Total refers to the total number of rows and Split contains the number of rows with more than one block in the original formulation (SCP).... ..."

Cited by 2

### Table 1. Algorithm Performance

"... In PAGE 9: ...i.e. those with the least constraint violations) were recorded. Table1 shows the average results of 10 runs of each algorithm variant. The first column of results in Table 1 shows the average number of constraint violations in the best solution that was found in each the 10 runs of each algorithm.... In PAGE 9: ...i.e. those with the least constraint violations) were recorded. Table 1 shows the average results of 10 runs of each algorithm variant. The first column of results in Table1 shows the average number of constraint violations in the best solution that was found in each the 10 runs of each algorithm. A value of 0 indicates that feasibility was found on every run.... ..."

### Table 2. Algorithm Performance.

"... In PAGE 26: ...atisfied (i.e. the percentage of preference shifts specified in the preference rosters NPi that were satisfied in the final roster NRi). Table2 about here. It is clear from the results in Table 2 that all of the algorithms that employed case-based repair generation were able to find solutions with fewer constraint violations than those that used randomly generated repairs.... In PAGE 26: ... Table 2 about here. It is clear from the results in Table2 that all of the algorithms that employed case-based repair generation were able to find solutions with fewer constraint violations than those that used randomly generated repairs. Figure ?? compares the mean, minimum, and maximum number of constraint violations in the solutions found by each algorithm.... ..."

### Table 1: Algorithm Performance

"... In PAGE 6: ... To complete this proof we must also determine to what extend the value of Gs influences the number and location of valid positions. Our experimental results listed in Table1 empirically shows that the algo- rithm will terminate for 1 AK n AK 14, thus satisfying condi- tion 2. 4.... In PAGE 6: ... We consider the algorithm to be efficient, although not optimal in terms of area. Table1 shows the optimal area in grid positions for an n-Venn diagram compared to the actual area used by Algorithm 1. A grid of 1000x1000 was used to obtain the data in Table 1.... In PAGE 6: ... Table 1 shows the optimal area in grid positions for an n-Venn diagram compared to the actual area used by Algorithm 1. A grid of 1000x1000 was used to obtain the data in Table1 . The graph in Figure 17 clearly illustrates the exponential characteristics of the al- gorithm.... ..."