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:(Complexity testing). Showing records 1 – 19 of 19 total matches.

Search Limiters

Last 2 Years | English Only

No search limiters apply to these results.

▼ Search Limiters


University of Illinois – Urbana-Champaign

1. Bloom, David J. Sensory discrimination testing methodology selection based on beverage complexity.

Degree: PhD, Food Science & Human Nutrition, 2015, University of Illinois – Urbana-Champaign

 Sensory discrimination testing is a vital tool used by sensory professionals within the food industry. While many testing methods are available for selection, various methods… (more)

Subjects/Keywords: Discrimination Testing; Statistical Power; Beverages; Complexity; Dimensionality

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Bloom, D. J. (2015). Sensory discrimination testing methodology selection based on beverage complexity. (Doctoral Dissertation). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/89180

Chicago Manual of Style (16th Edition):

Bloom, David J. “Sensory discrimination testing methodology selection based on beverage complexity.” 2015. Doctoral Dissertation, University of Illinois – Urbana-Champaign. Accessed January 22, 2021. http://hdl.handle.net/2142/89180.

MLA Handbook (7th Edition):

Bloom, David J. “Sensory discrimination testing methodology selection based on beverage complexity.” 2015. Web. 22 Jan 2021.

Vancouver:

Bloom DJ. Sensory discrimination testing methodology selection based on beverage complexity. [Internet] [Doctoral dissertation]. University of Illinois – Urbana-Champaign; 2015. [cited 2021 Jan 22]. Available from: http://hdl.handle.net/2142/89180.

Council of Science Editors:

Bloom DJ. Sensory discrimination testing methodology selection based on beverage complexity. [Doctoral Dissertation]. University of Illinois – Urbana-Champaign; 2015. Available from: http://hdl.handle.net/2142/89180


University College Cork

2. Geary, Niall. Exploration of the relationship between tacit knowledge and software system test complexity.

Degree: 2016, University College Cork

 This research has explored the relationship between system test complexity and tacit knowledge. It is proposed as part of this thesis, that the process of… (more)

Subjects/Keywords: Tacit knowledge; System complexity; System test complexity; Software testing; Software development process

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Geary, N. (2016). Exploration of the relationship between tacit knowledge and software system test complexity. (Thesis). University College Cork. Retrieved from http://hdl.handle.net/10468/3113

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):

Geary, Niall. “Exploration of the relationship between tacit knowledge and software system test complexity.” 2016. Thesis, University College Cork. Accessed January 22, 2021. http://hdl.handle.net/10468/3113.

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

MLA Handbook (7th Edition):

Geary, Niall. “Exploration of the relationship between tacit knowledge and software system test complexity.” 2016. Web. 22 Jan 2021.

Vancouver:

Geary N. Exploration of the relationship between tacit knowledge and software system test complexity. [Internet] [Thesis]. University College Cork; 2016. [cited 2021 Jan 22]. Available from: http://hdl.handle.net/10468/3113.

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

Council of Science Editors:

Geary N. Exploration of the relationship between tacit knowledge and software system test complexity. [Thesis]. University College Cork; 2016. Available from: http://hdl.handle.net/10468/3113

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


University of Hong Kong

3. Yip, Wang. Towards a proportional sampling strategy according to path complexity: a simulation study.

Degree: 2000, University of Hong Kong

Subjects/Keywords: Computer software - Testing.; Computational complexity.

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Yip, W. (2000). Towards a proportional sampling strategy according to path complexity: a simulation study. (Thesis). University of Hong Kong. Retrieved from http://hdl.handle.net/10722/34184

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):

Yip, Wang. “Towards a proportional sampling strategy according to path complexity: a simulation study.” 2000. Thesis, University of Hong Kong. Accessed January 22, 2021. http://hdl.handle.net/10722/34184.

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

MLA Handbook (7th Edition):

Yip, Wang. “Towards a proportional sampling strategy according to path complexity: a simulation study.” 2000. Web. 22 Jan 2021.

Vancouver:

Yip W. Towards a proportional sampling strategy according to path complexity: a simulation study. [Internet] [Thesis]. University of Hong Kong; 2000. [cited 2021 Jan 22]. Available from: http://hdl.handle.net/10722/34184.

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

