Skip to main content

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

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

15

5.99

37.52

73.16

2

1.72

13

4.18

22.6

55.68

3

2.00

13

3.69

19.04

47.28

4

3.25

13

5.92

28.24

70

5

1.91

19

5.67

16.48

88.12

6

2.25

13

5.49

30.72

77.36

7

2.16

7

3.86

14.52

49.32

8

2.69

14

4.65

31.16

63.2

9

3.59

13

6.42

35.64

90.04

10

3.13

13

5.29

41.04

118.72