### Table 1 Results for the OlBcp.

in Bincoloring

"... In PAGE 20: ... square 8 Remarks We have studied the bin coloring problem, which was motivated by applica- tions in a robotized assembly environment. The investigation of the online problem from a competitive analysis point of view revealed a number of oddi- ties (see Table1 for an overview of our results). A natural greedy-type strategy greedyfit achieves a competitive ratio strictly worse than arguably the most stupid algorithm (onebin).... ..."

### TABLE 1 Simulation Results for GREEDY and other strategies

1995

Cited by 46

### Table 1 Time and minimization results for greedy and optimal strategies.

"... In PAGE 8: ...bsolute value of x, i.e., j[x]j = hx0i If x is negative, then x0 = x, and obviously j[x]j = [x] = hx0i + 1 Combining both cases results in j[x]j = hx0i + xn 1 As x0 n 1 is always zero, we get j[x]j = hx0 n 2 : : : x0 0i + xn 1 The pseudo-Boolean constraints are then assigned almost exactly as in the unsigned case, with the following exceptions: (i) the constraints for every place value, not including the sign bit are based on x0 rather than x and (ii) the weight of the sign bit is 1, rather than 2n 1. Thus, we minimize xn 1 + n 2 X i=0 2i x0 i (5) 5 Experimental Results Table1 shows results for minimization of counterexamples for several pro- grams. The rst column shows which program is being model checked.... ..."

### Table 1: Competitive ratio of L-greedy

"... In PAGE 4: ... For many such systems including net- worked reprographic machines, a theoretical model which does not incorporate lookahead runs the risk of being inapplicable to the real problem. More speci cally, we derive fairly tight results on the L-greedy, a natural greedy algo- rithm with lookahead L ( Table1 ). The term ML-greedy represents the competitive ratio of L-greedy with respect to the makespan performance metric which we de ne formally in Section 1.... ..."

### Table 18: Communication costs #28greedy strategy#29 for P = 15, Q =6,r= 2, and s =3.

1998

"... In PAGE 20: ... The stepwise strategy is illustrated in Table 15: the number of steps is equal to 10, which is optimal, but the total cost is 20 #28see Table 16#29. The greedy strategy requires more steps, namely, 12 #28see Table 17#29, but its total cost is 18 only #28see Table18 #29.... ..."

Cited by 30

### Table 18: Communication costs #28greedy strategy#29 for P = 15, Q =6,r= 2, and s =3.

1998

"... In PAGE 20: ... The stepwise strategy is illustrated in Table 15: the number of steps is equal to 10, which is optimal, but the total cost is 20 #28see Table 16#29. The greedy strategy requires more steps, namely, 12 #28see Table 17#29, but its total cost is 18 only #28see Table18 #29.... ..."

Cited by 30

### Table 18: Communication costs #28greedy strategy#29 for P = 15, Q =6,r= 2, and s =3.

1998

"... In PAGE 20: ... The stepwise strategy is illustrated in Table 15: the number of steps is equal to 10, which is optimal, but the total cost is 20 #28see Table 16#29. The greedy strategy requires more steps, namely, 12 #28see Table 17#29, but its total cost is 18 only #28see Table18 #29.... ..."

Cited by 30

### Table 2.1: Simulation results for greedy and other strategies. The number of balls ranges

1996

Cited by 117

### Table 18: Communication costs (greedy strategy) for P = 15, Q = 6, r = 2, and s = 3.

1998

Cited by 30