Advanced search options

Sorted by: relevance · author · university · date | New search

Degree: MS ^{❌}

You searched for `subject:(Complexity theory)`

.
Showing records 1 – 11 of
11 total matches.

▼ Search Limiters

Clemson University

1.
Mathieson, James.
Connective *Complexity* Methods for Analysis and Prediction in Engineering Design.

Degree: MS, Mechanical Engineering, 2011, Clemson University

URL: https://tigerprints.clemson.edu/all_theses/1085

► *Complexity* is an aspect of engineering design that is often addressed directly with the principle that 'designs should be simple'. However, such a principle…
(more)

Subjects/Keywords: Complexity; Complexity Measurement; Graph Theory; Performance Prediction; Mechanical Engineering

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Mathieson, J. (2011). Connective Complexity Methods for Analysis and Prediction in Engineering Design. (Masters Thesis). Clemson University. Retrieved from https://tigerprints.clemson.edu/all_theses/1085

Chicago Manual of Style (16^{th} Edition):

Mathieson, James. “Connective Complexity Methods for Analysis and Prediction in Engineering Design.” 2011. Masters Thesis, Clemson University. Accessed October 20, 2019. https://tigerprints.clemson.edu/all_theses/1085.

MLA Handbook (7^{th} Edition):

Mathieson, James. “Connective Complexity Methods for Analysis and Prediction in Engineering Design.” 2011. Web. 20 Oct 2019.

Vancouver:

Mathieson J. Connective Complexity Methods for Analysis and Prediction in Engineering Design. [Internet] [Masters thesis]. Clemson University; 2011. [cited 2019 Oct 20]. Available from: https://tigerprints.clemson.edu/all_theses/1085.

Council of Science Editors:

Mathieson J. Connective Complexity Methods for Analysis and Prediction in Engineering Design. [Masters Thesis]. Clemson University; 2011. Available from: https://tigerprints.clemson.edu/all_theses/1085

University of Arkansas

2.
Apon, Daniel Christopher.
On the *Complexity* of Grid Coloring.

Degree: MS, 2011, University of Arkansas

URL: https://scholarworks.uark.edu/etd/108

► This thesis studies problems at the intersection of Ramsey-theoretic mathematics, computational *complexity*, and communication *complexity*. The prototypical example of such a problem is Monochromatic-Rectangle-Free…
(more)

Subjects/Keywords: Communication complexity; Computational complexity; High-performance computing; Ramsey theory; Computer Engineering

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Apon, D. C. (2011). On the Complexity of Grid Coloring. (Masters Thesis). University of Arkansas. Retrieved from https://scholarworks.uark.edu/etd/108

Chicago Manual of Style (16^{th} Edition):

Apon, Daniel Christopher. “On the Complexity of Grid Coloring.” 2011. Masters Thesis, University of Arkansas. Accessed October 20, 2019. https://scholarworks.uark.edu/etd/108.

MLA Handbook (7^{th} Edition):

Apon, Daniel Christopher. “On the Complexity of Grid Coloring.” 2011. Web. 20 Oct 2019.

Vancouver:

Apon DC. On the Complexity of Grid Coloring. [Internet] [Masters thesis]. University of Arkansas; 2011. [cited 2019 Oct 20]. Available from: https://scholarworks.uark.edu/etd/108.

Council of Science Editors:

Apon DC. On the Complexity of Grid Coloring. [Masters Thesis]. University of Arkansas; 2011. Available from: https://scholarworks.uark.edu/etd/108

Georgia Tech

3.
Shaw, Faaiqa Atiyya.
Applying item response *theory* to measure drivers' perceived *complexity* of roadway environments.

Degree: MS, Psychology, 2018, Georgia Tech

URL: http://hdl.handle.net/1853/60725

► Roadway environments constitute visually complex systems within which users make split-second critical decisions on a daily basis. As such, understanding transportation system user perceptions and…
(more)

Subjects/Keywords: Roadway environment; Complexity; Item response theory; Psychometrics; Perception

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Shaw, F. A. (2018). Applying item response theory to measure drivers' perceived complexity of roadway environments. (Masters Thesis). Georgia Tech. Retrieved from http://hdl.handle.net/1853/60725

Chicago Manual of Style (16^{th} Edition):

Shaw, Faaiqa Atiyya. “Applying item response theory to measure drivers' perceived complexity of roadway environments.” 2018. Masters Thesis, Georgia Tech. Accessed October 20, 2019. http://hdl.handle.net/1853/60725.

MLA Handbook (7^{th} Edition):