Council of Science Editors:

Yip W. Towards a proportional sampling strategy according to path complexity: a simulation study. [Thesis]. University of Hong Kong; 2000. Available from: http://hdl.handle.net/10722/34184

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


Cornell University

4. Huang, Boshuang. SEQUENTIAL DECISION MAKING FOR ACTIVE LEARNING AND INFERENCE IN ONLINE SETTINGS.

Degree: PhD, Electrical and Computer Engineering, 2020, Cornell University

 This dissertation focuses on sequential decision making for active learning and inference in online settings. In particular, we consider the settings where the hypothesis space… (more)

Subjects/Keywords: Active hypothesis testing; Active learning; Label complexity; Online learning; Regret; Sequential design of experiments

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Huang, B. (2020). SEQUENTIAL DECISION MAKING FOR ACTIVE LEARNING AND INFERENCE IN ONLINE SETTINGS. (Doctoral Dissertation). Cornell University. Retrieved from http://hdl.handle.net/1813/70347

Chicago Manual of Style (16th Edition):

Huang, Boshuang. “SEQUENTIAL DECISION MAKING FOR ACTIVE LEARNING AND INFERENCE IN ONLINE SETTINGS.” 2020. Doctoral Dissertation, Cornell University. Accessed January 22, 2021. http://hdl.handle.net/1813/70347.

MLA Handbook (7th Edition):

Huang, Boshuang. “SEQUENTIAL DECISION MAKING FOR ACTIVE LEARNING AND INFERENCE IN ONLINE SETTINGS.” 2020. Web. 22 Jan 2021.

Vancouver:

Huang B. SEQUENTIAL DECISION MAKING FOR ACTIVE LEARNING AND INFERENCE IN ONLINE SETTINGS. [Internet] [Doctoral dissertation]. Cornell University; 2020. [cited 2021 Jan 22]. Available from: http://hdl.handle.net/1813/70347.

Council of Science Editors:

Huang B. SEQUENTIAL DECISION MAKING FOR ACTIVE LEARNING AND INFERENCE IN ONLINE SETTINGS. [Doctoral Dissertation]. Cornell University; 2020. Available from: http://hdl.handle.net/1813/70347


University of Waterloo

5. Harms, Nathaniel. Halfway to Halfspace Testing.

Degree: 2017, University of Waterloo

 In this thesis I study the problem of testing halfspaces under arbitrary probability distributions, using only random samples. A halfspace, or linear threshold function, is… (more)

Subjects/Keywords: property testing; sublinear algorithms; computer science; theoretical computer science; algorithms and complexity; halfspaces; linear threshold functions; machine learning

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Harms, N. (2017). Halfway to Halfspace Testing. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/12557

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):

Harms, Nathaniel. “Halfway to Halfspace Testing.” 2017. Thesis, University of Waterloo. Accessed January 22, 2021. http://hdl.handle.net/10012/12557.

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

MLA Handbook (7th Edition):

Harms, Nathaniel. “Halfway to Halfspace Testing.” 2017. Web. 22 Jan 2021.

Vancouver:

Harms N. Halfway to Halfspace Testing. [Internet] [Thesis]. University of Waterloo; 2017. [cited 2021 Jan 22]. Available from: http://hdl.handle.net/10012/12557.

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

Council of Science Editors:

Harms N. Halfway to Halfspace Testing. [Thesis]. University of Waterloo; 2017. Available from: http://hdl.handle.net/10012/12557

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


Macquarie University

6. Leaper, David A. Consistency in performance in the group oral discussion test: an interactional competence perspective.

Degree: 2015, Macquarie University

Theoretical thesis.

Bibliography: pages 374-392

Language teaching institutions may require a dependable test of conversational ability to assess student development and encourage communication in the… (more)

Subjects/Keywords: Conversation  – Ability testing; Oral examinations; TESOL; speaking assessment; interactional competence; group oral discussion; complexity; accuracy; fluency; interactive function; mixed methods research

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Leaper, D. A. (2015). Consistency in performance in the group oral discussion test: an interactional competence perspective. (Doctoral Dissertation). Macquarie University. Retrieved from http://hdl.handle.net/1959.14/1067634

Chicago Manual of Style (16th Edition):

