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

NetworkOptimalCost-Opt.XCSXCSXCS
NumberCostRule CountAvg. CostRule CountTime
13.41155.9937.5273.16
21.72134.1822.655.68
32.00133.6919.0447.28
43.25135.9228.2470
51.91195.6716.4888.12
62.25135.4930.7277.36
72.1673.8614.5249.32
82.69144.6531.1663.2
93.59136.4235.6490.04
103.13135.2941.04118.72