### Table 4 - Distribution of pairs among the AImed abstracts Pairs per Abstract

### Table 5: Abstract Distributed by Year and Protocol Type

1994

"... In PAGE 12: ... Table 4 shows the report distributions by Internet domain hierarchy (see also Figure 8). Table5 shows the distribution of the abstracts. Appendix C shows the top 25 most retrieved reports.... ..."

### Table 5: Abstract Distributed by Year and Protocol Type

"... In PAGE 12: ... Table 4 shows the report distributions by Internet domain hierarchy (see also Figure 8). Table5 shows the distribution of the abstracts. Appendix C shows the top 25 most retrieved reports.... ..."

### Table 28. Distribution of basic abstract styles

1997

### Table 1. Comparison of the snapshot algorithms.

1995

"... In PAGE 9: ... This paper first presented a formal definition of the global state of a distributed system and exposed issues related to its capture; it then described several algorithms to record a snapshot of a distributed system under various communication models. Table1 gives a comparison of the salient features of the various snapshot-recording algorithms. Clearly, the higher the level of abstraction provided by a communication model, the simpler the snapshot algorithm.... ..."

### Table 1: An Example Abstract

1995

"... In PAGE 9: ... One algorithm (we term the FFA algorithm) is based on quot;fixing quot; all attributesexcept one, the quot;free quot; attribute, and comparing across the values of the free attribute. Using the abstract in Table1 , we can fix loan-outcome (say to quot;approved quot;) and allow purchaseitem to vary. We then fix loan-outcome to quot;rejected7 apos; and repeat the process.... ..."

Cited by 1

### Table 2: Algorithm for Producing Abstraction Hierarchies

1990

"... In PAGE 3: ...em space. The hierarchy is ordered such that the highest level is the most abstract. The nal hierarchy has the ordered monotonicity property [ Knoblock, 1990a ] ,which requires that the literals are partitioned in suchaway that the achievement of a literal introduced at one level cannot change the truth value of a literal in a more abstract level. The algorithm for producing a hierarchy of abstraction spaces is shown in Table2 . The algorithm forms a directed graph, where the vertices of the graph represent one or more lit- erals (called a literal class) and the edges represent constraints between literals.... ..."

Cited by 6

### Table 2: Abstract Parsing Algorithm Input:

"... In PAGE 21: ... 5.3 Worst-Case Computational Complexity The abstract parsing algorithm in Table2 has several sources of computational complexity. If the simplest possible search strategy is used (such as CKY), then the dominant source of complexity is the logic.... In PAGE 33: ... For example, it is possible to compute the reverse value of the NP in Figure 6 as soon as the forward value of the V is known, without having computed the forward value of the S, the D, or the N. It is possible to elaborate the abstract parsing algorithm in Table2 so that it computes reverse values using Equation 32.... ..."

### Table 2: Abstract Parsing Algorithm Input:

"... In PAGE 21: ... 5.3 Worst-Case Computational Complexity The abstract parsing algorithm in Table2 has several sources of computational complexity. If the simplest possible search strategy is used (such as CKY), then the dominant source of complexity is the logic.... In PAGE 33: ... For example, it is possible to compute the reverse value of the NP in Figure 6 as soon as the forward value of the V is known, without having computed the forward value of the S, the D, or the N. It is possible to elaborate the abstract parsing algorithm in Table2 so that it computes reverse values using Equation 32.... ..."

### Table 2: Performance of Jensen Algorithm on Abstracted Networks

1996

"... In PAGE 14: ... However, the two networks have the same topological structure. Table2 shows the results of evaluating exact and coarsened versions of these networks using the Jensen algorithm. Here we instantiated a root node and queried a leaf node in both networks.... ..."

Cited by 3