Shaw, Faaiqa Atiyya. “Applying item response theory to measure drivers' perceived complexity of roadway environments.” 2018. Web. 20 Oct 2019.

Vancouver:

Shaw FA. Applying item response theory to measure drivers' perceived complexity of roadway environments. [Internet] [Masters thesis]. Georgia Tech; 2018. [cited 2019 Oct 20]. Available from: http://hdl.handle.net/1853/60725.

Council of Science Editors:

Shaw FA. Applying item response theory to measure drivers' perceived complexity of roadway environments. [Masters Thesis]. Georgia Tech; 2018. Available from: http://hdl.handle.net/1853/60725

Virginia Tech

4. Maji, Nabanita. An Interactive Tutorial for NP-Completeness.

Degree: MS, Computer Science, 2015, Virginia Tech

URL: http://hdl.handle.net/10919/52973

► A *Theory* of Algorithms course is essential to any Computer Science curriculum at both the undergraduate and graduate levels. It is also considered to be…
(more)

Subjects/Keywords: NP Completeness; Complexity Theory; Reductions; Algorithm Visualization; Computer Science Education; Automated Assessment

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Maji, N. (2015). An Interactive Tutorial for NP-Completeness. (Masters Thesis). Virginia Tech. Retrieved from http://hdl.handle.net/10919/52973

Chicago Manual of Style (16^{th} Edition):

Maji, Nabanita. “An Interactive Tutorial for NP-Completeness.” 2015. Masters Thesis, Virginia Tech. Accessed October 20, 2019. http://hdl.handle.net/10919/52973.

MLA Handbook (7^{th} Edition):

Maji, Nabanita. “An Interactive Tutorial for NP-Completeness.” 2015. Web. 20 Oct 2019.

Vancouver:

Maji N. An Interactive Tutorial for NP-Completeness. [Internet] [Masters thesis]. Virginia Tech; 2015. [cited 2019 Oct 20]. Available from: http://hdl.handle.net/10919/52973.

Council of Science Editors:

Maji N. An Interactive Tutorial for NP-Completeness. [Masters Thesis]. Virginia Tech; 2015. Available from: http://hdl.handle.net/10919/52973

University of Illinois – Urbana-Champaign

5.
Gordon, Spencer L.
The *complexity* of continuous local search.

Degree: MS, Computer Science, 2017, University of Illinois – Urbana-Champaign

URL: http://hdl.handle.net/2142/97391

► The *complexity* class CLS was introduced by Daskalakis and Papadimitriou in [9] with the goal of capturing the *complexity* of some well-known problems in PPAD…
(more)

Subjects/Keywords: Theoretical computer science; Algorithmic game theory; Computational complexity; Linear complementarity problem; Contraction map

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Gordon, S. L. (2017). The complexity of continuous local search. (Thesis). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/97391

Note: this citation may be lacking information needed for this citation format:

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Gordon, Spencer L. “The complexity of continuous local search.” 2017. Thesis, University of Illinois – Urbana-Champaign. Accessed October 20, 2019. http://hdl.handle.net/2142/97391.

Note: this citation may be lacking information needed for this citation format:

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Gordon, Spencer L. “The complexity of continuous local search.” 2017. Web. 20 Oct 2019.

Vancouver:

Gordon SL. The complexity of continuous local search. [Internet] [Thesis]. University of Illinois – Urbana-Champaign; 2017. [cited 2019 Oct 20]. Available from: http://hdl.handle.net/2142/97391.

Note: this citation may be lacking information needed for this citation format:

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Gordon SL. The complexity of continuous local search. [Thesis]. University of Illinois – Urbana-Champaign; 2017. Available from: http://hdl.handle.net/2142/97391

Not specified: Masters Thesis or Doctoral Dissertation

Montana Tech

6. Khormali, Omid. High Dimensional Outlier Detection.

Degree: MS, 2019, Montana Tech

URL: https://scholarworks.umt.edu/etd/11377

► In statistics and data science, outliers are data points that differ greatly from other observations in a data set. They are important attributes of…
(more)

Subjects/Keywords: Outlier; Computational complexity; High dimesional dataset; Applied Statistics; Probability; Theory and Algorithms

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Khormali, O. (2019). High Dimensional Outlier Detection. (Masters Thesis). Montana Tech. Retrieved from https://scholarworks.umt.edu/etd/11377

Chicago Manual of Style (16^{th} Edition):

Khormali, Omid. “High Dimensional Outlier Detection.” 2019. Masters Thesis, Montana Tech. Accessed October 20, 2019. https://scholarworks.umt.edu/etd/11377.

MLA Handbook (7^{th} Edition):

