### Table 1. Probabilistic User Model

2006

"... In PAGE 4: ... In these studies, users marked 85% of formula cells on average when testing and debugging spreadsheets, often placing check-marks on cells, and rarely placing a23-marks on cells. Of the cells that users marked, users in our earlier studies made mistakes according to the probabilities given in Table1 , so for our study, we simulated user behavior based on these probabilities. The bold numbers in Table 1 highlight false positive (check on incorrect value) and false negative (a23 on correct value) oracle mistakes.... ..."

Cited by 2

### Table 5 Probabilistic model parameters

2006

Cited by 1

### Table 8: Probabilistic model: Terminology

"... In PAGE 38: ... Notation P denote the path being currently considered. Table8 summarizes the notation. 1 1 1 0.... ..."

### Table 1. Comparison of observed compositions with both possibilistic, extended possibilistic and probabilistic models (all ps lt;.0005).

"... In PAGE 3: ...ramework (e.g., negative predicted values). In order to reinforce the case against Possibility Theory, those measures were withdrawn from computation of the agreement between data and the probabilistic model. Results show that the probabilistic and possibilistic models both fitted the data ( Table1... ..."

### Table 5. Reward variables for Courier protocol model.

1997

"... In PAGE 13: ... Also, of the 144 Mbytes necessary to compute the solution, 118 Mbytes of it are needed just to hold the solution vector. In Table5 we show several of several of the reward variables in the model as N varies from 1 to 6. The #15 we compute here corresponds to measuring #15 lsp in the model, which corresponds to the user apos;s message throughput rate.... ..."

Cited by 6

### Table 1 Characteristics and reward variables for the Kanban model.

"... In PAGE 12: ... We chose to solve the model in which the synchronizing transitions are timed. Table1 shows some information about the model and the corresponding tran- sition rate matrix. Here, N represents the maximum number of tokens that may be in a subnet at one time.... ..."

### Table 5 Reward and cost matrices

"... In PAGE 10: ... To run NLP-1, we require a complete model of the game defined in Section 2. The Appendix contains the complete state tran- sition functions for the attacker (Table 2) and ad- ministrator (Table 3), the state transition proba- bilities (Table 4), and the costs/reward function ( Table5 ). We now explain the experimental setup for our example.... ..."

### Table 8 shows the reward function.

"... In PAGE 7: ... Table8 : Reward function for example 3 The observation function is in table 9. To keep the model at a reasonable size, we have simplified the function a little bit: we assume that there is no observation after a treatment, and that a surgery on a healthy patient yields no new information to the agent (which sounds very strange).... ..."

### Table 3: Reduction rates and running times for the Stanford bunny model (69,473 triangles) with different fairness criteria and error bounds.

1998

Cited by 71

### Table 1. Rewards (economic net returns), rd i, depending on state and action.

in Contents

1996

"... In PAGE 7: ... The economic net returns from the cow will of course depend on whether it is low yielding or high yielding and whether it is kept or replaced. In the model this is represented by a reward depending on state and action as appearing in Table1 . Those amounts are simply the annual net returns from a low, average and high yielding cow respectively.... In PAGE 16: ... However, a seasonal variation in rewards or physical outputs is easily modeled by including a state variable describing season (each state is usually defined by the value of a number of state variables describing the system). An advantage of the policy iteration method is that the equations in Table1 are general. Under any policy s we are able to calculate directly the economic consequences of following the policy by solution of the equations.... In PAGE 26: ... Thus the objective function (5) is applied, and no discounting is performed. In Table1 3, optimal policies under the three criteria are shown. It appears that the policies under the first two criteria are quite similar, but under the third criterion the optimal policy differs significantly.... ..."