Skip to main content

Table 4 Results for 10 networks with N=5,K=2 and cost 2.5

From: Learning versus optimal intervention in random Boolean networks

Network

Optimal

Cost Opt.

XCS

XCS

XCS

Number

Cost

Rule Count

Avg. Cost

Rule Count

Time

1

3.41

18

7.35

43.32

72.6

2

1.63

12

4.35

21.8

53.44

3

2.00

5

3.73

17.36

47.16

4

3.25

11

6.82

22.04

70

5

1.91

19

6.20

15.88

85.72

6

2.19

12

6.43

27.72

97.04

7

2.16

7

4.72

18.64

48.64

8

2.69

13

5.52

32.32

63.48

9

3.59

9

7.30

40.32

87.96

10

3.13

10

6.40

35.56

112.6