Khormali, Omid. “High Dimensional Outlier Detection.” 2019. Web. 20 Oct 2019.

Vancouver:

Khormali O. High Dimensional Outlier Detection. [Internet] [Masters thesis]. Montana Tech; 2019. [cited 2019 Oct 20]. Available from: https://scholarworks.umt.edu/etd/11377.

Council of Science Editors:

Khormali O. High Dimensional Outlier Detection. [Masters Thesis]. Montana Tech; 2019. Available from: https://scholarworks.umt.edu/etd/11377

McGill University

7.
Ada, Anil.
Non-deterministic communication *complexity* of regular languages.

Degree: MS, School of Computer Science., 2007, McGill University

URL: http://digitool.library.mcgill.ca/thesisfile112367.pdf

►

The notion of communication *complexity* was introduced by Yao in his seminal paper [Yao79]. In [BFS86], Babai Frankl and Simon developed a rich structure of…
(more)

Subjects/Keywords: Formal languages.; Complexity (Linguistics); Sequential machine theory.

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Ada, A. (2007). Non-deterministic communication complexity of regular languages. (Masters Thesis). McGill University. Retrieved from http://digitool.library.mcgill.ca/thesisfile112367.pdf

Chicago Manual of Style (16^{th} Edition):

Ada, Anil. “Non-deterministic communication complexity of regular languages.” 2007. Masters Thesis, McGill University. Accessed October 20, 2019. http://digitool.library.mcgill.ca/thesisfile112367.pdf.

MLA Handbook (7^{th} Edition):

Ada, Anil. “Non-deterministic communication complexity of regular languages.” 2007. Web. 20 Oct 2019.

Vancouver:

Ada A. Non-deterministic communication complexity of regular languages. [Internet] [Masters thesis]. McGill University; 2007. [cited 2019 Oct 20]. Available from: http://digitool.library.mcgill.ca/thesisfile112367.pdf.

Council of Science Editors:

Ada A. Non-deterministic communication complexity of regular languages. [Masters Thesis]. McGill University; 2007. Available from: http://digitool.library.mcgill.ca/thesisfile112367.pdf

Texas A&M University

8. Joshi, Sanjay. Some algorithmic results in graph imbeddings.

Degree: MS, computer science, 2012, Texas A&M University

URL: http://hdl.handle.net/1969.1/ETD-TAMU-1990-THESIS-J83

Subjects/Keywords: computer science.; Major computer science.; Computational complexity.; Graph theory.; Algorithms.

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Joshi, S. (2012). Some algorithmic results in graph imbeddings. (Masters Thesis). Texas A&M University. Retrieved from http://hdl.handle.net/1969.1/ETD-TAMU-1990-THESIS-J83

Chicago Manual of Style (16^{th} Edition):

Joshi, Sanjay. “Some algorithmic results in graph imbeddings.” 2012. Masters Thesis, Texas A&M University. Accessed October 20, 2019. http://hdl.handle.net/1969.1/ETD-TAMU-1990-THESIS-J83.

MLA Handbook (7^{th} Edition):

Joshi, Sanjay. “Some algorithmic results in graph imbeddings.” 2012. Web. 20 Oct 2019.

Vancouver:

Joshi S. Some algorithmic results in graph imbeddings. [Internet] [Masters thesis]. Texas A&M University; 2012. [cited 2019 Oct 20]. Available from: http://hdl.handle.net/1969.1/ETD-TAMU-1990-THESIS-J83.

Council of Science Editors:

Joshi S. Some algorithmic results in graph imbeddings. [Masters Thesis]. Texas A&M University; 2012. Available from: http://hdl.handle.net/1969.1/ETD-TAMU-1990-THESIS-J83

Rochester Institute of Technology

9. Brelsford, Eric. Approximation and elections.

Degree: MS, Computer Science (GCCIS), 2007, Rochester Institute of Technology

URL: https://scholarworks.rit.edu/theses/330

► Any culture that requires that a decision be made within a group necessarily creates methods for aggregating each individual’s preferences. For instance, we see…
(more)

Subjects/Keywords: Algorithms; Approximation; Computational complexity theory; Computational social choice; Elections; Voting systems

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Brelsford, E. (2007). Approximation and elections. (Masters Thesis). Rochester Institute of Technology. Retrieved from https://scholarworks.rit.edu/theses/330

Chicago Manual of Style (16^{th} Edition):

Brelsford, Eric. “Approximation and elections.” 2007. Masters Thesis, Rochester Institute of Technology. Accessed October 20, 2019. https://scholarworks.rit.edu/theses/330.

MLA Handbook (7^{th} Edition):