Leaper, David A. “Consistency in performance in the group oral discussion test: an interactional competence perspective.” 2015. Doctoral Dissertation, Macquarie University. Accessed January 22, 2021. http://hdl.handle.net/1959.14/1067634.

MLA Handbook (7th Edition):

Leaper, David A. “Consistency in performance in the group oral discussion test: an interactional competence perspective.” 2015. Web. 22 Jan 2021.

Vancouver:

Leaper DA. Consistency in performance in the group oral discussion test: an interactional competence perspective. [Internet] [Doctoral dissertation]. Macquarie University; 2015. [cited 2021 Jan 22]. Available from: http://hdl.handle.net/1959.14/1067634.

Council of Science Editors:

Leaper DA. Consistency in performance in the group oral discussion test: an interactional competence perspective. [Doctoral Dissertation]. Macquarie University; 2015. Available from: http://hdl.handle.net/1959.14/1067634


Universidade do Minho

7. Andrade, Amadeu José Freitas Barroso. Análise de complexidade de programas em ferramentas de apoio à decisão .

Degree: 2015, Universidade do Minho

 Na área do desenvolvimento de software, o processo de análise de código é um processo extremamente delicado, pois é suscetível a erros e que varia… (more)

Subjects/Keywords: Complexidade ciclomática; Testes de software; Grafos de controlo de fluxo; Análise de software; Cyclomatic complexity; Software testing; Control flow graphs; Software analysis

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Andrade, A. J. F. B. (2015). Análise de complexidade de programas em ferramentas de apoio à decisão . (Masters Thesis). Universidade do Minho. Retrieved from http://hdl.handle.net/1822/39260

Chicago Manual of Style (16th Edition):

Andrade, Amadeu José Freitas Barroso. “Análise de complexidade de programas em ferramentas de apoio à decisão .” 2015. Masters Thesis, Universidade do Minho. Accessed January 22, 2021. http://hdl.handle.net/1822/39260.

MLA Handbook (7th Edition):

Andrade, Amadeu José Freitas Barroso. “Análise de complexidade de programas em ferramentas de apoio à decisão .” 2015. Web. 22 Jan 2021.

Vancouver:

Andrade AJFB. Análise de complexidade de programas em ferramentas de apoio à decisão . [Internet] [Masters thesis]. Universidade do Minho; 2015. [cited 2021 Jan 22]. Available from: http://hdl.handle.net/1822/39260.

Council of Science Editors:

Andrade AJFB. Análise de complexidade de programas em ferramentas de apoio à decisão . [Masters Thesis]. Universidade do Minho; 2015. Available from: http://hdl.handle.net/1822/39260

8. Lagarde, Guillaume. Contributions to arithmetic complexity and compression : Contributions à la complexité arithmétique et à la compression.

Degree: Docteur es, Informatique, 2018, Sorbonne Paris Cité

Cette thèse explore deux territoires distincts de l’informatique fondamentale : la complexité et la compression. Plus précisément, dans une première partie, nous étudions la puissance… (more)

Subjects/Keywords: Complexité algébrique; Bornes inférieures; Test d’identité polynomiale; Circuits arithmétiques; Lempel-Ziv; Compression; Algebraic complexity; Lower bounds; Polynomial identity testing; Arithmetic circuits; Lempel-Ziv; Compression

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Lagarde, G. (2018). Contributions to arithmetic complexity and compression : Contributions à la complexité arithmétique et à la compression. (Doctoral Dissertation). Sorbonne Paris Cité. Retrieved from http://www.theses.fr/2018USPCC192

Chicago Manual of Style (16th Edition):

Lagarde, Guillaume. “Contributions to arithmetic complexity and compression : Contributions à la complexité arithmétique et à la compression.” 2018. Doctoral Dissertation, Sorbonne Paris Cité. Accessed January 22, 2021. http://www.theses.fr/2018USPCC192.

MLA Handbook (7th Edition):

Lagarde, Guillaume. “Contributions to arithmetic complexity and compression : Contributions à la complexité arithmétique et à la compression.” 2018. Web. 22 Jan 2021.

Vancouver:

Lagarde G. Contributions to arithmetic complexity and compression : Contributions à la complexité arithmétique et à la compression. [Internet] [Doctoral dissertation]. Sorbonne Paris Cité; 2018. [cited 2021 Jan 22]. Available from: http://www.theses.fr/2018USPCC192.

Council of Science Editors:

Lagarde G. Contributions to arithmetic complexity and compression : Contributions à la complexité arithmétique et à la compression. [Doctoral Dissertation]. Sorbonne Paris Cité; 2018. Available from: http://www.theses.fr/2018USPCC192


Linnaeus University

9. Kljajic, Haris. Applying automated testing in an existing client-server game : A pursuit for fault localization in Quake 3.

Degree: Computer Science, 2015, Linnaeus University

  This paper addresses the question formulation “Is it possible to implement automated testing in an existing client-server game in order to pinpoint faults and… (more)

Subjects/Keywords: automated testing; client-server; network; fault localization; game; software complexity; Quake 3 Arena; automatiserad testning; klient-server; nätverk; fellokalisering; spel; mjukvarukomplexitet; Quake 3 Arena; Computer Sciences; Datavetenskap (datalogi)

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Kljajic, H. (2015). Applying automated testing in an existing client-server game : A pursuit for fault localization in Quake 3. (Thesis). Linnaeus University. Retrieved from http://urn.kb.se/resolve?urn=urn:nbn:se:lnu:diva-50740

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):

Kljajic, Haris. “Applying automated testing in an existing client-server game : A pursuit for fault localization in Quake 3.” 2015. Thesis, Linnaeus University. Accessed January 22, 2021. http://urn.kb.se/resolve?urn=urn:nbn:se:lnu:diva-50740.

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

MLA Handbook (7th Edition):

Kljajic, Haris. “Applying automated testing in an existing client-server game : A pursuit for fault localization in Quake 3.” 2015. Web. 22 Jan 2021.

Vancouver:

Kljajic H. Applying automated testing in an existing client-server game : A pursuit for fault localization in Quake 3. [Internet] [Thesis]. Linnaeus University; 2015. [cited 2021 Jan 22]. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:lnu:diva-50740.

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

Council of Science Editors:

Kljajic H. Applying automated testing in an existing client-server game : A pursuit for fault localization in Quake 3. [Thesis]. Linnaeus University; 2015. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:lnu:diva-50740

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

10. -2178-1988. Program analysis techniques for algorithmic complexity and relational properties.

Degree: PhD, Computer Science, 2019, University of Texas – Austin

 Analyzing standard safety properties of a given program has traditionally been the primary focus of the program analysis community. Unfortunately, there are still many interesting… (more)

Subjects/Keywords: Complexity testing; Optimal program synthesis; Fuzzing; Genetic programming; Performance bug; Vulnerability detection; Side channel; Static analysis; Relational verification; Reinforcement learning; Policy gradient

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

-2178-1988. (2019). Program analysis techniques for algorithmic complexity and relational properties. (Doctoral Dissertation). University of Texas – Austin. Retrieved from http://dx.doi.org/10.26153/tsw/2181

Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete

Chicago Manual of Style (16th Edition):

-2178-1988. “Program analysis techniques for algorithmic complexity and relational properties.” 2019. Doctoral Dissertation, University of Texas – Austin. Accessed January 22, 2021. http://dx.doi.org/10.26153/tsw/2181.

Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete

MLA Handbook (7th Edition):

-2178-1988. “Program analysis techniques for algorithmic complexity and relational properties.” 2019. Web. 22 Jan 2021.

Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete

Vancouver:

-2178-1988. Program analysis techniques for algorithmic complexity and relational properties. [Internet] [Doctoral dissertation]. University of Texas – Austin; 2019. [cited 2021 Jan 22]. Available from: http://dx.doi.org/10.26153/tsw/2181.

Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete

Council of Science Editors:

-2178-1988. Program analysis techniques for algorithmic complexity and relational properties. [Doctoral Dissertation]. University of Texas – Austin; 2019. Available from: http://dx.doi.org/10.26153/tsw/2181

Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete


University of Cincinnati

11. PUREKAR, DHANESH MADHUKAR. A STUDY OF MODAL TESTING MEASUREMENT ERRORS, SENSOR PLACEMENT AND MODAL COMPLEXITY ON THE PROCESS OF FINITE ELEMENT CORRELATION.

