### TABLE I Comparison of buffer cost on the practical examples.3 Ex. APGAN RPMC MC HC EA EA + (RAPGAN) APGAN

### Table 2: Comparison of performance on practical examples; the probabilistic algorithms stopped after 3000 tness evaluations. BMLB stands for a lower bu er limit: bu er memory lower bound.4 lt; APGAN RPMC MC HC EA EA +

1998

"... In PAGE 8: ... We also tried a modi ed version of the EA which rst runs APGAN and then inserts the computed topological sort into the initial population. Table2 shows the results of applying GDPPO to the schedules generated by the various heuristics on several practical SDF graphs; the satellite re- ceiver example is taken from [16], whereas the other examples are the same as considered in [3]. The probabilistic algorithms ran once on each graph and were aborted after 3000 tness evaluations.... In PAGE 8: ... Additionally, an exhaustive search with a maximum run-time of 1 hour was carried out; as it only com- pleted in two cases3, the search spaces of these problems seem to be rather complex.In all of the practical benchmark examples in Table2 the results achieved by the EA equal or surpass those generated by RPMC. Compared to APGAN on these practical examples, the EA is neither inferior nor superior; it shows both better and worse performance in two cases each.... ..."

Cited by 12

### Table 2: Comparison of performance on practical examples; the probabilistic algorithms stopped after 3000 tness evaluations. BMLB stands for a lower bu er limit: bu er memory lower bound.4 lt; APGAN RPMC MC HC EA EA +

"... In PAGE 8: ... We also tried a modi ed version of the EA which rst runs APGAN and then inserts the computed topological sort into the initial population. Table2 shows the results of applying GDPPO to the schedules generated by the various heuristics on several practical SDF graphs; the satellite re- ceiver example is taken from [16], whereas the other examples are the same as considered in [3]. The probabilistic algorithms ran once on each graph and were aborted after 3000 tness evaluations.... In PAGE 8: ... Additionally, an exhaustive search with a maximum run-time of 1 hour was carried out; as it only com- pleted in two cases3, the search spaces of these problems seem to be rather complex.In all of the practical benchmark examples in Table2 the results achieved by the EA equal or surpass those generated by RPMC. Compared to APGAN on these practical examples, the EA is neither inferior nor superior; it shows both better and worse performance in two cases each.... ..."

### Table 2: Comparison of performance on practical examples; the probabilistic algorithms stopped after 3000 tness evaluations. BMLB stands for a lower bu er limit: bu er memory lower bound.4 lt; APGAN RPMC MC HC EA EA +

"... In PAGE 8: ... We also tried a modi ed version of the EA which rst runs APGAN and then inserts the computed topological sort into the initial population. Table2 shows the results of applying GDPPO to the schedules generated by the various heuristics on several practical SDF graphs; the satellite re- ceiver example is taken from [16], whereas the other examples are the same as considered in [3]. The probabilistic algorithms ran once on each graph and were aborted after 3000 tness evaluations.... In PAGE 8: ... Additionally, an exhaustive search with a maximum run-time of 1 hour was carried out; as it only com- pleted in two cases3, the search spaces of these problems seem to be rather complex.In all of the practical benchmark examples in Table2 the results achieved by the EA equal or surpass those generated by RPMC. Compared to APGAN on these practical examples, the EA is neither inferior nor superior; it shows both better and worse performance in two cases each.... ..."

### Table 2: Comparison of performance on practical examples;; the probabilistic

1998

"... In PAGE 8: ... We also tried a modi ed version of the EA which rst runs APGAN and then inserts the computed topological sort into the initial population. Table2 shows the results of applying GDPPO to the schedules generated by the various heuristics on several practical SDF graphs;; the satellite re- ceiver example is taken from [16], whereas the other examples are the same as considered in [3]. The probabilistic algorithms ran once on each graph and were aborted after 3000 tness evaluations.... In PAGE 8: ... Additionally, an exhaustive searchwithamaximum run-time of 1 hour was carried out;; as it only com- pleted in two cases 3 , the search spaces of these problems seem to be rather complex. In all of the practical benchmark examples in Table2 the results achieved by the EA equal or surpass those generated by RPMC. Compared to APGAN on these practical examples, the EA is neither inferior nor superior;; it shows both better and worse performance in two cases each.... ..."

Cited by 12

### Table 4: Tabular format for recording EA results

2001

"... In PAGE 5: ... However, we have found that a tabular format provides a practical way of presenting the information. Table4 shows a typical arrangement, while Table 6 provides an example for the first case study discussed next. This format is also consistent with other styles of error analysis prevalent in safety assessment and provides a useful object for external assessment of the results of the evaluation.... ..."

Cited by 15