### TABLE XII COMPARISON OF THE TIME AND SOLUTION COMPLEXITY OF DIFFERENT CLASSIFICATION METHODS

### Table 2: Solutions found by complex OWA models

in Abstract

2002

"... In PAGE 14: ...To demonstrate wider gamut of the equitable preferences supported by OWA modeling we have built and solved several more complex models. Table2 presents results for four such models. All them were analyzed on the basic decision problem without any upper bound on gk.... ..."

### Table 2 Solutions found by complex OWA models

2002

"... In PAGE 11: ... To demonstrate a wider gamut of the equitable preferences supported by OWA modeling we have built and solved several more complex models. Table2 presents results for four such models. All of them were analyzed on the basic decision problem without any upper bound on gk.... ..."

### Table 1 Complexity of solution verification and consistency checking

1994

### Table 1: Previous complex radiosity solutions.

1994

"... In PAGE 1: ...Table 1: Previous complex radiosity solutions. Several complex radiosity computations have been reported in the literature ( Table1 ). Perhaps the most complex is the Candle- stick Theater reported in Baum et al [1].... ..."

Cited by 53

### Table 1: Previous complex radiosity solutions.

"... In PAGE 1: ...Table 1: Previous complex radiosity solutions. Several complex radiosity computations have been reported in the literature ( Table1 ). Perhaps the most complex is the Candle- stick Theater reported in Baum et al [1].... ..."

### Table 1: Previous complex radiosity solutions.

"... In PAGE 1: ...Table 1: Previous complex radiosity solutions. Several complex radiosity computations have been reported in the literature ( Table1 ). Perhaps the most complex is the Candle- stick Theater reported in Baum et al [1].... ..."

### Table 2. Solution time and complexity of three models for example 1

2003

"... In PAGE 15: ...F.) values are consistent from the three models, as shown in Table2 . It also shows the solution time in each case and the complexity of each model in terms of number of variables (binary and continuous), number of equations, and number of non-zero coefficients in the equations.... ..."

Cited by 5

### Table 3. Solution time and complexity of three models for example 2

2003

Cited by 5

### Table 2: Runtime distributions and average solution complexity in the Spacecraft domain (#actions does not include maintenance actions).

"... In PAGE 7: ... Four problems that tp4 didn apos;t solve within 600 seconds were excluded. (b) Table2 shows runtime distributions for tp4 in the spacecraft domain, for varying numbers of goals (all problem instances have 15 directions, on average 5 combinations of instrument/calibration target for each observation, and allow on average 1:66 concur- rently active instruments). (c) Table 3 shows the amount of search (nodes ex- panded) and number of DFS iterations (indicating the discrepancy between estimated and optimal so- lution costs), with randomly assigned action dura- tions in increasing intervals (the problems, from the 3-operator blocksworld domain with 7 { 14 blocks, 3tp4 is implemented in C.... ..."