Degree: MS, Engineering : Mechanical Engineering, 2005, University of Cincinnati

 This thesis describes studies of finite element (FE) model validation methods for structural dynamics. There are usually discrepancies between predictions of the structural dynamic properties… (more)

Subjects/Keywords: Engineering, Mechanical; Modal testing; finite element correlation; modal complexity; mass loading of accelerometers

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

PUREKAR, D. M. (2005). A STUDY OF MODAL TESTING MEASUREMENT ERRORS, SENSOR PLACEMENT AND MODAL COMPLEXITY ON THE PROCESS OF FINITE ELEMENT CORRELATION. (Masters Thesis). University of Cincinnati. Retrieved from http://rave.ohiolink.edu/etdc/view?acc_num=ucin1132015246

Chicago Manual of Style (16th Edition):

PUREKAR, DHANESH MADHUKAR. “A STUDY OF MODAL TESTING MEASUREMENT ERRORS, SENSOR PLACEMENT AND MODAL COMPLEXITY ON THE PROCESS OF FINITE ELEMENT CORRELATION.” 2005. Masters Thesis, University of Cincinnati. Accessed January 22, 2021. http://rave.ohiolink.edu/etdc/view?acc_num=ucin1132015246.

MLA Handbook (7th Edition):

PUREKAR, DHANESH MADHUKAR. “A STUDY OF MODAL TESTING MEASUREMENT ERRORS, SENSOR PLACEMENT AND MODAL COMPLEXITY ON THE PROCESS OF FINITE ELEMENT CORRELATION.” 2005. Web. 22 Jan 2021.

Vancouver:

PUREKAR DM. A STUDY OF MODAL TESTING MEASUREMENT ERRORS, SENSOR PLACEMENT AND MODAL COMPLEXITY ON THE PROCESS OF FINITE ELEMENT CORRELATION. [Internet] [Masters thesis]. University of Cincinnati; 2005. [cited 2021 Jan 22]. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=ucin1132015246.

Council of Science Editors:

PUREKAR DM. A STUDY OF MODAL TESTING MEASUREMENT ERRORS, SENSOR PLACEMENT AND MODAL COMPLEXITY ON THE PROCESS OF FINITE ELEMENT CORRELATION. [Masters Thesis]. University of Cincinnati; 2005. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=ucin1132015246


Louisiana State University

12. Kandara, Osman. Level of essentialness of a node in flowcharts and its application to program testing.

Degree: PhD, Computer Sciences, 2003, Louisiana State University

 Program testing is important to develop bug free software. A common form of program testing involves selecting test cases which execute (cover) a given set… (more)

Subjects/Keywords: flowchart analysis; debugging; program slicing; regression testing; node coverage; path coverage; selecting test cases; cyclomatic complexity; software engineering; domination; domination tree; post-domination; post domination; post-domination tree; post domination tree; essential set; white box testing; software testing; black box testing; path testing; data flow testing; loop testing; code inspection; condition testing

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Kandara, O. (2003). Level of essentialness of a node in flowcharts and its application to program testing. (Doctoral Dissertation). Louisiana State University. Retrieved from etd-1107103-233833 ; https://digitalcommons.lsu.edu/gradschool_dissertations/1872

Chicago Manual of Style (16th Edition):

Kandara, Osman. “Level of essentialness of a node in flowcharts and its application to program testing.” 2003. Doctoral Dissertation, Louisiana State University. Accessed January 22, 2021. etd-1107103-233833 ; https://digitalcommons.lsu.edu/gradschool_dissertations/1872.

MLA Handbook (7th Edition):

Kandara, Osman. “Level of essentialness of a node in flowcharts and its application to program testing.” 2003. Web. 22 Jan 2021.

Vancouver:

Kandara O. Level of essentialness of a node in flowcharts and its application to program testing. [Internet] [Doctoral dissertation]. Louisiana State University; 2003. [cited 2021 Jan 22]. Available from: etd-1107103-233833 ; https://digitalcommons.lsu.edu/gradschool_dissertations/1872.

Council of Science Editors:

