### Table 1: Characteristics of Set Partitioning Problem Test Instances

1999

"... In PAGE 17: ... A nal instance arose in a two-phase approach to solving an inventory routing problem [8]. Table1 shows some statistics for the instances in our test suite. For each instance, we present the number of rows m, the number of columns n, and the density of the matrix .... In PAGE 17: ... Wewant to stress that it is not our intention to compare our computational results with CPLEX { weprovide this information only to give the reader a feeling for the \di culty quot;of eac h instance in our test suite. In Table1 , the instances above the rst line are the crew scheduling instances, above the second line are the bus scheduling instances, above the third line are the vehicle routing instances, and the nal instance comes from an inventory routing problem. 5.... ..."

### Table 5: Information stored in the problem structure Prob. Field Description

1999

"... In PAGE 5: ... d2r Compute the 2nd part of the Hessian matrix, Pi ri(x)@2ri(x)=dx2 The problem setup routine has two modes of operation; either return a string matrix with the names of the problems in the probSet or a structure with all information about the selected problem. The structure, named Prob, is shown in Table5 , and its subtables. We refer to the User apos;s Guide [34] for a full description of all di erent elds.... ..."

Cited by 3

### Table 2. Results for homogeneous number-partitioning problems

704

"... In PAGE 25: ...gain we consider the problem for various sets of numbers a1,. . . ,ak. The results are shown in Table2 . We remark that the problem data (1, 2, 3, 4) correspond to a problem equivalent to the... ..."

### Table 7: number partitioning results

2001

"... In PAGE 5: ... Obviously again, a solution is found when the total cost is equal to zero. Table7 (in the Appendix) details the performances of this algorithm on several instances. For a problem of size N the following settings are used: Tabu tenure is equal to 2 and 2 % of the variables are reset when one variable is Tabu.... ..."

Cited by 25

### Table 7: number partitioning results

2001

"... In PAGE 5: ... Obviously again, a solution is found when the total cost is equal to zero. Table7 (in the Appendix) details the performances of this algorithm on several instances. For a problem of size N the following settings are used: Tabu tenure is equal to 2 and 2 % of the variables are reset when one variable is Tabu.... ..."

Cited by 25

### Table 1: The classical axioms

1996

"... In PAGE 4: ... a-free) expressions. Examples of equations in the theory S are those in Table1 , called the classical axioms by Conway [6, page 25], and the laws xy = yx (x + y) = x y : Unlike the classical axioms, the laws above only hold under the assumption that the alphabet is a singleton. The following identity is an easy consequence of the classical axioms: 0 = 1 : (1) An example of an equation that is contained in E, but not in S, is a + x = a :... In PAGE 6: ...Table1 . Instantiating these equations, we derive that EF proves all of the equalities C14:n(a).... In PAGE 8: ... In that case, we shall simply write Mp[[P ]] for the denotation of P in the algebra Mp. It is not hard to see that the equations C1{13 in Table1 are sound in the algebra Mp. We now proceed to show that the algebra Mp meets the requirements P1 and P2 that we set out to achieve.... ..."

Cited by 8

### Table 2: Partitioning of the Training Sequences.

"... In PAGE 3: ... The problem of STR has now been de-coupled from the remaining problem. Only a set of four sequences #28d 1 ,d 4 , see Table2 #29 needs to be found to discriminate to the four higher modulation schemes. Note that the Walsh-Hadamard sequences are not a good solution here.... ..."

### Table 2: Quality of Greedy heuristic vs. Set Partitioning

2007

"... In PAGE 8: ... Observe too that the improvement is the largest for instances with the fewest number of lanes. Our second set of computational results, presented in Table2 , demonstrates the quality of the solutions produced by the greedy heuristic by comparing it to the solution produced by solving the set partitioning problem. We have used XPRESS-MP 2003 for the solution of the integer programs.... ..."

### Table 1 SQRAM Machine Classical Instruction Set

"... In PAGE 6: ... Stack top points just after the end of the valid data area. Table1 details the principal instructions used to control the classical com- ponent of the SQRAM and describes the effect of each instruction in an al- gorithmic notation. The notation includes the symbols st (the Stack Top), lb (the Local Base), pc (the value of the Program Counter), DS[i] (the contents of location i in the Data Store), and P S[i] (the contents of location i in the Program Store).... ..."

### Table 1: Example of Domain Partitioning and Local Numbering

"... In PAGE 3: ... The set of blocks that are not in the current processor, but needed to update components in the border set, is referred to as an external set. Table1 shows the partitioning results and one of the local numbering schemes for the sample problem presented in Figure 1a. The local numbering of gridblocks is done to facilitate the communication between processors.... ..."