### Table 2. Performance of positional baseline, decision-based, and probabilistic systems (precision, recall, and F-measure). Probabilistic systems

2003

"... In PAGE 6: ... Even though these sets are inde- pendent, both contain sample essays from all prompt topics. Table2 compares the overall performance of the decision- and probabilistic- based systems to the positional baseline. Three of the four systems (decision-based, proba- bilistic-local, and probabilistic-global) signif- icantly outperform the baseline.... In PAGE 6: ...sed C5.0 for our voting models. Table 3 compares the positional baseline system, the best single system (that is, the decision-based system), and a voting system. For the single system, the results in Table 3 represent the same runs used in Table2 for the decision-based system Using the 10-fold cross-validation, the voting algorithm outperforms the baseline algorithm and the single system at both the category and overall system levels. Topic independence In a classroom, teachers can give students writing assignments on any topic.... ..."

Cited by 19

### Table 1. Hennessy-Milner logics for discrete probabilistic systems.

### TABLE 2. - DEMAND-BASED PROBABILISTIC SYSTEM ANALYSES (IRRAS),

### TABLE 3. - TIME-BASED PROBABILISTIC SYSTEM ANALYSES (IRRAS),

### Table 4. Alternative formulation of the probabilistic transition system for the pa- calculus.

2000

"... In PAGE 21: ... North Holland. Appendix A Table4 presents an equivalent transition system for the pa-calculus where no assumptions on the bound variables are made. Note that the side condition on the rule Sum is necessary for treating cases like 1=2 x(y):0 + 1=2 x(y):0.... ..."

Cited by 4

### Table 3. The probabilistic transition system of the p-calculus.

2005

Cited by 21

### Table A.1. Alternative formulation of the probabilistic transition system for the pipa- calculus.

### Table II Performance of neural network, probabilistic, and hybrid systems

### Table 1. List of detectors combined probabilistically, and resulting performance of composite system.

### Table 1. A system is said to be purely probabilistic if its behaviour can be completely speci ed by a probabilistic distribution. A system is called a generalized probabilistic system if it exhibits both a probabilistic behaviour and a nondeterministic behaviour. (These terms are de ned in the next section.) S stands for the size of a system, and F for the size of a formula.

"... In PAGE 18: ... Table1 : Time complexities of model checking procedures in probabilistic logics. S denotes the size of the system being veri ed and F stands for the size of a formula that specify a probabilistic temporal property.... ..."