### Table 3), there is evidence of improvement in team-based problem solving, such as giving constructive criticism and providing a reasoned analysis of other teams apos; approaches.

2000

"... In PAGE 12: ... On the negative side, the majority of students reported on communication breakdown, lack of negotiation skills, and difficulties experienced in sharing ideas. One question that elicited some interesting responses was: quot;How do others influence the development of your ideas and skills? quot; Table3 shows that a range of personal knowledge skills were developed and demonstrated in the reflective tasks undertaken by individuals. Some examples correspond with Erhaut apos;s (1994) definition of personal knowledge, for example, interdependence, multiple perspectives and awareness of the assumptions underpinning one apos;s own view.... In PAGE 13: ... Table3 : Examples of personal knowledge developed by students Other areas of personal knowledge that emerged from the transcripts were development of reasoning, self-awareness and an appreciation of multiple perspectives. Further evidence of the development of team skills can be inferred from the results of the team processing and feedback mechanisms that were built on assessment design.... ..."

Cited by 1

### Table 2: Technology Mapping results

"... In PAGE 8: ... The results show that the Boolean approach reduces the number of matching algorithm calls, nd smaller area circuits in better CPU time, and reduces the initial network graph because generic 2-input base function are used. Table2 presents a comparison between SIS and Land for the library 44-2.genlib, which is distributed with the SIS package.... ..."

### Table 1. Comparisons of results over ten seeds

1998

"... In PAGE 6: ... The 600,000 value was appropriate for the larger Armour and Buffa problem while the smaller Bazaraa problem converged in much fewer number of solutions searched. Objective function values from the perimeter metric are in Table1 , where the best, median, worst and standard deviation over ten random seeds are shown. The twenty department Armour and Buffa (A amp;B) problem was studied with maximum aspect ratios of 10, 7, 5, 4, 3 and 2, which represent problems ranging from lightly constrained to extremely constrained.... ..."

Cited by 3

### Table 3b. Solution Statistics for Model 2 (Minimization)

1999

"... In PAGE 4: ...6 Table 2. Problem Statistics Model 1 Model 2 Pt Rows Cols 0/1 Vars Rows Cols 0/1 Vars 1 4398 4568 4568 4398 4568 170 2 4546 4738 4738 4546 4738 192 3 3030 3128 3128 3030 3128 98 4 2774 2921 2921 2774 2921 147 5 5732 5957 5957 5732 5957 225 6 5728 5978 5978 5728 5978 250 7 2538 2658 2658 2538 2658 120 8 3506 3695 3695 3506 3695 189 9 2616 2777 2777 2616 2777 161 10 1680 1758 1758 1680 1758 78 11 5628 5848 5848 5628 5848 220 12 3484 3644 3644 3484 3644 160 13 3700 3833 3833 3700 3833 133 14 4220 4436 4436 4220 4436 216 15 2234 2330 2330 2234 2330 96 16 3823 3949 3949 3823 3949 126 17 4222 4362 4362 4222 4362 140 18 2612 2747 2747 2612 2747 135 19 2400 2484 2484 2400 2484 84 20 2298 2406 2406 2298 2406 108 Table3 a. Solution Statistics for Model 1 (Maximization) Pt Initial First Heuristic Best Best LP Obj.... In PAGE 5: ...) list the elapsed time when the heuristic procedure is first called and the objective value corresponding to the feasible integer solution returned by the heuristic. For Table3 a, the columns Best LP Obj. and Best IP Obj.... In PAGE 5: ... report, respectively, the LP objective bound corresponding to the best node in the remaining branch-and-bound tree and the incumbent objective value corresponding to the best integer feasible solution upon termination of the solution process (10,000 CPU seconds). In Table3 b, the columns Optimal IP Obj., bb nodes, and Elapsed Time report, respectively, the optimal IP objective value, the total number of branch-and-bound tree nodes solved, and the total elapsed time for the solution process.... ..."

### Table 1: Statistics for the Sentences of the Bird, Bat,

1994

Cited by 4

### Table 6: Solving Sokoban problems with q pattern data bases optimally (continued).

2001

"... In PAGE 13: ... Only an overall searching scheme can prevent the algorithm of getting trapped. In the experiments of Table 5 and Table6 we used a series of 52 automatically generated problems [17]. The screens were then compiled to PDDL, with a one-to-one ball-to-goal mapping such that some problems become unsolvable.... ..."

Cited by 49

### Table 5: Results of the capacitated facility locations problems on the AP1000

### Table 6 summarizes the simulated results of applying the various partitioning algorithms to a classifier configured with 8 workers, using the Penman Upper Model KB. The first three rows show the effect of limiting the Chipping algorithm to 0 iterations (i.e., random partitions), 1 iteration, and the maximum amount of iterations required by the algorithm. Efficiency of the algorithm improved from .44 to .51, a 15% improvement in performance. The Graph Numbering algorithm yielded an efficiency of .49, or an 11% efficiency improvement. The Branch Growing algorithm outperformed both the Chipping and Graph- Numbering algorithm: efficiency was boosted to .60, for an overall performance improvement of 36%.

"... In PAGE 14: ... Table6 . Effect of Various Partitioning Algorithms on Penman UpperModel KB (with 8 workers) These preliminary results are strongly suggestive that significant performance benefits can be obtained when partitioning algorithms are applied to a knowledge base.... ..."

### Table 3. Fuzzy rule bases for the control of pc and pm, respectively The FLCs-based AGA stood out as the most e cient algorithm against a standard GA in solving the TSP and other optimization problems.

1998

"... In PAGE 13: ... Both of them had the same inputs: generation and population size. The fuzzy rule bases considered are shown in Table3 . The authors claimed that part of the mechanism for creating fuzzy rules for adapting pm is that this one should increasingly diminish when the GA approaches convergence to... ..."

Cited by 3

### Table 2. Computation efficiency improvement by reducing the redundancy

"... In PAGE 5: ... The same randomly generated systems are used. The average CPU times to find the optimal voltage schedules by apply- ing Algorithm 1 or Algorithm 2 to construct the NAP job sets are collected and shown in Table2 . Table 2 shows the dramatic reduction of computational cost by applying Algo- rithm 2, especially for systems with a large number of jobs.... ..."