Skip Navigation

The Computer Journal 1997 40(4):194-199; doi:10.1093/comjnl/40.4.194
© 1997 by British Computer Society
This Article
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in ISI Web of Science
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrow Search for citing articles in:
ISI Web of Science (1)
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Chan, F. T.
Right arrow Articles by Shen, S. M.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

On Some Properties of the Optimally Refined Proportional Sampling Strategy

F. T. Chan1, T. Y. Chen2, I. K. Mak2 and S. M. Shen3

1 School of Professional and Continuing Education, The University of Hong Kong, Hong Kong, 2 Department of Computer Science, University of Melbourne, Parkville 3052, Australia Email: tyc{at}cs.mu.oz.au, 3 Department of Statistics, The University of Hong Kong, Pokfulam Road, Hong Kong

The optimally refined proportional sampling strategy has been recommended as a better alternative to random testing, when dividing the input domain into equal-sized partitions is easy. This paper investigates some properties of the optimally refined proportional sampling strategy. This investigation provides some useful information on how well the optimally refined proportional sampling strategy outperforms random testing.

Received April 23, 1997. revised July 7, 1997.


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.