Kandara O. Level of essentialness of a node in flowcharts and its application to program testing. [Doctoral Dissertation]. Louisiana State University; 2003. Available from: etd-1107103-233833 ; https://digitalcommons.lsu.edu/gradschool_dissertations/1872

13. Mishra, Shashank. Analysis of test coverage metrics in a business critical setup.

Degree: Computer Science and Communication (CSC), 2017, KTH

Test coverage is an important parameter of analyzing how well the product is being tested in any domain within the IT industry. Unit testing(more)

Subjects/Keywords: Code coverage; line coverage; branch coverage; path coverage; mutation testing; unit testing; test process; complexity; Computer Sciences; Datavetenskap (datalogi)

…that directly influence the scope of testing are size and complexity of the software, amount… …4 Software testing… …4 When to stop testing… …13 Unit testing… …25 Unit testing best practices… 

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Mishra, S. (2017). Analysis of test coverage metrics in a business critical setup. (Thesis). KTH. Retrieved from http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-213698

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):

Mishra, Shashank. “Analysis of test coverage metrics in a business critical setup.” 2017. Thesis, KTH. Accessed January 22, 2021. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-213698.

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

MLA Handbook (7th Edition):

Mishra, Shashank. “Analysis of test coverage metrics in a business critical setup.” 2017. Web. 22 Jan 2021.

Vancouver:

Mishra S. Analysis of test coverage metrics in a business critical setup. [Internet] [Thesis]. KTH; 2017. [cited 2021 Jan 22]. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-213698.

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

Council of Science Editors:

Mishra S. Analysis of test coverage metrics in a business critical setup. [Thesis]. KTH; 2017. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-213698

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

14. Grenet, Bruno. Représentations des polynômes, algorithmes et bornes inférieures : Representations of polynomials, algorithms and lower bounds.

Degree: Docteur es, Informatique, 2012, Lyon, École normale supérieure

La complexité algorithmique est l'étude des ressources nécessaires — le temps, la mémoire, … — pour résoudre un problème de manière algorithmique. Dans ce cadre,… (more)

Subjects/Keywords: Complexité algébrique; Déterminant; Permanent; Théorie de Valiant; Bornes inférieures; Corps finis; Test d'identité polynomiale; Factorisation; Circuits arithmétiques; Systèmes polynomiaux; Algebraic complexity; Determinant; Permanent; Valiant's theory; Lower bounds; Finite fields; Polynomial identity testing; Factorization; Arithmetic circuits; Polynomial systems

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Grenet, B. (2012). Représentations des polynômes, algorithmes et bornes inférieures : Representations of polynomials, algorithms and lower bounds. (Doctoral Dissertation). Lyon, École normale supérieure. Retrieved from http://www.theses.fr/2012ENSL0769

Chicago Manual of Style (16th Edition):

Grenet, Bruno. “Représentations des polynômes, algorithmes et bornes inférieures : Representations of polynomials, algorithms and lower bounds.” 2012. Doctoral Dissertation, Lyon, École normale supérieure. Accessed January 22, 2021. http://www.theses.fr/2012ENSL0769.

MLA Handbook (7th Edition):

Grenet, Bruno. “Représentations des polynômes, algorithmes et bornes inférieures : Representations of polynomials, algorithms and lower bounds.” 2012. Web. 22 Jan 2021.

Vancouver:

Grenet B. Représentations des polynômes, algorithmes et bornes inférieures : Representations of polynomials, algorithms and lower bounds. [Internet] [Doctoral dissertation]. Lyon, École normale supérieure; 2012. [cited 2021 Jan 22]. Available from: http://www.theses.fr/2012ENSL0769.

Council of Science Editors:

Grenet B. Représentations des polynômes, algorithmes et bornes inférieures : Representations of polynomials, algorithms and lower bounds. [Doctoral Dissertation]. Lyon, École normale supérieure; 2012. Available from: http://www.theses.fr/2012ENSL0769

15. Bauwens, Bruno. Computability in statistical hypotheses testing, and characterizations of independence and directed influences in time series using Kolmogorov complexity.

Degree: 2010, Ghent University

