Advanced search options

Advanced Search Options 🞨

Browse by author name (“Author name starts with…”).

Find ETDs with:

in
/  
in
/  
in
/  
in

Written in Published in Earliest date Latest date

Sorted by

Results per page:

Sorted by: relevance · author · university · dateNew search

You searched for subject:(covering arrays). Showing records 1 – 8 of 8 total matches.

Search Limiters

Last 2 Years | English Only

No search limiters apply to these results.

▼ Search Limiters


Universitat Politècnica de València

1. Avila George, Himer. Constructing Covering Arrays using Parallel Computing and Grid Computing .

Degree: 2012, Universitat Politècnica de València

 A good strategy to test a software component involves the generation of the whole set of cases that participate in its operation. While testing only… (more)

Subjects/Keywords: Covering arrays; Parallel computing; Grid computing; Combinatorial optimization; Simulated annealing

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Avila George, H. (2012). Constructing Covering Arrays using Parallel Computing and Grid Computing . (Doctoral Dissertation). Universitat Politècnica de València. Retrieved from http://hdl.handle.net/10251/17027

Chicago Manual of Style (16th Edition):

Avila George, Himer. “Constructing Covering Arrays using Parallel Computing and Grid Computing .” 2012. Doctoral Dissertation, Universitat Politècnica de València. Accessed September 22, 2020. http://hdl.handle.net/10251/17027.

MLA Handbook (7th Edition):

Avila George, Himer. “Constructing Covering Arrays using Parallel Computing and Grid Computing .” 2012. Web. 22 Sep 2020.

Vancouver:

Avila George H. Constructing Covering Arrays using Parallel Computing and Grid Computing . [Internet] [Doctoral dissertation]. Universitat Politècnica de València; 2012. [cited 2020 Sep 22]. Available from: http://hdl.handle.net/10251/17027.

Council of Science Editors:

Avila George H. Constructing Covering Arrays using Parallel Computing and Grid Computing . [Doctoral Dissertation]. Universitat Politècnica de València; 2012. Available from: http://hdl.handle.net/10251/17027


Penn State University

2. Quinlan, Kevin Randall. Advances in Design of Computer Experiments.

Degree: 2019, Penn State University

 A t-covering array is a design such that any t factor projection contains all possible factor level combinations. This is useful in software development for… (more)

Subjects/Keywords: Covering Arrays; Bayesian Design; Plackett and Burman Designs; Experimental Run Order; Optimization

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Quinlan, K. R. (2019). Advances in Design of Computer Experiments. (Thesis). Penn State University. Retrieved from https://submit-etda.libraries.psu.edu/catalog/16029krq103

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Quinlan, Kevin Randall. “Advances in Design of Computer Experiments.” 2019. Thesis, Penn State University. Accessed September 22, 2020. https://submit-etda.libraries.psu.edu/catalog/16029krq103.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Quinlan, Kevin Randall. “Advances in Design of Computer Experiments.” 2019. Web. 22 Sep 2020.

Vancouver:

Quinlan KR. Advances in Design of Computer Experiments. [Internet] [Thesis]. Penn State University; 2019. [cited 2020 Sep 22]. Available from: https://submit-etda.libraries.psu.edu/catalog/16029krq103.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Quinlan KR. Advances in Design of Computer Experiments. [Thesis]. Penn State University; 2019. Available from: https://submit-etda.libraries.psu.edu/catalog/16029krq103

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


Arizona State University

3. Sarkar, Kaushik. Covering Arrays: Algorithms and Asymptotics.

Degree: Computer Science, 2016, Arizona State University

Subjects/Keywords: Computer science; Mathematics; combinatorial design; covering arrays; covering perfect hash families; orthogonal arrays; partial covering arrays; software interaction testing

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Sarkar, K. (2016). Covering Arrays: Algorithms and Asymptotics. (Doctoral Dissertation). Arizona State University. Retrieved from http://repository.asu.edu/items/40727

Chicago Manual of Style (16th Edition):

Sarkar, Kaushik. “Covering Arrays: Algorithms and Asymptotics.” 2016. Doctoral Dissertation, Arizona State University. Accessed September 22, 2020. http://repository.asu.edu/items/40727.

MLA Handbook (7th Edition):

Sarkar, Kaushik. “Covering Arrays: Algorithms and Asymptotics.” 2016. Web. 22 Sep 2020.

Vancouver:

Sarkar K. Covering Arrays: Algorithms and Asymptotics. [Internet] [Doctoral dissertation]. Arizona State University; 2016. [cited 2020 Sep 22]. Available from: http://repository.asu.edu/items/40727.

Council of Science Editors:

Sarkar K. Covering Arrays: Algorithms and Asymptotics. [Doctoral Dissertation]. Arizona State University; 2016. Available from: http://repository.asu.edu/items/40727


