### Table 1 The solution space for the four finite sets in Figure 1

"... In PAGE 4: ... Three subsets, C3, C2, and C1 represent {1, 3, 5}, {2, 4, 6} and {1, 4, 6}, respectively, for C. Table1 denotes solution space of 3-dimensional matching for the four finite sets in Figure 1. In Table 1, the binary number, 000, indicates that the corresponding 3-dimensional matching is empty.... In PAGE 4: ... Table 1 denotes solution space of 3-dimensional matching for the four finite sets in Figure 1. In Table1 , the binary number, 000, indicates that the corresponding 3-dimensional matching is empty. In Table 1, the binary numbers, 001, 010, and 011, represent that those corresponding 3-dimensional matching are {C3}, {C2}, and {C2, C3}, respectively.... In PAGE 4: ... In Table 1, the binary numbers, 001, 010, and 011, represent that those corresponding 3-dimensional matching are {C3}, {C2}, and {C2, C3}, respectively. The binary numbers, 100, 101, and 110, in Table1 represent that those corresponding 3-dimensional matching, subsequently, are {C1}, {C1, C3}, and {C1, C2}. In Table 1, the binary number, 111, represents that the corresponding 3-dimensional matching is {C1, C2, C3}.... In PAGE 4: ... The binary numbers, 100, 101, and 110, in Table 1 represent that those corresponding 3-dimensional matching, subsequently, are {C1}, {C1, C3}, and {C1, C2}. In Table1 , the binary number, 111, represents that the corresponding 3-dimensional matching is {C1, C2, C3}. Though there are eight 3-digit binary numbers for representing eight possible 3-dimensional matching in Table 1, not every 3-digit binary number corresponds to a legal solution.... In PAGE 4: ... In Table 1, the binary number, 111, represents that the corresponding 3-dimensional matching is {C1, C2, C3}. Though there are eight 3-digit binary numbers for representing eight possible 3-dimensional matching in Table1 , not every 3-digit binary number corresponds to a legal solution. Hence, in the following subsection, basic biological operations are used to develop an algorithm for removing illegal solutions and determining legal answers.... ..."

### lable constraints to denote small finite candidate sets

1998

Cited by 1

### Table 6.1 gives the set of finite elements that make this well defined and stable.

### TABLE V OPTIMAL PERFORMANCE SETTINGS FOR CRAY XT3 FOR FINITE VOLUME DYCORE

### TABLE III OPTIMAL PERFORMANCE SETTINGS FOR IBM P690 CLUSTER FOR FINITE VOLUME DYCORE

### TABLE IV OPTIMAL PERFORMANCE SETTINGS FOR CRAY X1E FOR FINITE VOLUME DYCORE

### Table 1: Set expressions in Z and Haskell. 1 Finite Sets: (Set a) This nite set type is derived from page 228 of Bird and Wadler [BW88]. However, several functions are renamed and many functions are added so that all of the set operations of Z are supported. Table 1 shows the relationship between Z set operators and the corresponding functions de ned in this module (S and T stand for arbitrary ( nite) set expressions and X stands for a (possibly in nite) Haskell type or its Z equivalent). Note that functions such as union, inter and in are typically used as in x functions (e.g., a `mem` xs).

1994

Cited by 1

### Table I. A Subset of the Action Signature of DCNP. Notation: Agent, Agent2, C, E range over {c1,e1,...,en} Perf ranges over {cfp,bid,award,reject,inform,pay} Content, Content2 range over a finite set of task descriptions Round ranges over Z+, the set of positive integers

2007

Cited by 6

### Table 1. Core Distributed Resources The core resources, as described in the above table, are shared by applications across the distributed environment. This finite set covers the majority of resources which are shared in a distributed system. By careful management and control of these, we can begin to prioritise resource utilisation and hence offer QoS- guarantees.

1998

Cited by 2

### Table 3: Computational times associated with parallel implementation of the finite element model.

2007

"... In PAGE 64: ... This ensured that the perturbed displacement data sets were still contained within the atlases. Results Parallel implementation of the Finite Element Model Table3 illustrates the computational time necessary to solve the biphasic model on a finite element mesh containing 19468 nodes and 104596 elements, using 16 processors (2.8GHz,... ..."