### Table 2. Division of common

2003

"... In PAGE 13: ...4 This shows that the two decisions are related by the exogenous variables used, not by unobservables. We consequently report in Table2 results for two separate probits. Table 2 gives the marginal effects of each exogenous variable on each decision.... In PAGE 17: ... 2) The frequency of assembly meetings held in the past 12 months, which acts as an indicator of the quality of cooperation, where a higher frequency of meetings points to greater possibilities of enforcing and adjusting the existing coordination mechanisms. Table2 shows that estimated coefficients for the two cooperation indicators are negative. This result supports the hypothesis that better cooperation under a common property regime reduces incentives to divide the commons (McCarthy et al.... ..."

### Table 2 Division by 17 (prime)

"... In PAGE 9: ...rovided d and A are relatively prime (i.e., have no common factors greater than 1). Table2 illustrates this property by showing remainders after dividing some 4-digit numbers by 17. There is still the problem of two or more runs giving the same addresses.... ..."

### Table 1. SRT division example

"... In PAGE 2: ... Since jpnj lt; 1, in the limit as n goes to infinity p0 = DQ : The quotient bits being generated are not in a standard binary representation, but it is a simple matter to convert the answer back to standard binary on-the-fly without using any expensive operations. Table1 shows an example of using the SRT division al- gorithm to divide 0:67 by 0:75. The steps that produce non- zero quotient bits have been shown.... ..."

### TABLE VII Meadow test, DATA STATISTICS

### TABLE VII Meadow test, DATA STATISTICS

### Table 6. Division: under ow exception

"... In PAGE 17: ... 2 Under ow test cases where the exact result is either smaller or larger than the smallest denormalized number are included in the test set. Examples are given in Table6 . If either the round or the sticky bit are di erent from zero in Case 15, the inexact and the under ow exception must be signaled by all IEEE-compliant implementations.... ..."

### Table 6: A numerical comparison between long division and least squares division

2003

"... In PAGE 23: ... fact, we have not encountered a truly ill-conditioned least squares division (27) in our extensive numerical experiments. On the other hand, the example shown in Table6 is quite common. In which f = conv(u; v) is rounded up at the eighth digit after decimal point.... ..."

Cited by 22

### Table 2: Indicators of the intensities of internal and external linkage of divisions (based on common publications).

### Table 7.5: Result of the division a=b; x and y denote nite non-zero numbers.

### Table 1: Primitive sets used in our experiments (% represents protected division, which returns its rst argument if the second argument is zero). Polynomial Lawn

2008

"... In PAGE 6: ... For this problem we considered two primitive sets: PlusTimesSwapR1R2, that is partic- ularly suitable for the solution of this problem, and AllOpsSwapR1R2 which is a superset of PlusTimesSwapR1R2 containing two spurious primitives. These primitive sets are de- tailed in the rst two columns of Table1 . The instructions refer to three registers: the input register RIN which is loaded with the value of x before a tness case is evaluated and the two registers R1 and R2 which can be used for numerical calculations.... In PAGE 7: ... The objective is to evolve a program which allows a robotic lawnmower to mow all the grass. In our version of the problem, at each time step the robot can only perform one of three actions (see Table1 ): move forward one step and mow the tile it lands on (Mow), turn left by 90 degrees (Left) or turn right by 90 degrees (Right). In the original problem tness (to be minimised) was measured by the number of tiles left non-mowed at the end of the execution of a program and, so, whether or not the lawnmower keeps visiting other tiles after nishing the job was not considered a relevant part of the problem.... ..."