loading
Documents

Research.Publish.Connect.

Paper

Paper Unlock

Authors: Jing Jiang and Changhai Nie

Affiliation: The State Key Laboratory for Novel Software Technique and Nanjing University, China

ISBN: 978-989-8425-58-4

Keyword(s): .

Abstract: A number of greedy algorithms have been conducted for covering array construction, and most of them can be integrated into a framework, and more approaches can be derived from the framework. However, such a framework is affected by many factors, which makes its deployment and optimization very challenging. In order to identify the best configuration, we design Base Choice experiments based on six decisions of the framework to study systematically, providing theoretical and practical guideline for the design and optimization of the greedy algorithms.

PDF ImageFull Text

Download
CC BY-NC-ND 4.0

Sign In Guest: Register as new SciTePress user now for free.

Sign In SciTePress user: please login.

PDF ImageMy Papers

You are not signed in, therefore limits apply to your IP address 18.234.255.5

In the current month:
Recent papers: 100 available of 100 total
2+ years older papers: 200 available of 200 total

Paper citation in several formats:
Jiang, J. and Nie, C. (2011). Find the Best Greedy Algorithm with Base Choice Experiments for Covering Array Generation.In Proceeding of the 1st International Workshop on Evidential Assessment of Software Technologies - Volume 1: EAST, (ENASE 2011) ISBN 978-989-8425-58-4, pages 53-60

@conference{east11,
author={Jing Jiang. and Changhai Nie.},
title={Find the Best Greedy Algorithm with Base Choice Experiments for Covering Array Generation},
booktitle={Proceeding of the 1st International Workshop on Evidential Assessment of Software Technologies - Volume 1: EAST, (ENASE 2011)},
year={2011},
pages={53-60},
publisher={SciTePress},
organization={INSTICC},
doi={},
isbn={978-989-8425-58-4},
}

TY - CONF

JO - Proceeding of the 1st International Workshop on Evidential Assessment of Software Technologies - Volume 1: EAST, (ENASE 2011)
TI - Find the Best Greedy Algorithm with Base Choice Experiments for Covering Array Generation
SN - 978-989-8425-58-4
AU - Jiang, J.
AU - Nie, C.
PY - 2011
SP - 53
EP - 60
DO -

Login or register to post comments.

Comments on this Paper: Be the first to review this paper.