Skip to main content

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

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

4.56

19

8.09

40.08

71.84

2

1.94

9

4.94

21.28

54.72

3

2.03

5

4.53

19.88

46.92

4

3.81

11

7.67

31.2

69.28

5

2.53

19

6.09

20.4

83.08

6

2.75

14

7.12

30.16

77.92

7

2.66

7

4.78

21.52

50.36

8

2.84

11

5.79

36.36

63.56

9

4.47

13

8.91

35.92

87.08

10

3.75

12

6.36

43.16

115.36