### Table 1: Elementary set operations

2005

Cited by 3

### Table 3. A sorted list of elementary sets

"... In PAGE 11: ... Example 6. Table3 shows a sorted list of the conjuncts/elementary sets for the... ..."

### TABLE II DT-CNN ALGORITHMS FOR THE ELEMENTARY SET OPERATORS AND THE ELEMENTARY MORPHOLOGICAL OPERATORS

### Table 2. Elementary sets with reduct A1 = fField; Locationg.

"... In PAGE 5: ... In the investment example, given a set of attributes A = fField; Location; Y earsg in which a user is interested, there are two reducts of A: A1 = fField; Locationg and A2 = fField; Y earsg. Table2 shows (D; R(A1)) where each cell corresponds to an elementary set. Since tuples in an elementary set have identical attribute values, each of them is labeled instead using its company name.... ..."

### Table 1 below gives the elementary parameter settings for the Evolutionary engine.

in ABSTRACT On the Spectacular Benefits of Inoculation: an Example in Train Scheduling Draft Version

"... In PAGE 7: ... Table1 : EA parameters Table 2 details and gives convenient IDs to the various al- gorithmic variants described earlier and whose results are compared below. The T column describes the way in which the mutation strength T is set during the run; a b subscript indicates the use of the binomial procedure de- scribed in Section 4.... ..."

### Table 1. Functions for the calculation of transition sets of elementary subsystems

"... In PAGE 6: ...peci#0Ccation. An example of such a structure is shown in Fig. 3. Processes I and Q 0 correspond to simple processes of this model. The set of transitions of an elementary system can now be determined from its CCS description using the recursive functions shown in Table1 . Def#28E#29 denotes the de#0Cning equation of a process E which is either of the form E = a:E 1 or E = E 1 + E 2 .... ..."

### Table 2.Elementary Landscapes. Problem Move Set K 1?

"... In PAGE 44: ...e nition. Let ? be a graph, the Laplacian of ? and f a landscape on ?. We say f is elementary if f + K0(f ? f) = 0; (43) where f = hfi = 1=N P x2? f(x) is the average value of f, and K0 is a constant. Grover (1992) observed that the landscapes of a number of classical combinatorial optimization problems are of this form, see Table2 . In order to keep the notation consistent with Grover apos;s work for regular graphs we introduce K = K0=D where D is as usual the vertex degree.... ..."

### Table 1: Statistics for the training and testing sets for the comprehensive and elementary versions.

2003

"... In PAGE 5: ... The rest (92 pairs) was used for the Vertical Clustering. Nine text pairs were used for training (see Table1 for statistics). Human Annotation.... ..."

Cited by 15

### Table 1: Statistics for the training and testing sets for the comprehensive and elementary versions.

2003

"... In PAGE 5: ... The rest (92 pairs) was used for the Vertical Clustering. Nine text pairs were used for training (see Table1 for statistics). Human Annotation.... ..."

Cited by 15

### Table 1: Statistics for the training and testing sets for the comprehensive and elementary versions.

2003

"... In PAGE 5: ... The rest (92 pairs) was used for the Vertical Clustering. Nine text pairs were used for training (see Table1 for statistics). Human Annotation.... ..."

Cited by 15