Subjects/Keywords: Mathematics and Statistics; Computability theory; minimal sufficient statistics; influence in time series; statistical hypothesis testing; ideal sequence analysis; Kolmogorov complexity; causality

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Bauwens, B. (2010). Computability in statistical hypotheses testing, and characterizations of independence and directed influences in time series using Kolmogorov complexity. (Thesis). Ghent University. Retrieved from http://hdl.handle.net/1854/LU-1107852

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):

Bauwens, Bruno. “Computability in statistical hypotheses testing, and characterizations of independence and directed influences in time series using Kolmogorov complexity.” 2010. Thesis, Ghent University. Accessed January 22, 2021. http://hdl.handle.net/1854/LU-1107852.

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

MLA Handbook (7th Edition):

Bauwens, Bruno. “Computability in statistical hypotheses testing, and characterizations of independence and directed influences in time series using Kolmogorov complexity.” 2010. Web. 22 Jan 2021.

Vancouver:

Bauwens B. Computability in statistical hypotheses testing, and characterizations of independence and directed influences in time series using Kolmogorov complexity. [Internet] [Thesis]. Ghent University; 2010. [cited 2021 Jan 22]. Available from: http://hdl.handle.net/1854/LU-1107852.

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

Council of Science Editors:

Bauwens B. Computability in statistical hypotheses testing, and characterizations of independence and directed influences in time series using Kolmogorov complexity. [Thesis]. Ghent University; 2010. Available from: http://hdl.handle.net/1854/LU-1107852

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

16. Kamal, Ahmad Waqas. A Hierarchical Approach to Software Testing.

Degree: 2006, , Department of Systems and Software Engineering

  To produce high quality software both software developers and testers need continuous improvement in their work methodologies and processes. So, far much work has… (more)

Subjects/Keywords: Test Artifacts; specifications; acceptance; use case; test case; hierarchy; testing; black box; tree; maintenance; regression; priority; prioritization; PORT; complexity; volatility; dependency; Software Engineering; Programvaruteknik

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Kamal, A. W. (2006). A Hierarchical Approach to Software Testing. (Thesis). , Department of Systems and Software Engineering. Retrieved from http://urn.kb.se/resolve?urn=urn:nbn:se:bth-4889

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):

Kamal, Ahmad Waqas. “A Hierarchical Approach to Software Testing.” 2006. Thesis, , Department of Systems and Software Engineering. Accessed January 22, 2021. http://urn.kb.se/resolve?urn=urn:nbn:se:bth-4889.

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

MLA Handbook (7th Edition):

Kamal, Ahmad Waqas. “A Hierarchical Approach to Software Testing.” 2006. Web. 22 Jan 2021.

Vancouver:

Kamal AW. A Hierarchical Approach to Software Testing. [Internet] [Thesis]. , Department of Systems and Software Engineering; 2006. [cited 2021 Jan 22]. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:bth-4889.

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

Council of Science Editors:

Kamal AW. A Hierarchical Approach to Software Testing. [Thesis]. , Department of Systems and Software Engineering; 2006. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:bth-4889

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


Queensland University of Technology

17. Truong, Nghi Khue Dinh. A web-based programming environment for novice programmers.

Degree: 2007, Queensland University of Technology

 Learning to program is acknowledged to be difficult; programming is a complex intellectual activity and cannot be learnt without practice. Research has shown that first… (more)

Subjects/Keywords: computer programming; flexible delivery; web; tutoring system; on-line learning; feedback; fill in the gap; static analysis; cyclomatic complexity; automated testing; dynamic analysis; black box; white box; feedback; XML; assessment

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Truong, N. K. D. (2007). A web-based programming environment for novice programmers. (Thesis). Queensland University of Technology. Retrieved from https://eprints.qut.edu.au/16471/

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):

Truong, Nghi Khue Dinh. “A web-based programming environment for novice programmers.” 2007. Thesis, Queensland University of Technology. Accessed January 22, 2021. https://eprints.qut.edu.au/16471/.

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

MLA Handbook (7th Edition):

Truong, Nghi Khue Dinh. “A web-based programming environment for novice programmers.” 2007. Web. 22 Jan 2021.

Vancouver:

Truong NKD. A web-based programming environment for novice programmers. [Internet] [Thesis]. Queensland University of Technology; 2007. [cited 2021 Jan 22]. Available from: https://eprints.qut.edu.au/16471/.

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

