### Table 1. Isometry Classes of Optimal Indecomposable Binary Codes

2006

"... In PAGE 12: ... [4], Chapter 7), we refine the problem by requiring that the minimum distance of the codes searched for be high. As a result of the search, the author determined the number of isometry classes of optimal indecomposable binary linear codes as presented in Table1 . For small n and k, the table indicates the optimal minimum distance of binary (n, k)-codes as well as the number of isometry classes (in the exponent).... ..."

### Table 3: Cross-validation results with binary profile interface propensities

2007

"... In PAGE 4: ... The optimal values of Ph are different for different complexes. The results of cross-validation are then obtained with the optimal value of Ph and shown in Table3 . The improve- ment of the third SVM is significant in comparison with the other two SVMs.... In PAGE 5: ... The performances of Table 4 are close to those of Table 2, which indicates that the differences of residue interface propensities among different complexes can be negligible. The performances of Table 5 decrease significantly in comparison with those of Table3 , so the profile interface propensities are sensitive to the types of complexes. In other words, the propensities at the profile-level can give more exact description of interfaces than the propensities at the residue level.... ..."

### Table 13: The improvements over the binary method by optimizing di erent evaluation criterion.

"... In PAGE 19: ... Moreover, since the exact match ratio does not take partial matches into account, a slight change of thresholds easily results in very di erent ratios. We close this section by summarizing in Table13 the improvements over the binary method. The cyclic optimization is not considered.... ..."

### Table 4.1: Dataflow coverage statistics. Optimized Binaries Unoptimized Binaries

### Table 1: The increases of the optimal schedule length for complete binary trees.

Cited by 1

### Table 3: Phase comparison across 32-bit optimized and 64-bit optimized apsi binary versions

2007

"... In PAGE 9: ... The weights have slightly changed for VLI, but this is to be expected due to dif- ferences in compilation. Similar results can be seen for apsi in Table3 . For apsi the bias for the per-binary FLI approach for phase 2 changes from -0.... ..."

Cited by 2

### Table 4: Model Characteristics for Parallel Flowshop Problems Binaries CPU secs Optimality Gap (%)

2003

"... In PAGE 20: ... 6.3 Computational Results Unlike the case of the flowshop problem discussed in Section 5, the MILP models for the multi- stage flowshop with parallel units do not exhibit good computational performance as the problem size increases (see Table4 ). This is primarily due to the large number of binary variables that are required for modeling this problem.... In PAGE 20: ... This is primarily due to the large number of binary variables that are required for modeling this problem. Although the number of binary variables can be reduced by taking in to account the forbidden assignments and postulating an appropriate number of slots for the various units, it increases dramatically with problem size as can be seen from Table4 . The solution times reported are for makespan minimization.... ..."

Cited by 3

### Table 2. Trace entry data for Intel C Compiler (ICC) version 9 compiled binaries. Binaries are compiled with base optimization level.

2006

"... In PAGE 12: ... However, the cost of checking register state is very high as the number of trace entries is large. Table2 shows trace statistics similar to table 1 but for binaries compiled with ICC version 9 compiler. ICC is a more aggressive compiler and we used more aggressive optimization level, resulting in inlining and other optimizations to be applied.... ..."

Cited by 1

### Table IV. Ideal performance speedup. The numbers under the heading \Statically Optimized quot; illustrate the performance increase of a statically optimized binary over an unoptimized binary. The numbers under the heading \Object Layout Adaptation quot; and \Trace Scheduling quot; illustrate the performance increase of a binary after performing static optimization techniques as well as the corresponding optimization technique over a purely statically optimized binaries.

2003

Cited by 28

### TABLE I Comparison of Binary Tree Collapse (BTC) and Optimal Routing Table Constructor (ORTC).

1999

Cited by 14