### Table 2 Proposed detectors and their underlying assump- tions.

"... In PAGE 9: ... Table2 reviews the difierent proposed detectors. Their acronyms recall the underlying hypotheses about the noise model and the distribution of latent variables (i.... ..."

### Table 1.2 Construction of all groundings of a rst-order formula under Assump- tions 1{3.

### Table 5. Possible results as a function of the number of eyes, under no assump- tions (left) and under the assumption of enough shared liberties (right). Stars mark cases that depend on the assumption.

1996

"... In PAGE 26: ... In order to simplify the analysis in what follows, we will usually assume that the number of shared liberties is su ciently large that the outside liberty count can be ignored, so that whichever side makes the most eyes wins the battle or, if the eyes made are equal and less than two, both sides live in seki. Table5 shows the possible results of a semeai as a function of the number of Black and White eyes, in the fully general case and after the simplifying assumption has been made. After this simpli cation, the result depends only on the di erence between the... ..."

Cited by 9

### Table 5. Possible results as a function of the number of eyes, under no assump- tions (left) and under the assumption of enough shared liberties (right). Stars mark cases that depend on the assumption.

"... In PAGE 26: ... In order to simplify the analysis in what follows, we will usually assume that the number of shared liberties is sufficiently large that the outside liberty count can be ignored, so that whichever side makes the most eyes wins the battle or, if the eyes made are equal and less than two, both sides live in seki. Table5 shows the possible results of a semeai as a function of the number of Black and White eyes, in the fully general case and after the simplifying assumption has been made. After this simplification, the result depends only on the difference between the number of Black eyes and White eyes.... ..."

### Table 6.10: Results of modular veri cation for properties concerning safety of the magnets (see Appendix A, page 83, for the full commitments and assump- tions)

### Table 5. Possible results as a function of the number of eyes, under no assump- tions (left) and under the assumption of enough shared liberties (right). Stars mark cases that depend on the assumption.

"... In PAGE 26: ... In order to simplify the analysis in what follows, we will usually assume that the number of shared liberties is su ciently large that the outside liberty count can be ignored, so that whichever side makes the most eyes wins the battle or, if the eyes made are equal and less than two, both sides live in seki. Table5 shows the possible results of a semeai as a function of the number of Black and White eyes, in the fully general case and after the simplifying assumption has been made. After this simpli cation, the result depends only on the di erence between the number of Black eyes and White eyes.... ..."

### Table 1.2: Static quark model predictions. The experimental results are also listed for comparison.The agreement in Table 1.2 is quite good considering the simplicity of the assump- tions used in formulating SQM. However it is clear that further corrections to SQM are

1995

### Table 2: The Single-Request Modi ed Order Promis- ing Procedure. Theorem 1 Under the resource non-sharing assump- tion, a modi ed Order Promising algorithm (MOPA) is linear on the number of states and actions. Proof: After an edge is traversed for the rst time, both of its end nodes have quot;examined quot; ags set to true. This memorization quot;trick quot; prevents repeated ex-

"... In PAGE 4: ... These algorithms utilize the advantages of the newly intro- duced manufacturing modeling style and may be used as the back-end of an e-commerce system tailored to- wards re-con gurable products. A modi cation of a simple, recursive order promis- ing algorithm (OPA) is presented in Table2 , it pro- vides an earliest possible date that a considered order can be satis ed. The di erence between State and Ac- tion nodes is re ected in the date selection mechanism.... ..."

### Table I. The tradeoff between disk space utilization and disk bandwidth utilization. The first column lists the fraction of information still alive when the log wraps on it. The second column lists the fraction of raw disk bandwidth that can be utilized to write new information (this assumes that half the bandwidth is used to read back the old contents of the log; of the remaining half, some is used to rewrite live information and the rest is used to write new in- formation). The third column contains disk space utilization, computed under the assump- tion of exponentially-distributed file lifetimes.

1989

Cited by 133

### Table I. The tradeoff between disk space utilization and disk bandwidth utilization. The first column lists the fraction of information still alive when the log wraps on it. The second column lists the fraction of raw disk bandwidth that can be utilized to write new information (this assumes that half the bandwidth is used to read back the old contents of the log; of the remaining half, some is used to rewrite live information and the rest is used to write new in- formation). The third column contains disk space utilization, computed under the assump- tion of exponentially-distributed file lifetimes.

1989

Cited by 133