Council of Science Editors:

Truong NKD. A web-based programming environment for novice programmers. [Thesis]. Queensland University of Technology; 2007. Available from: https://eprints.qut.edu.au/16471/

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

18. Toker, Yonca. Non-ability correlates of the science-math trait complex: searching for personality characteristics and revisiting vocational interests.

Degree: PhD, Psychology, 2010, Georgia Tech

 The trait complex approach (Ackerman&Heggestad, 1997) makes it possible to study the individual holistically by taking account of various individual differences at the same time,… (more)

Subjects/Keywords: Dominance analysis; Vocational counseling; Level of interests; Interest assessment; Vocational fit; STEM; Occupational complexity; Vocational interests; Mathematical ability; Personality; Trait intercorrelations; Ability Testing; Occupational aptitude tests

…73 5.3.2.7 STEM Interest Complexity Scales............................................ 73… …Preliminary Findings for the STEM Interest Complexity Scales ...................... 94 6.2.1… …96 6.2.3 STEM Interest Complexity Associations with Constructs and Criteria… …Predicting Major Choice from STEM Interest Complexity.... 104 viii 6.3 Exploration of the Trait… …133 8.2.2.2 STEM Interest Complexity Scales.......................................... 133… 

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):

Toker, Y. (2010). Non-ability correlates of the science-math trait complex: searching for personality characteristics and revisiting vocational interests. (Doctoral Dissertation). Georgia Tech. Retrieved from http://hdl.handle.net/1853/37175

Chicago Manual of Style (16th Edition):

Toker, Yonca. “Non-ability correlates of the science-math trait complex: searching for personality characteristics and revisiting vocational interests.” 2010. Doctoral Dissertation, Georgia Tech. Accessed January 22, 2021. http://hdl.handle.net/1853/37175.

MLA Handbook (7th Edition):

Toker, Yonca. “Non-ability correlates of the science-math trait complex: searching for personality characteristics and revisiting vocational interests.” 2010. Web. 22 Jan 2021.

Vancouver:

Toker Y. Non-ability correlates of the science-math trait complex: searching for personality characteristics and revisiting vocational interests. [Internet] [Doctoral dissertation]. Georgia Tech; 2010. [cited 2021 Jan 22]. Available from: http://hdl.handle.net/1853/37175.

Council of Science Editors:

Toker Y. Non-ability correlates of the science-math trait complex: searching for personality characteristics and revisiting vocational interests. [Doctoral Dissertation]. Georgia Tech; 2010. Available from: http://hdl.handle.net/1853/37175

19. Lamontagne, Philippe. Amplification de l'amplitude : analyse et applications.

Degree: 2013, Université de Montréal

Subjects/Keywords: Amplification de l'amplitude; Test de propriété; Test de linéarité; Test d'homomorphisme; Test de symétrie; Test de quasi-symétrie; Variance; Complexité en requêtes; Quantum amplitude amplification; Property testing; Linearity testing; Homomorphism testing; Symmetry testing; Quasi-symmetry testing; Query complexity; Applied Sciences - Computer Science / Sciences appliqués et technologie - Informatique (UMI : 0984)

…en requêtes ou query complexity. Cette mesure de complexité compte le nombre de requêtes… 

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Lamontagne, P. (2013). Amplification de l'amplitude : analyse et applications. (Thesis). Université de Montréal. Retrieved from http://hdl.handle.net/1866/9827

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):

Lamontagne, Philippe. “Amplification de l'amplitude : analyse et applications.” 2013. Thesis, Université de Montréal. Accessed January 22, 2021. http://hdl.handle.net/1866/9827.

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

MLA Handbook (7th Edition):

Lamontagne, Philippe. “Amplification de l'amplitude : analyse et applications.” 2013. Web. 22 Jan 2021.

Vancouver:

Lamontagne P. Amplification de l'amplitude : analyse et applications. [Internet] [Thesis]. Université de Montréal; 2013. [cited 2021 Jan 22]. Available from: http://hdl.handle.net/1866/9827.

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

Council of Science Editors:

Lamontagne P. Amplification de l'amplitude : analyse et applications. [Thesis]. Université de Montréal; 2013. Available from: http://hdl.handle.net/1866/9827

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

.