Arizona State University

4. Karia, Rushang Vinod. Covering Arrays: Generation and Post-optimization.

Degree: Computer Science, 2015, Arizona State University

Subjects/Keywords: Computer science; combinatorial optimization; covering arrays; post-optimization; quilting arrays

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Karia, R. V. (2015). Covering Arrays: Generation and Post-optimization. (Masters Thesis). Arizona State University. Retrieved from http://repository.asu.edu/items/36422

Chicago Manual of Style (16th Edition):

Karia, Rushang Vinod. “Covering Arrays: Generation and Post-optimization.” 2015. Masters Thesis, Arizona State University. Accessed September 22, 2020. http://repository.asu.edu/items/36422.

MLA Handbook (7th Edition):

Karia, Rushang Vinod. “Covering Arrays: Generation and Post-optimization.” 2015. Web. 22 Sep 2020.

Vancouver:

Karia RV. Covering Arrays: Generation and Post-optimization. [Internet] [Masters thesis]. Arizona State University; 2015. [cited 2020 Sep 22]. Available from: http://repository.asu.edu/items/36422.

Council of Science Editors:

Karia RV. Covering Arrays: Generation and Post-optimization. [Masters Thesis]. Arizona State University; 2015. Available from: http://repository.asu.edu/items/36422

5. Francetic, Nevena. Covering Arrays with Row Limit.

Degree: 2012, University of Toronto

Covering arrays with row limit, CARLs, are a new family of combinatorial objects which we introduce as a generalization of group divisible designs and covering(more)

Subjects/Keywords: group divisible designs; covering arrays; group divisible covering desings; graph covering problem; packing arrays; group divisible packing designs; 0405

Covering arrays with row limit, CARLs for short, are a new family of combinatorial objects which… …we introduce as a generalization of group divisible designs and covering arrays, two well… …covering arrays model test suites in software testing [11]. The motivation for the… …and under different conditions they behave as covering arrays. As well as being related to… …GDDs and covering arrays, CARLs can be interpreted as an edge covering problem in the graph… 

Page 1 Page 2 Page 3 Page 4 Page 5 Page 6 Page 7

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Francetic, N. (2012). Covering Arrays with Row Limit. (Doctoral Dissertation). University of Toronto. Retrieved from http://hdl.handle.net/1807/34006

Chicago Manual of Style (16th Edition):

Francetic, Nevena. “Covering Arrays with Row Limit.” 2012. Doctoral Dissertation, University of Toronto. Accessed September 22, 2020. http://hdl.handle.net/1807/34006.

MLA Handbook (7th Edition):

Francetic, Nevena. “Covering Arrays with Row Limit.” 2012. Web. 22 Sep 2020.

Vancouver:

Francetic N. Covering Arrays with Row Limit. [Internet] [Doctoral dissertation]. University of Toronto; 2012. [cited 2020 Sep 22]. Available from: http://hdl.handle.net/1807/34006.

Council of Science Editors:

Francetic N. Covering Arrays with Row Limit. [Doctoral Dissertation]. University of Toronto; 2012. Available from: http://hdl.handle.net/1807/34006


Arizona State University

6. Ang, Nicole. Generating Mixed-Level Covering Arrays of Lambda = 2 and Test Prioritization.

Degree: Computer Science, 2015, Arizona State University

Subjects/Keywords: Computer science; covering arrays; hamming distance; test prioritization; weighted density

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Ang, N. (2015). Generating Mixed-Level Covering Arrays of Lambda = 2 and Test Prioritization. (Masters Thesis). Arizona State University. Retrieved from http://repository.asu.edu/items/29857

Chicago Manual of Style (16th Edition):

Ang, Nicole. “Generating Mixed-Level Covering Arrays of Lambda = 2 and Test Prioritization.” 2015. Masters Thesis, Arizona State University. Accessed September 22, 2020. http://repository.asu.edu/items/29857.

MLA Handbook (7th Edition):

Ang, Nicole. “Generating Mixed-Level Covering Arrays of Lambda = 2 and Test Prioritization.” 2015. Web. 22 Sep 2020.

Vancouver:

Ang N. Generating Mixed-Level Covering Arrays of Lambda = 2 and Test Prioritization. [Internet] [Masters thesis]. Arizona State University; 2015. [cited 2020 Sep 22]. Available from: http://repository.asu.edu/items/29857.

Council of Science Editors:

Ang N. Generating Mixed-Level Covering Arrays of Lambda = 2 and Test Prioritization. [Masters Thesis]. Arizona State University; 2015. Available from: http://repository.asu.edu/items/29857

