### Table 2. Genetic algorithm parameters

"... In PAGE 6: ... Figure 5. Discrete workspace of the considered 16-link manipulator The genetic algorithm is implemented using the parameters shown in Table2 in the software Matlab using the genetic algorithm toolbox. The desired end-effector positions are chosen within the region of the manipulator workspace shown in Fig.... ..."

### Table 1 Comparison of core/periphery fitness measures using Beck et al. (2003; ND) data

2004

"... In PAGE 5: ....P Boyd, W.J. Fitzgerald, R.J. Beck/Social Networks columns 4 and 5 of Table1 . Column 6 of Table 1 compares the results from the UCINET (Version 6.... In PAGE 5: ... For all 12 groups, all three of these algorithms matched the exhaustive search by consistently finding the global optimum from several starting configurations. [ Table1 about here] From the results in Table 1, the genetic algorithm in UCINET finds the global optimum in two out of our 12 cases. The UCINET fit statistic is among the five best for seven of the 12 cases, and among the ten best for nine of the 12 cases.... In PAGE 5: ... For all 12 groups, all three of these algorithms matched the exhaustive search by consistently finding the global optimum from several starting configurations. [Table 1 about here] From the results in Table1 , the genetic algorithm in UCINET finds the global optimum in two out of our 12 cases. The UCINET fit statistic is among the five best for seven of the 12 cases, and among the ten best for nine of the 12 cases.... In PAGE 7: ... A low probability along with an intuitively high observed fitness value suggests that the observed data may have a core/periphery structure. To illustrate this permutation test, we used Mathematica to program a random permutation generator based upon the observed within group distribution of messages for each of the 12 groups from Table1 . As with the observed data, diagonal cells were also ignored for these permutations.... In PAGE 7: ... For Group 1, for example, no random permutation in each of the 3 runs produced an optimal fitness value equal to or greater than the observed fitness value of 0.867 (see Table1 ). For Group 3, 43 of the random permutations in the first run produced optimal fitness values equal to or greater than the observed fitness value (0.... ..."

Cited by 1

### Table 1: Parameters of the genetic algorithm.

"... In PAGE 4: ... It is with this goal in mind that we chose a simple Braitenberg vehicle, aiming to investigate how the environment will adapt to cope with it; the control program does not change at all. The adaptive algorithm employed is a simple genetic algorithm [7], the parameters of which are given in Table1 (we used the popular freeware software by Grefenstette [8]). (Readers... ..."

### Table 1: Parameters of the genetic algorithm.

"... In PAGE 4: ... Experiments Three experiments, each with a di erent index of com- plexity, as above mentioned, were performed. Given a k and r, the genetic parameters that might be chosen are listed in Table1 . Crossover works on a point of the genome, randomly chosen.... ..."

### Table 1. Genetic algorithms parameters.

"... In PAGE 9: ... Basically, the implementation of GA-Stacking combines two parts: a part coming from Weka that includes all the base learning algorithms and another part, which was integrated into Weka, that implements a GA. The parameters used for the GA in the experiments are shown in Table1 . The elite rate is the proportion of the population carried forward unchanged from each generation.... ..."

### Table 1: Results of the Genetic Algorithm

1994

Cited by 16

### Table 1: Results of the Genetic Algorithm

1994

Cited by 16

### Table 3: Genetic Algorithms Parameters

1993

Cited by 14

### Table 1. Primitives of the genetic algorithm

2001

"... In PAGE 4: ... Since a FIR lter does not have any feedback loop, the signal flow is always from left to right. The primitives selected for FIR lters are listed in Table1 . Each elementary operation is encoded by its own code (one character) and by two integer num- bers, which represent the relative o set (calculated backwards from the current position) of the two operands at the input.... ..."

Cited by 4

### Table 2 : Genetic algorithm results

2000

Cited by 2