Skip to main content

Table 2 The minimum, maximum and average costs of the optimal solutions and XCS solutions

From: Learning versus optimal intervention in random Boolean networks

   

Opt.

Opt.

Opt.

XCS

XCS

XCS

N

K

IC

Min.

Avg.

Max.

Min.

Avg.

Max.

5

2

2.0

1.72

2.61

3.59

3.69

5.11

6.42

5

2

2.5

1.63

2.59

3.59

3.73

5.88

7.35

5

2

3.0

1.94

3.13

4.56

4.53

6.43

8.91

5

3

2.0

1.75

2.68

3.34

4.63

6.27

7.69

5

3

2.5

1.78

2.63

3.34

5.10

7.08

9.35

5

3

3.0

2.38

3.45

4.47

6.15

7.55

9.45

7

2

2.0

2.46

3.30

4.44

5.21

6.48

9.24

7

2

2.5

2.41

3.21

4.44

5.72

7.25

10.06

7

2

3.0

2.88

3.99

5.94

6.30

7.93

10.50

7

3

2.0

2.61

3.19

3.71

4.94

7.24

13.41

7

3

2.5

2.55

3.08

3.52

6.03

7.98

13.75

7

3

3.0

3.12

3.87

4.77

6.05

8.87

14.45

  1. Each row summarises the results of 10 different network structures (with 25 XCS runs per structure)