7. Milienos, Fotios. Ακριβείς και προσεγγιστικές μέθοδοι για τη μελέτη συστημάτων αξιοπιστίας και προβλημάτων ελέγχου ποιότητας.

Degree: 2009, University of Piraeus (UNIPI); Πανεπιστήμιο Πειραιώς

The present PhD thesis deals with problems related to reliability theory and statistical quality control. Specifically, we study the properties of random variables which are… (more)

Subjects/Keywords: Συστήματα αξιοπιστίας; Συναρτήσεις σάρωσης; Πίνακες πλήρους κάλυψης; Προσεγγίσεις μεσω κατανομών poisson; Μαρκοβιανές αλυσίδες; Στοχαστικές διατάξεις; Reliability systems; Scan statistics; Covering arrays; Poisson approximations; Markov chains; Stochastic ordering

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Milienos, F. (2009). Ακριβείς και προσεγγιστικές μέθοδοι για τη μελέτη συστημάτων αξιοπιστίας και προβλημάτων ελέγχου ποιότητας. (Thesis). University of Piraeus (UNIPI); Πανεπιστήμιο Πειραιώς. Retrieved from http://hdl.handle.net/10442/hedi/17263

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Milienos, Fotios. “Ακριβείς και προσεγγιστικές μέθοδοι για τη μελέτη συστημάτων αξιοπιστίας και προβλημάτων ελέγχου ποιότητας.” 2009. Thesis, University of Piraeus (UNIPI); Πανεπιστήμιο Πειραιώς. Accessed September 22, 2020. http://hdl.handle.net/10442/hedi/17263.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Milienos, Fotios. “Ακριβείς και προσεγγιστικές μέθοδοι για τη μελέτη συστημάτων αξιοπιστίας και προβλημάτων ελέγχου ποιότητας.” 2009. Web. 22 Sep 2020.

Vancouver:

Milienos F. Ακριβείς και προσεγγιστικές μέθοδοι για τη μελέτη συστημάτων αξιοπιστίας και προβλημάτων ελέγχου ποιότητας. [Internet] [Thesis]. University of Piraeus (UNIPI); Πανεπιστήμιο Πειραιώς; 2009. [cited 2020 Sep 22]. Available from: http://hdl.handle.net/10442/hedi/17263.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Milienos F. Ακριβείς και προσεγγιστικές μέθοδοι για τη μελέτη συστημάτων αξιοπιστίας και προβλημάτων ελέγχου ποιότητας. [Thesis]. University of Piraeus (UNIPI); Πανεπιστήμιο Πειραιώς; 2009. Available from: http://hdl.handle.net/10442/hedi/17263

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

8. Chodoriwsky, Jacob N. Error Locating Arrays, Adaptive Software Testing, and Combinatorial Group Testing .

Degree: 2012, University of Ottawa

 Combinatorial Group Testing (CGT) is a process of identifying faulty interactions (“errors”) within a particular set of items. Error Locating Arrays (ELAs) are combinatorial designs… (more)

Subjects/Keywords: combinatorial group testing; CGT; error locating arrays; ELA; covering arrays; CA; adaptive; algorithm; testing problem; software testing; CAFE; forbidden edges; forbidden hyperedges; hypergraph testing; group testing for complexes; safe values

…Such designs are arrays whose rows represent corresponding tests. 1.2 Covering Arrays A… …applied in the context of covering arrays [12] to obtain the following result. Theorem… …log k. log w For a more thorough treatment of covering arrays and their associated bounds… …survey on binary covering arrays in particular, see Lawrence et al. [28] 1.3 Mixed… …Covering Arrays In many real testing problems, some factors will have more or fewer values than… 

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Chodoriwsky, J. N. (2012). Error Locating Arrays, Adaptive Software Testing, and Combinatorial Group Testing . (Thesis). University of Ottawa. Retrieved from http://hdl.handle.net/10393/23083

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Chodoriwsky, Jacob N. “Error Locating Arrays, Adaptive Software Testing, and Combinatorial Group Testing .” 2012. Thesis, University of Ottawa. Accessed September 22, 2020. http://hdl.handle.net/10393/23083.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Chodoriwsky, Jacob N. “Error Locating Arrays, Adaptive Software Testing, and Combinatorial Group Testing .” 2012. Web. 22 Sep 2020.

Vancouver:

Chodoriwsky JN. Error Locating Arrays, Adaptive Software Testing, and Combinatorial Group Testing . [Internet] [Thesis]. University of Ottawa; 2012. [cited 2020 Sep 22]. Available from: http://hdl.handle.net/10393/23083.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Chodoriwsky JN. Error Locating Arrays, Adaptive Software Testing, and Combinatorial Group Testing . [Thesis]. University of Ottawa; 2012. Available from: http://hdl.handle.net/10393/23083

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

.