### Table 6 displays the final section of the status file. At the top of page 6 is the Lemke iteration log. The columns are interpreted as follows:

1993

Cited by 14

### Table 9 presents the probabilities of terminating the trial due to the above 8 reasons under both sampling priors. Finally, as in section 5.1, we can present the probabilities of 20

"... In PAGE 28: ...016 0.000 Table9 : Distribution of stopping decisions when joint criteria (i), (ii), or (v) are considered. Stopping Stopping Decision Time 0 1 2 3 4 5 6 7 Total 1 0.... ..."

### TABLE I Meaning of status flags. and discuss the grid reduction algorithm. Then in section IV-B, we illustrate how the interpolation operator is de- ned. Finally, in section IV-C, the advantages of using the proposed multigrid-like technique for transient analysis are discussed.

2002

Cited by 30

### Table. The Reduced Observation Table algorithm, presented in Section 19.4.3, is similar to the Observation Table algorithm except it stores less information. Finally, Section 19.4.4 describes the Discrimination Tree algorithm which stores information in a binary tree.

2006

### Table. The Reduced Observation Table algorithm, presented in Section 19.4.3, is similar to the Observation Table algorithm except it stores less information. Finally, Section 19.4.4 describes the Discrimination Tree algorithm which stores information in a binary tree.

### TABLE I Meaning of status flags. and discuss the grid reduction algorithm. Then in section IV-B, we illustrate how the interpolation operator is de- fined. Finally, in section IV-C, the advantages of using the proposed multigrid-like technique for transient analysis are discussed.

### Table 1: The thirteen basic relations. The endpoint relations x? lt; x+ and y? lt; y+ that are valid for all relations have been omitted. and metric reasoning, together with the satis ability algorithm, and Section 4 presents the new maximal tractable algebras, and how to provide these with metric temporal information. In Section 5 and Section 6, we prove that the algorithm is correct, and that the algebras are maximal. Finally, Section 7 and Section 8 discuss and conclude the paper.

1997

"... In PAGE 4: ...e. the endpoint relations required by r (see Table1 ) are satis ed by the assignments of u and v. Then M is said to be a model of hV; Ei.... ..."

Cited by 22

### Table 2 Shape parameters of the features detected in examples of Fig. 10: the first to examples (c) and (d); the first column contains the feature identifier, finally, the fourth the average section length, as defined in Section 4

2006

Cited by 3