### Table 2. Computational remits for networks with general interference constraints

### TABLE II General interference situations

1997

Cited by 4

### TABLE I General interference situations

### Table 1: Interference probability

"... In PAGE 5: ... Using these values we computed the interference probability. Table1 shows the interference probability P2 for di erent group sizes, the read rate ( ) values obtained from the experiment, and for di erent read request arrival rates varying from 1 req/sec to 0:01 req/sec. Since we have assumed that the update rate is 1, the interference probability evaluates to be the same both under the exponential (M) and deterministic (D) model for the read and update times.... ..."

### Table 1. Parameters of the Interference Model

"... In PAGE 5: ...he IEEE 802.15.4 and W for the IEEE 802.11b. The other parameters are listed in Table1 . The TC is the collision time.... ..."

### Table 4 Implementation of interference model

### Table 2. Table 2: Performance Parameters of the Adaptive Interference Cancellers.

2007

### Table 4: Benefits of using the cumulative interference constraints

"... In PAGE 13: ...7 Comparison of the models Table4 gives the comparison between the model including the cumulative interference constraints (columns #viol1, viol1, cpu1) with the more constrained model which replaces the cumulative interference constraints by more constrained binary interference constraints (columns #viol2, span2, cpu2) for the first 20 instances. The results are obtained with the best heuristic (Large Neighbourhood Search method).... ..."

### Table 3. Number of nodes in the interference graphs

1993

"... In PAGE 10: ... To determine the growth in the size of the interference graph using load/store ranges, we recorded the number of nodes produced by each allocator. Table3 compares the number of nodes in the load/store interference graphs of our test programs with the number of nodes in the live range interference graph for the same programs. The third column in Table 3 lists the number of store ranges and the fourth lists the number of load ranges.... In PAGE 10: ... Table 3 compares the number of nodes in the load/store interference graphs of our test programs with the number of nodes in the live range interference graph for the same programs. The third column in Table3 lists the number of store ranges and the fourth lists the number of load ranges. The fth column gives the number of store ranges that contained only one load range.... In PAGE 10: ... The resulting number of load/store ranges is shown in the sixth column. The last column in Table3 shows the number of live ranges of the procedure. Comparing the last two columns of this table reveals that the number of load/store ranges is generally less than three times the... ..."

Cited by 15

### Table 2: Kinds of immediate memory subject to interference.

"... In PAGE 5: ... These two claims lead naturally to positing a portion of working memory that is coded speci cally in terms of syntactic features, but which still exhibits interference e ects. Retroactive interference and within-category similarity e ects Table2 lists a set of content categories for which there is some evidence of interference e ects in short-term memory, independent of decay. The table refers primarily to stud- ies demonstrating retroactive interference, which occurs when a to-be-remembered stimulus is followed by a set of distractor items that the subject must attend to in some fashion1 The general nding is that distractor items that are similar in kind to the original stimulus cause forgetting, while dissimilar items are far less disruptive.... ..."