Table 1.

Comparing the approximate processing times (in seconds) of various experimental design methods for networks of size $n$ with $M$ uncertain regulations, and $N=3$.

		$n=10$	$n=11$	$n=12$
Greedy-MOCU	$M=4$	250	2651	32 933
	$M=5$	493	5210	65 208
	$M=6$	967	10 264	127 397
DP-MOCU	$M=4$	272	2696	32 989
	$M=5$	490	5294	65 323
	$M=6$	1002	10 314	127 413
DP-Entropy	$M=4$	5	11	21
	$M=5$	15	29	63
	$M=6$	44	86	173
Greedy-Entropy	$M=4$	6	13	25
	$M=5$	18	36	69
	$M=6$	50	99	184

Abbreviations: DP, dynamic programming; MOCU, mean objective cost of uncertainty.