ISSN:
1573-1375
Keywords:
A-efficiency
;
D-efficiency
;
factorial experiment
;
saturated design
Source:
Springer Online Journal Archives 1860-2000
Topics:
Computer Science
,
Mathematics
Notes:
Abstract The results of a computer search for saturated designs for 2n factorial experiments with n runs is reported, (where n = 2 mod 4). A complete search of the design space is avoided by focussing on designs constructed from cyclic generators. A method of searching quickly for the best generators is given. The resulting designs are as good as, and sometimes better than, designs obtained via search algorithms reported in the literature. The addition of a further factor having three levels is also considered. Here, too, a complete search is avoided by restricting attention to the most efficient part of the design space under p-efficiency.
Type of Medium:
Electronic Resource
URL:
http://dx.doi.org/10.1023/A:1008961712217
Permalink