Brelsford, Eric. “Approximation and elections.” 2007. Web. 20 Oct 2019.

Vancouver:

Brelsford E. Approximation and elections. [Internet] [Masters thesis]. Rochester Institute of Technology; 2007. [cited 2019 Oct 20]. Available from: https://scholarworks.rit.edu/theses/330.

Council of Science Editors:

Brelsford E. Approximation and elections. [Masters Thesis]. Rochester Institute of Technology; 2007. Available from: https://scholarworks.rit.edu/theses/330

Northeastern University

10.
Liu, Jucun.
A method for estimating contingency based on project * complexity*.

Degree: MS, Department of Civil and Environmental Engineering, 2015, Northeastern University

URL: http://hdl.handle.net/2047/D20194045

► Accurate cost estimates are important in every construction project for owners to prepare their budgets and construction plans. In transit projects, estimators for construction projects…
(more)

Subjects/Keywords: complexity; contingency; probability; Local transit; Finance; Local transit; Design and construction; Costs; Local transit; Design and construction; Estimates; Construction projects; Costs; Lognormal distribution; Distribution (Probability theory)

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Liu, J. (2015). A method for estimating contingency based on project complexity. (Masters Thesis). Northeastern University. Retrieved from http://hdl.handle.net/2047/D20194045

Chicago Manual of Style (16^{th} Edition):

Liu, Jucun. “A method for estimating contingency based on project complexity.” 2015. Masters Thesis, Northeastern University. Accessed October 20, 2019. http://hdl.handle.net/2047/D20194045.

MLA Handbook (7^{th} Edition):

Liu, Jucun. “A method for estimating contingency based on project complexity.” 2015. Web. 20 Oct 2019.

Vancouver:

Liu J. A method for estimating contingency based on project complexity. [Internet] [Masters thesis]. Northeastern University; 2015. [cited 2019 Oct 20]. Available from: http://hdl.handle.net/2047/D20194045.

Council of Science Editors:

Liu J. A method for estimating contingency based on project complexity. [Masters Thesis]. Northeastern University; 2015. Available from: http://hdl.handle.net/2047/D20194045

11. Walters, Craig M. Application of the human-machine interaction model to Multiple Attribute Task Battery (MATB): Task component interaction and the strategy paradigm.

Degree: MS, Biomedical Engineering, 2012, Wright State University

URL: http://rave.ohiolink.edu/etdc/view?acc_num=wright1347636464

► The Multiple-Attribute Task Battery (MATB) is composed of four simultaneously running components to which a human operator responds. A prior report has quantified information content…
(more)

Subjects/Keywords: Information Systems; HMI; MATB; human performance; human machine interaction; multiple attribute task battery; multi attribute task battery; strategy; strategy paradigm; human; information theory; quantitative informatic model; system complexity metric; task interaction

…simultaneously running tasks at two difficulty levels each. Information *theory* was
applied to each task… …application
of information content *theory*, information processing capability was measured by taking… …to implement a strategy appropriate for simultaneously
running tasks. Information *theory*… …Information *Theory*
Claude Shannon (Shannon, 1948) developed a set of methods for… …to investigate vigilance and task *complexity* by evaluating the ability of an
HO to detect a…

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Walters, C. M. (2012). Application of the human-machine interaction model to Multiple Attribute Task Battery (MATB): Task component interaction and the strategy paradigm. (Masters Thesis). Wright State University. Retrieved from http://rave.ohiolink.edu/etdc/view?acc_num=wright1347636464

Chicago Manual of Style (16^{th} Edition):

Walters, Craig M. “Application of the human-machine interaction model to Multiple Attribute Task Battery (MATB): Task component interaction and the strategy paradigm.” 2012. Masters Thesis, Wright State University. Accessed October 20, 2019. http://rave.ohiolink.edu/etdc/view?acc_num=wright1347636464.

MLA Handbook (7^{th} Edition):

Walters, Craig M. “Application of the human-machine interaction model to Multiple Attribute Task Battery (MATB): Task component interaction and the strategy paradigm.” 2012. Web. 20 Oct 2019.

Vancouver:

Walters CM. Application of the human-machine interaction model to Multiple Attribute Task Battery (MATB): Task component interaction and the strategy paradigm. [Internet] [Masters thesis]. Wright State University; 2012. [cited 2019 Oct 20]. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=wright1347636464.

Council of Science Editors:

Walters CM. Application of the human-machine interaction model to Multiple Attribute Task Battery (MATB): Task component interaction and the strategy paradigm. [Masters Thesis]. Wright State University; 2012. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=wright1347636464