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

Language: English

You searched for subject:(Complexity). Showing records 1 – 30 of 1622 total matches.

[1] [2] [3] [4] [5] … [55]

Search Limiters

Last 2 Years | English Only

Degrees

Levels

Country

▼ Search Limiters


University of Illinois – Urbana-Champaign

1. Choi, Kahyun. Computational lyricology: Quantitative approaches to understanding song lyrics and their interpretations.

Degree: PhD, Library & Information Science, 2018, University of Illinois – Urbana-Champaign

 Recently, music complexity has drawn attention from researchers in the Music Information Retrieval (MIR) area. In particular, computational methods to measure music complexity have been… (more)

Subjects/Keywords: lyric complexity; music complexity; text complexity

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Choi, K. (2018). Computational lyricology: Quantitative approaches to understanding song lyrics and their interpretations. (Doctoral Dissertation). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/102462

Chicago Manual of Style (16th Edition):

Choi, Kahyun. “Computational lyricology: Quantitative approaches to understanding song lyrics and their interpretations.” 2018. Doctoral Dissertation, University of Illinois – Urbana-Champaign. Accessed September 18, 2019. http://hdl.handle.net/2142/102462.

MLA Handbook (7th Edition):

Choi, Kahyun. “Computational lyricology: Quantitative approaches to understanding song lyrics and their interpretations.” 2018. Web. 18 Sep 2019.

Vancouver:

Choi K. Computational lyricology: Quantitative approaches to understanding song lyrics and their interpretations. [Internet] [Doctoral dissertation]. University of Illinois – Urbana-Champaign; 2018. [cited 2019 Sep 18]. Available from: http://hdl.handle.net/2142/102462.

Council of Science Editors:

Choi K. Computational lyricology: Quantitative approaches to understanding song lyrics and their interpretations. [Doctoral Dissertation]. University of Illinois – Urbana-Champaign; 2018. Available from: http://hdl.handle.net/2142/102462


Princeton University

2. Garg, Ankit. Information Theoretic Relaxations in Complexity Theory .

Degree: PhD, 2016, Princeton University

 Since Shannon’s “A Mathematical Theory of Communication”, information theory has found applicability in a wide range of scientific disciplines. Over the past two decades, information… (more)

Subjects/Keywords: Communication Complexity; Complexity Theory; Information Complexity

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Garg, A. (2016). Information Theoretic Relaxations in Complexity Theory . (Doctoral Dissertation). Princeton University. Retrieved from http://arks.princeton.edu/ark:/88435/dsp01ks65hf69p

Chicago Manual of Style (16th Edition):

Garg, Ankit. “Information Theoretic Relaxations in Complexity Theory .” 2016. Doctoral Dissertation, Princeton University. Accessed September 18, 2019. http://arks.princeton.edu/ark:/88435/dsp01ks65hf69p.

MLA Handbook (7th Edition):

Garg, Ankit. “Information Theoretic Relaxations in Complexity Theory .” 2016. Web. 18 Sep 2019.

Vancouver:

Garg A. Information Theoretic Relaxations in Complexity Theory . [Internet] [Doctoral dissertation]. Princeton University; 2016. [cited 2019 Sep 18]. Available from: http://arks.princeton.edu/ark:/88435/dsp01ks65hf69p.

Council of Science Editors:

Garg A. Information Theoretic Relaxations in Complexity Theory . [Doctoral Dissertation]. Princeton University; 2016. Available from: http://arks.princeton.edu/ark:/88435/dsp01ks65hf69p

3. Shimizu, Shougo. Complexity of the Type-Consistency Problem in Object-Oriented Databases : オブジェクト指向データベースにおける型検査問題の計算量; オブジェクト シコウ データベース ニ オケル カタケンサ モンダイ ノ ケイサンリョウ.

Degree: Nara Institute of Science and Technology / 奈良先端科学技術大学院大学

Subjects/Keywords: complexity

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Shimizu, S. (n.d.). Complexity of the Type-Consistency Problem in Object-Oriented Databases : オブジェクト指向データベースにおける型検査問題の計算量; オブジェクト シコウ データベース ニ オケル カタケンサ モンダイ ノ ケイサンリョウ. (Thesis). Nara Institute of Science and Technology / 奈良先端科学技術大学院大学. Retrieved from http://hdl.handle.net/10061/2979

Note: this citation may be lacking information needed for this citation format:
No year of publication.
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Shimizu, Shougo. “Complexity of the Type-Consistency Problem in Object-Oriented Databases : オブジェクト指向データベースにおける型検査問題の計算量; オブジェクト シコウ データベース ニ オケル カタケンサ モンダイ ノ ケイサンリョウ.” Thesis, Nara Institute of Science and Technology / 奈良先端科学技術大学院大学. Accessed September 18, 2019. http://hdl.handle.net/10061/2979.

Note: this citation may be lacking information needed for this citation format:
No year of publication.
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Shimizu, Shougo. “Complexity of the Type-Consistency Problem in Object-Oriented Databases : オブジェクト指向データベースにおける型検査問題の計算量; オブジェクト シコウ データベース ニ オケル カタケンサ モンダイ ノ ケイサンリョウ.” Web. 18 Sep 2019.

Note: this citation may be lacking information needed for this citation format:
No year of publication.

Vancouver:

Shimizu S. Complexity of the Type-Consistency Problem in Object-Oriented Databases : オブジェクト指向データベースにおける型検査問題の計算量; オブジェクト シコウ データベース ニ オケル カタケンサ モンダイ ノ ケイサンリョウ. [Internet] [Thesis]. Nara Institute of Science and Technology / 奈良先端科学技術大学院大学; [cited 2019 Sep 18]. Available from: http://hdl.handle.net/10061/2979.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
No year of publication.

Council of Science Editors:

Shimizu S. Complexity of the Type-Consistency Problem in Object-Oriented Databases : オブジェクト指向データベースにおける型検査問題の計算量; オブジェクト シコウ データベース ニ オケル カタケンサ モンダイ ノ ケイサンリョウ. [Thesis]. Nara Institute of Science and Technology / 奈良先端科学技術大学院大学; Available from: http://hdl.handle.net/10061/2979

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
No year of publication.


Delft University of Technology

4. Lu, D. Work in discuss  – architecture as negotiation between individual and collective living and working:.

Degree: 2016, Delft University of Technology

 Essential core areas in mid-Chicago are kept and developed into a new type or urban typology  – the cluster city. In the chosen cluster core,… (more)

Subjects/Keywords: negotiation; complexity

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Lu, D. (2016). Work in discuss  – architecture as negotiation between individual and collective living and working:. (Masters Thesis). Delft University of Technology. Retrieved from http://resolver.tudelft.nl/uuid:35e733df-af6b-4da0-abd8-67b9b255fa35

Chicago Manual of Style (16th Edition):

Lu, D. “Work in discuss  – architecture as negotiation between individual and collective living and working:.” 2016. Masters Thesis, Delft University of Technology. Accessed September 18, 2019. http://resolver.tudelft.nl/uuid:35e733df-af6b-4da0-abd8-67b9b255fa35.

MLA Handbook (7th Edition):

Lu, D. “Work in discuss  – architecture as negotiation between individual and collective living and working:.” 2016. Web. 18 Sep 2019.

Vancouver:

Lu D. Work in discuss  – architecture as negotiation between individual and collective living and working:. [Internet] [Masters thesis]. Delft University of Technology; 2016. [cited 2019 Sep 18]. Available from: http://resolver.tudelft.nl/uuid:35e733df-af6b-4da0-abd8-67b9b255fa35.

Council of Science Editors:

Lu D. Work in discuss  – architecture as negotiation between individual and collective living and working:. [Masters Thesis]. Delft University of Technology; 2016. Available from: http://resolver.tudelft.nl/uuid:35e733df-af6b-4da0-abd8-67b9b255fa35


University of Windsor

5. Espinoza Vega, Valeria Betzabe. Structural Complexity of Manufacturing Systems Layout.

Degree: MA, Industrial and Manufacturing Systems Engineering, 2012, University of Windsor

  The layout of a manufacturing facility/system not only shapes material flow pattern and influence transportation cost, but also affects the decision making process on… (more)

Subjects/Keywords: structural complexity

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Espinoza Vega, V. B. (2012). Structural Complexity of Manufacturing Systems Layout. (Masters Thesis). University of Windsor. Retrieved from https://scholar.uwindsor.ca/etd/5351

Chicago Manual of Style (16th Edition):

Espinoza Vega, Valeria Betzabe. “Structural Complexity of Manufacturing Systems Layout.” 2012. Masters Thesis, University of Windsor. Accessed September 18, 2019. https://scholar.uwindsor.ca/etd/5351.

MLA Handbook (7th Edition):

Espinoza Vega, Valeria Betzabe. “Structural Complexity of Manufacturing Systems Layout.” 2012. Web. 18 Sep 2019.

Vancouver:

Espinoza Vega VB. Structural Complexity of Manufacturing Systems Layout. [Internet] [Masters thesis]. University of Windsor; 2012. [cited 2019 Sep 18]. Available from: https://scholar.uwindsor.ca/etd/5351.

Council of Science Editors:

Espinoza Vega VB. Structural Complexity of Manufacturing Systems Layout. [Masters Thesis]. University of Windsor; 2012. Available from: https://scholar.uwindsor.ca/etd/5351


Rutgers University

6. Lutz, Neil J. Algorithmic information, fractal geometry, and distributed dynamics.

Degree: PhD, Computer Science, 2017, Rutgers University

This dissertation applies two distinct algorithmic perspectives to questions in the field of fractal geometry and dynamics. In Part I, we establish connections between algorithmic… (more)

Subjects/Keywords: Kolmogorov complexity

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Lutz, N. J. (2017). Algorithmic information, fractal geometry, and distributed dynamics. (Doctoral Dissertation). Rutgers University. Retrieved from https://rucore.libraries.rutgers.edu/rutgers-lib/55576/

Chicago Manual of Style (16th Edition):

Lutz, Neil J. “Algorithmic information, fractal geometry, and distributed dynamics.” 2017. Doctoral Dissertation, Rutgers University. Accessed September 18, 2019. https://rucore.libraries.rutgers.edu/rutgers-lib/55576/.

MLA Handbook (7th Edition):

Lutz, Neil J. “Algorithmic information, fractal geometry, and distributed dynamics.” 2017. Web. 18 Sep 2019.

Vancouver:

Lutz NJ. Algorithmic information, fractal geometry, and distributed dynamics. [Internet] [Doctoral dissertation]. Rutgers University; 2017. [cited 2019 Sep 18]. Available from: https://rucore.libraries.rutgers.edu/rutgers-lib/55576/.

Council of Science Editors:

Lutz NJ. Algorithmic information, fractal geometry, and distributed dynamics. [Doctoral Dissertation]. Rutgers University; 2017. Available from: https://rucore.libraries.rutgers.edu/rutgers-lib/55576/


Baylor University

7. Ewert, Winston. Algorithmic specified complexity.

Degree: Electrical and Computer Engineering., 2013, Baylor University

 Information theory is a well developed field, but does not capture the essence of what information is. Shannon Information captures something in its definition of… (more)

Subjects/Keywords: Information.; Algorithmic specified complexity.; Kolmogorov complexity.

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Ewert, W. (2013). Algorithmic specified complexity. (Thesis). Baylor University. Retrieved from http://hdl.handle.net/2104/8829

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

Ewert, Winston. “Algorithmic specified complexity. ” 2013. Thesis, Baylor University. Accessed September 18, 2019. http://hdl.handle.net/2104/8829.

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

MLA Handbook (7th Edition):

Ewert, Winston. “Algorithmic specified complexity. ” 2013. Web. 18 Sep 2019.

Vancouver:

Ewert W. Algorithmic specified complexity. [Internet] [Thesis]. Baylor University; 2013. [cited 2019 Sep 18]. Available from: http://hdl.handle.net/2104/8829.

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

Council of Science Editors:

Ewert W. Algorithmic specified complexity. [Thesis]. Baylor University; 2013. Available from: http://hdl.handle.net/2104/8829

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


University of Edinburgh

8. Smart, Emily. Occupational Complexity and Lifetime Cognitive Abilities.

Degree: 2013, University of Edinburgh

 Associations were examined between complexity of main lifetime occupation and cognitive performance in later life. Occupational complexity ratings for data, people and things were collected… (more)

Subjects/Keywords: Occupational complexity; cognition

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Smart, E. (2013). Occupational Complexity and Lifetime Cognitive Abilities. (Thesis). University of Edinburgh. Retrieved from http://hdl.handle.net/1842/8589

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

Smart, Emily. “Occupational Complexity and Lifetime Cognitive Abilities.” 2013. Thesis, University of Edinburgh. Accessed September 18, 2019. http://hdl.handle.net/1842/8589.

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

MLA Handbook (7th Edition):

Smart, Emily. “Occupational Complexity and Lifetime Cognitive Abilities.” 2013. Web. 18 Sep 2019.

Vancouver:

Smart E. Occupational Complexity and Lifetime Cognitive Abilities. [Internet] [Thesis]. University of Edinburgh; 2013. [cited 2019 Sep 18]. Available from: http://hdl.handle.net/1842/8589.

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

Council of Science Editors:

Smart E. Occupational Complexity and Lifetime Cognitive Abilities. [Thesis]. University of Edinburgh; 2013. Available from: http://hdl.handle.net/1842/8589

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


Victoria University of Wellington

9. Wicks, James. The Neuroscience of Gender Bias within Organisations: Implicit and Explicit Influences.

Degree: 2016, Victoria University of Wellington

 It has been 30 years since the metaphor of a ‘glass ceiling’ was introduced, yet progress to address gender bias in organisations has been slow.… (more)

Subjects/Keywords: Neuroscience; Complexity Gender

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Wicks, J. (2016). The Neuroscience of Gender Bias within Organisations: Implicit and Explicit Influences. (Masters Thesis). Victoria University of Wellington. Retrieved from http://hdl.handle.net/10063/6135

Chicago Manual of Style (16th Edition):

Wicks, James. “The Neuroscience of Gender Bias within Organisations: Implicit and Explicit Influences.” 2016. Masters Thesis, Victoria University of Wellington. Accessed September 18, 2019. http://hdl.handle.net/10063/6135.

MLA Handbook (7th Edition):

Wicks, James. “The Neuroscience of Gender Bias within Organisations: Implicit and Explicit Influences.” 2016. Web. 18 Sep 2019.

Vancouver:

Wicks J. The Neuroscience of Gender Bias within Organisations: Implicit and Explicit Influences. [Internet] [Masters thesis]. Victoria University of Wellington; 2016. [cited 2019 Sep 18]. Available from: http://hdl.handle.net/10063/6135.

Council of Science Editors:

Wicks J. The Neuroscience of Gender Bias within Organisations: Implicit and Explicit Influences. [Masters Thesis]. Victoria University of Wellington; 2016. Available from: http://hdl.handle.net/10063/6135


Delft University of Technology

10. Dulam, R.V. A multi-dimensional approach to deal with complex project management:.

Degree: 2011, Delft University of Technology

 Project failure occurs due to several reasons, but complexity and underestimation of complexity are often seen as the cause. Because of the interdisciplinary character of… (more)

Subjects/Keywords: complexity; project management

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Dulam, R. V. (2011). A multi-dimensional approach to deal with complex project management:. (Masters Thesis). Delft University of Technology. Retrieved from http://resolver.tudelft.nl/uuid:b4b3bcc4-0f50-46db-8c7e-449fde687177

Chicago Manual of Style (16th Edition):

Dulam, R V. “A multi-dimensional approach to deal with complex project management:.” 2011. Masters Thesis, Delft University of Technology. Accessed September 18, 2019. http://resolver.tudelft.nl/uuid:b4b3bcc4-0f50-46db-8c7e-449fde687177.

MLA Handbook (7th Edition):

Dulam, R V. “A multi-dimensional approach to deal with complex project management:.” 2011. Web. 18 Sep 2019.

Vancouver:

Dulam RV. A multi-dimensional approach to deal with complex project management:. [Internet] [Masters thesis]. Delft University of Technology; 2011. [cited 2019 Sep 18]. Available from: http://resolver.tudelft.nl/uuid:b4b3bcc4-0f50-46db-8c7e-449fde687177.

Council of Science Editors:

Dulam RV. A multi-dimensional approach to deal with complex project management:. [Masters Thesis]. Delft University of Technology; 2011. Available from: http://resolver.tudelft.nl/uuid:b4b3bcc4-0f50-46db-8c7e-449fde687177


University of Oregon

11. Mostafavi, Seyed Hooman. A Longitudinal Assessment of Website Complexity.

Degree: 2018, University of Oregon

 Nowadays, most people use several websites on a daily basis for various purposes like social networking, shopping, reading news, etc. which shows the significance of… (more)

Subjects/Keywords: Measurement; Web Complexity

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Mostafavi, S. H. (2018). A Longitudinal Assessment of Website Complexity. (Thesis). University of Oregon. Retrieved from http://hdl.handle.net/1794/23831

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

Mostafavi, Seyed Hooman. “A Longitudinal Assessment of Website Complexity.” 2018. Thesis, University of Oregon. Accessed September 18, 2019. http://hdl.handle.net/1794/23831.

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

MLA Handbook (7th Edition):

Mostafavi, Seyed Hooman. “A Longitudinal Assessment of Website Complexity.” 2018. Web. 18 Sep 2019.

Vancouver:

Mostafavi SH. A Longitudinal Assessment of Website Complexity. [Internet] [Thesis]. University of Oregon; 2018. [cited 2019 Sep 18]. Available from: http://hdl.handle.net/1794/23831.

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

Council of Science Editors:

Mostafavi SH. A Longitudinal Assessment of Website Complexity. [Thesis]. University of Oregon; 2018. Available from: http://hdl.handle.net/1794/23831

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


University of Waterloo

12. Shayeghi, Ala. Quantum Rejection Sampling.

Degree: 2015, University of Waterloo

 Let H be a finite dimensional Hilbert space and ρ, σ ∈ D(H) be quantum states in H such that S(ρ||σ) is finite. In this… (more)

Subjects/Keywords: Quantum Communication Complexity

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Shayeghi, A. (2015). Quantum Rejection Sampling. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/9114

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

Shayeghi, Ala. “Quantum Rejection Sampling.” 2015. Thesis, University of Waterloo. Accessed September 18, 2019. http://hdl.handle.net/10012/9114.

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

MLA Handbook (7th Edition):

Shayeghi, Ala. “Quantum Rejection Sampling.” 2015. Web. 18 Sep 2019.

Vancouver:

Shayeghi A. Quantum Rejection Sampling. [Internet] [Thesis]. University of Waterloo; 2015. [cited 2019 Sep 18]. Available from: http://hdl.handle.net/10012/9114.

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

Council of Science Editors:

Shayeghi A. Quantum Rejection Sampling. [Thesis]. University of Waterloo; 2015. Available from: http://hdl.handle.net/10012/9114

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


University of Waterloo

13. Tirdad, Kamran. Exploiting the Computational Power of Ternary Content Addressable Memory.

Degree: 2011, University of Waterloo

 Ternary Content Addressable Memory or in short TCAM is a special type of memory that can execute a certain set of operations in parallel on… (more)

Subjects/Keywords: TCAM; Computational Complexity

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Tirdad, K. (2011). Exploiting the Computational Power of Ternary Content Addressable Memory. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/6315

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

Tirdad, Kamran. “Exploiting the Computational Power of Ternary Content Addressable Memory.” 2011. Thesis, University of Waterloo. Accessed September 18, 2019. http://hdl.handle.net/10012/6315.

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

MLA Handbook (7th Edition):

Tirdad, Kamran. “Exploiting the Computational Power of Ternary Content Addressable Memory.” 2011. Web. 18 Sep 2019.

Vancouver:

Tirdad K. Exploiting the Computational Power of Ternary Content Addressable Memory. [Internet] [Thesis]. University of Waterloo; 2011. [cited 2019 Sep 18]. Available from: http://hdl.handle.net/10012/6315.

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

Council of Science Editors:

Tirdad K. Exploiting the Computational Power of Ternary Content Addressable Memory. [Thesis]. University of Waterloo; 2011. Available from: http://hdl.handle.net/10012/6315

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


Victoria University of Wellington

14. Snook, Michael. Matroids, Complexity and Computation.

Degree: 2013, Victoria University of Wellington

 The node deletion problem on graphs is: given a graph and integer k, can we delete no more than k vertices to obtain a graph… (more)

Subjects/Keywords: Graphs; Computation; Complexity

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Snook, M. (2013). Matroids, Complexity and Computation. (Doctoral Dissertation). Victoria University of Wellington. Retrieved from http://hdl.handle.net/10063/2885

Chicago Manual of Style (16th Edition):

Snook, Michael. “Matroids, Complexity and Computation.” 2013. Doctoral Dissertation, Victoria University of Wellington. Accessed September 18, 2019. http://hdl.handle.net/10063/2885.

MLA Handbook (7th Edition):

Snook, Michael. “Matroids, Complexity and Computation.” 2013. Web. 18 Sep 2019.

Vancouver:

Snook M. Matroids, Complexity and Computation. [Internet] [Doctoral dissertation]. Victoria University of Wellington; 2013. [cited 2019 Sep 18]. Available from: http://hdl.handle.net/10063/2885.

Council of Science Editors:

Snook M. Matroids, Complexity and Computation. [Doctoral Dissertation]. Victoria University of Wellington; 2013. Available from: http://hdl.handle.net/10063/2885


Ryerson University

15. Monfared, Sareh Shafiei. Complexity Analysis in Maintenance Systems.

Degree: 2010, Ryerson University

Complexity is a very broad subject that applies to project management, engineering design and manufacturing, arithmetic, software, statistics, etc. In maintenance systems, complexity can be… (more)

Subjects/Keywords: Technological complexity; Complexity (Philosophy); Computational complexity; System analysis; Reliability (Engineering)

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Monfared, S. S. (2010). Complexity Analysis in Maintenance Systems. (Thesis). Ryerson University. Retrieved from https://digital.library.ryerson.ca/islandora/object/RULA%3A1592

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

Monfared, Sareh Shafiei. “Complexity Analysis in Maintenance Systems.” 2010. Thesis, Ryerson University. Accessed September 18, 2019. https://digital.library.ryerson.ca/islandora/object/RULA%3A1592.

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

MLA Handbook (7th Edition):

Monfared, Sareh Shafiei. “Complexity Analysis in Maintenance Systems.” 2010. Web. 18 Sep 2019.

Vancouver:

Monfared SS. Complexity Analysis in Maintenance Systems. [Internet] [Thesis]. Ryerson University; 2010. [cited 2019 Sep 18]. Available from: https://digital.library.ryerson.ca/islandora/object/RULA%3A1592.

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

Council of Science Editors:

Monfared SS. Complexity Analysis in Maintenance Systems. [Thesis]. Ryerson University; 2010. Available from: https://digital.library.ryerson.ca/islandora/object/RULA%3A1592

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


University of Edinburgh

16. Tan, Jiun Yi. The Effects of Interruption Task Complexity and Interruptions on Student Multitasking.

Degree: 2013, University of Edinburgh

 Students commonly multitask while studying. The ubiquitous use of laptops and computers has facilitated this phenomenon and even changed the nature of multitasking in studying… (more)

Subjects/Keywords: Interruption complexity; Interruptions; Student multitasking

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Tan, J. Y. (2013). The Effects of Interruption Task Complexity and Interruptions on Student Multitasking. (Thesis). University of Edinburgh. Retrieved from http://hdl.handle.net/1842/8679

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

Tan, Jiun Yi. “The Effects of Interruption Task Complexity and Interruptions on Student Multitasking.” 2013. Thesis, University of Edinburgh. Accessed September 18, 2019. http://hdl.handle.net/1842/8679.

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

MLA Handbook (7th Edition):

Tan, Jiun Yi. “The Effects of Interruption Task Complexity and Interruptions on Student Multitasking.” 2013. Web. 18 Sep 2019.

Vancouver:

Tan JY. The Effects of Interruption Task Complexity and Interruptions on Student Multitasking. [Internet] [Thesis]. University of Edinburgh; 2013. [cited 2019 Sep 18]. Available from: http://hdl.handle.net/1842/8679.

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

Council of Science Editors:

Tan JY. The Effects of Interruption Task Complexity and Interruptions on Student Multitasking. [Thesis]. University of Edinburgh; 2013. Available from: http://hdl.handle.net/1842/8679

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


UCLA

17. Hughes, Michael Patrick. Protein structure in reversible amyloid formed by low-complexity regions.

Degree: Biological Chemistry, 2018, UCLA

 There is a current renaissance of research on membraneless organelles and their relationship to life in the cell. Protein-protein interactions between mysterious regions of proteins… (more)

Subjects/Keywords: Biochemistry; amyloid; low-complexity; structure

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Hughes, M. P. (2018). Protein structure in reversible amyloid formed by low-complexity regions. (Thesis). UCLA. Retrieved from http://www.escholarship.org/uc/item/5054w2t1

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

Hughes, Michael Patrick. “Protein structure in reversible amyloid formed by low-complexity regions.” 2018. Thesis, UCLA. Accessed September 18, 2019. http://www.escholarship.org/uc/item/5054w2t1.

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

MLA Handbook (7th Edition):

Hughes, Michael Patrick. “Protein structure in reversible amyloid formed by low-complexity regions.” 2018. Web. 18 Sep 2019.

Vancouver:

Hughes MP. Protein structure in reversible amyloid formed by low-complexity regions. [Internet] [Thesis]. UCLA; 2018. [cited 2019 Sep 18]. Available from: http://www.escholarship.org/uc/item/5054w2t1.

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

Council of Science Editors:

Hughes MP. Protein structure in reversible amyloid formed by low-complexity regions. [Thesis]. UCLA; 2018. Available from: http://www.escholarship.org/uc/item/5054w2t1

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

18. Geevarghese, Philip. The Kernelization complexity of some domination and covering problems; -.

Degree: Mathematics, 2011, INFLIBNET

In graph domination problem the input is a graph, and the question is whether there exists a subgraph which ?dominates? the rest of the graph.… (more)

Subjects/Keywords: Graph Domination; Kernelization complexity

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Geevarghese, P. (2011). The Kernelization complexity of some domination and covering problems; -. (Thesis). INFLIBNET. Retrieved from http://shodhganga.inflibnet.ac.in/handle/10603/4711

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

Geevarghese, Philip. “The Kernelization complexity of some domination and covering problems; -.” 2011. Thesis, INFLIBNET. Accessed September 18, 2019. http://shodhganga.inflibnet.ac.in/handle/10603/4711.

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

MLA Handbook (7th Edition):

Geevarghese, Philip. “The Kernelization complexity of some domination and covering problems; -.” 2011. Web. 18 Sep 2019.

Vancouver:

Geevarghese P. The Kernelization complexity of some domination and covering problems; -. [Internet] [Thesis]. INFLIBNET; 2011. [cited 2019 Sep 18]. Available from: http://shodhganga.inflibnet.ac.in/handle/10603/4711.

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

Council of Science Editors:

Geevarghese P. The Kernelization complexity of some domination and covering problems; -. [Thesis]. INFLIBNET; 2011. Available from: http://shodhganga.inflibnet.ac.in/handle/10603/4711

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


Universiteit Utrecht

19. Saenger Amoore, V.M. A matter of mind: reductionism and emergentism as frameworks for understanding consciousness.

Degree: 2014, Universiteit Utrecht

 According to materialists, mental processes are a product of the brain. In the context of neural properties such as complexity and consciousness, new frameworks for… (more)

Subjects/Keywords: reductionism; emergentism; brain complexity; consciousness.

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Saenger Amoore, V. M. (2014). A matter of mind: reductionism and emergentism as frameworks for understanding consciousness. (Masters Thesis). Universiteit Utrecht. Retrieved from http://dspace.library.uu.nl:8080/handle/1874/296440

Chicago Manual of Style (16th Edition):

Saenger Amoore, V M. “A matter of mind: reductionism and emergentism as frameworks for understanding consciousness.” 2014. Masters Thesis, Universiteit Utrecht. Accessed September 18, 2019. http://dspace.library.uu.nl:8080/handle/1874/296440.

MLA Handbook (7th Edition):

Saenger Amoore, V M. “A matter of mind: reductionism and emergentism as frameworks for understanding consciousness.” 2014. Web. 18 Sep 2019.

Vancouver:

Saenger Amoore VM. A matter of mind: reductionism and emergentism as frameworks for understanding consciousness. [Internet] [Masters thesis]. Universiteit Utrecht; 2014. [cited 2019 Sep 18]. Available from: http://dspace.library.uu.nl:8080/handle/1874/296440.

Council of Science Editors:

Saenger Amoore VM. A matter of mind: reductionism and emergentism as frameworks for understanding consciousness. [Masters Thesis]. Universiteit Utrecht; 2014. Available from: http://dspace.library.uu.nl:8080/handle/1874/296440


University of California – San Diego

20. Motl, Kyle. Metatrope.

Degree: Music, 2018, University of California – San Diego

 This document reflects on the development, performance, and reception of my music for solo contrabass. Issues of notation, composition, embodiment, and chaos are explored in… (more)

Subjects/Keywords: Music; complexity; composition; contrabass; improvisation

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Motl, K. (2018). Metatrope. (Thesis). University of California – San Diego. Retrieved from http://www.escholarship.org/uc/item/5hw4h77n

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

Motl, Kyle. “Metatrope.” 2018. Thesis, University of California – San Diego. Accessed September 18, 2019. http://www.escholarship.org/uc/item/5hw4h77n.

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

MLA Handbook (7th Edition):

Motl, Kyle. “Metatrope.” 2018. Web. 18 Sep 2019.

Vancouver:

Motl K. Metatrope. [Internet] [Thesis]. University of California – San Diego; 2018. [cited 2019 Sep 18]. Available from: http://www.escholarship.org/uc/item/5hw4h77n.

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

Council of Science Editors:

Motl K. Metatrope. [Thesis]. University of California – San Diego; 2018. Available from: http://www.escholarship.org/uc/item/5hw4h77n

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


Baylor University

21. [No author]. An investigation of observed Algorithmic Specified Complexity.

Degree: 2017, Baylor University

 Two experiments were carried out to investigate how Algorithmic Specified Complexity (ASC) might serve as a tool, specifically in the area of classification AI, and… (more)

Subjects/Keywords: Information theory. Algorithmic Specified Complexity.

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

author], [. (2017). An investigation of observed Algorithmic Specified Complexity. (Thesis). Baylor University. Retrieved from http://hdl.handle.net/2104/10179

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

author], [No. “An investigation of observed Algorithmic Specified Complexity. ” 2017. Thesis, Baylor University. Accessed September 18, 2019. http://hdl.handle.net/2104/10179.

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

MLA Handbook (7th Edition):

author], [No. “An investigation of observed Algorithmic Specified Complexity. ” 2017. Web. 18 Sep 2019.

Vancouver:

author] [. An investigation of observed Algorithmic Specified Complexity. [Internet] [Thesis]. Baylor University; 2017. [cited 2019 Sep 18]. Available from: http://hdl.handle.net/2104/10179.

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

Council of Science Editors:

author] [. An investigation of observed Algorithmic Specified Complexity. [Thesis]. Baylor University; 2017. Available from: http://hdl.handle.net/2104/10179

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


University of Florida

22. Troufflard, Joanna. Relationship between Upland and Riverine Settlements in the Lower Amazon Region during Late Precolonial Times.

Degree: PhD, Anthropology, 2017, University of Florida

 Archaeological research conducted in the Lower Amazon has demonstrated that this region was populated by one of the largest Amazonian polities during late precolonial times.… (more)

Subjects/Keywords: amazonia  – archaeology  – ceramics  – complexity  – social

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Troufflard, J. (2017). Relationship between Upland and Riverine Settlements in the Lower Amazon Region during Late Precolonial Times. (Doctoral Dissertation). University of Florida. Retrieved from http://ufdc.ufl.edu/UFE0051385

Chicago Manual of Style (16th Edition):

Troufflard, Joanna. “Relationship between Upland and Riverine Settlements in the Lower Amazon Region during Late Precolonial Times.” 2017. Doctoral Dissertation, University of Florida. Accessed September 18, 2019. http://ufdc.ufl.edu/UFE0051385.

MLA Handbook (7th Edition):

Troufflard, Joanna. “Relationship between Upland and Riverine Settlements in the Lower Amazon Region during Late Precolonial Times.” 2017. Web. 18 Sep 2019.

Vancouver:

Troufflard J. Relationship between Upland and Riverine Settlements in the Lower Amazon Region during Late Precolonial Times. [Internet] [Doctoral dissertation]. University of Florida; 2017. [cited 2019 Sep 18]. Available from: http://ufdc.ufl.edu/UFE0051385.

Council of Science Editors:

Troufflard J. Relationship between Upland and Riverine Settlements in the Lower Amazon Region during Late Precolonial Times. [Doctoral Dissertation]. University of Florida; 2017. Available from: http://ufdc.ufl.edu/UFE0051385


University of Victoria

23. Hailett, Micheiel Trevor. An integrated complexity analysis of problems from computational biology.

Degree: Department of Computer Science, 2018, University of Victoria

 We perform an Integrated complexity analysis on a number of combinatorial problems arising from the field of computational biology. The classic framework of NP-completeness, algorithmic… (more)

Subjects/Keywords: Computational complexity; Biology; Computer simulation

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Hailett, M. T. (2018). An integrated complexity analysis of problems from computational biology. (Thesis). University of Victoria. Retrieved from https://dspace.library.uvic.ca//handle/1828/9704

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

Hailett, Micheiel Trevor. “An integrated complexity analysis of problems from computational biology.” 2018. Thesis, University of Victoria. Accessed September 18, 2019. https://dspace.library.uvic.ca//handle/1828/9704.

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

MLA Handbook (7th Edition):

Hailett, Micheiel Trevor. “An integrated complexity analysis of problems from computational biology.” 2018. Web. 18 Sep 2019.

Vancouver:

Hailett MT. An integrated complexity analysis of problems from computational biology. [Internet] [Thesis]. University of Victoria; 2018. [cited 2019 Sep 18]. Available from: https://dspace.library.uvic.ca//handle/1828/9704.

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

Council of Science Editors:

Hailett MT. An integrated complexity analysis of problems from computational biology. [Thesis]. University of Victoria; 2018. Available from: https://dspace.library.uvic.ca//handle/1828/9704

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


University of Victoria

24. Wareham, Harold. Systematic parameterized complexity analysis in computational phonology.

Degree: Department of Computer Science, 2017, University of Victoria

 Many computational problems are NP-hard and hence probably do not have fast, i.e., polynomial time, algorithms. Such problems may yet have non-polynomial time algorithms, and… (more)

Subjects/Keywords: Computational complexity; Computational linguistics

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Wareham, H. (2017). Systematic parameterized complexity analysis in computational phonology. (Thesis). University of Victoria. Retrieved from https://dspace.library.uvic.ca//handle/1828/8806

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

Wareham, Harold. “Systematic parameterized complexity analysis in computational phonology.” 2017. Thesis, University of Victoria. Accessed September 18, 2019. https://dspace.library.uvic.ca//handle/1828/8806.

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

MLA Handbook (7th Edition):

Wareham, Harold. “Systematic parameterized complexity analysis in computational phonology.” 2017. Web. 18 Sep 2019.

Vancouver:

Wareham H. Systematic parameterized complexity analysis in computational phonology. [Internet] [Thesis]. University of Victoria; 2017. [cited 2019 Sep 18]. Available from: https://dspace.library.uvic.ca//handle/1828/8806.

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

Council of Science Editors:

Wareham H. Systematic parameterized complexity analysis in computational phonology. [Thesis]. University of Victoria; 2017. Available from: https://dspace.library.uvic.ca//handle/1828/8806

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


University of Victoria

25. Duffy, Christopher. A collection of algorithmic and complexity results for variants of the Firefighter Problem.

Degree: Dept. of Mathematics and Statistics, 2011, University of Victoria

 The Firefighter Process models the spread and defence of a fire using a simple graph. We consider the following discrete-time process: at t = 0… (more)

Subjects/Keywords: Graph Theory; Complexity; Firefighter

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Duffy, C. (2011). A collection of algorithmic and complexity results for variants of the Firefighter Problem. (Masters Thesis). University of Victoria. Retrieved from http://hdl.handle.net/1828/3550

Chicago Manual of Style (16th Edition):

Duffy, Christopher. “A collection of algorithmic and complexity results for variants of the Firefighter Problem.” 2011. Masters Thesis, University of Victoria. Accessed September 18, 2019. http://hdl.handle.net/1828/3550.

MLA Handbook (7th Edition):

Duffy, Christopher. “A collection of algorithmic and complexity results for variants of the Firefighter Problem.” 2011. Web. 18 Sep 2019.

Vancouver:

Duffy C. A collection of algorithmic and complexity results for variants of the Firefighter Problem. [Internet] [Masters thesis]. University of Victoria; 2011. [cited 2019 Sep 18]. Available from: http://hdl.handle.net/1828/3550.

Council of Science Editors:

Duffy C. A collection of algorithmic and complexity results for variants of the Firefighter Problem. [Masters Thesis]. University of Victoria; 2011. Available from: http://hdl.handle.net/1828/3550


Virginia Tech

26. Mullins, Dustin Ashley. Ambiguity in Public Organizations - Is it always Negative and Difficult to Manage or does Theory Assume Too Much?: A Case Study Review of Customs and Border Protection's Container Security Initiative.

Degree: PhD, Public Administration and Public Affairs, 2011, Virginia Tech

 This research study provides a conceptual framework to understand how public managers strategically engage ambiguity and translate the complexity associated with ambiguity to manageable objectives… (more)

Subjects/Keywords: Ambiguity; Uncertainty; Complexity; Management; Implementation

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Mullins, D. A. (2011). Ambiguity in Public Organizations - Is it always Negative and Difficult to Manage or does Theory Assume Too Much?: A Case Study Review of Customs and Border Protection's Container Security Initiative. (Doctoral Dissertation). Virginia Tech. Retrieved from http://hdl.handle.net/10919/77210

Chicago Manual of Style (16th Edition):

Mullins, Dustin Ashley. “Ambiguity in Public Organizations - Is it always Negative and Difficult to Manage or does Theory Assume Too Much?: A Case Study Review of Customs and Border Protection's Container Security Initiative.” 2011. Doctoral Dissertation, Virginia Tech. Accessed September 18, 2019. http://hdl.handle.net/10919/77210.

MLA Handbook (7th Edition):

Mullins, Dustin Ashley. “Ambiguity in Public Organizations - Is it always Negative and Difficult to Manage or does Theory Assume Too Much?: A Case Study Review of Customs and Border Protection's Container Security Initiative.” 2011. Web. 18 Sep 2019.

Vancouver:

Mullins DA. Ambiguity in Public Organizations - Is it always Negative and Difficult to Manage or does Theory Assume Too Much?: A Case Study Review of Customs and Border Protection's Container Security Initiative. [Internet] [Doctoral dissertation]. Virginia Tech; 2011. [cited 2019 Sep 18]. Available from: http://hdl.handle.net/10919/77210.

Council of Science Editors:

Mullins DA. Ambiguity in Public Organizations - Is it always Negative and Difficult to Manage or does Theory Assume Too Much?: A Case Study Review of Customs and Border Protection's Container Security Initiative. [Doctoral Dissertation]. Virginia Tech; 2011. Available from: http://hdl.handle.net/10919/77210


Cornell University

27. Licero, Jordan. People and products: Is there a synergistic relationship? .

Degree: 2014, Cornell University

 The present study was conducted to investigate 1) how the presence and attractiveness of a human model along with a product influences the attractiveness ratings… (more)

Subjects/Keywords: eye-tracking; complexity; models

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Licero, J. (2014). People and products: Is there a synergistic relationship? . (Thesis). Cornell University. Retrieved from http://hdl.handle.net/1813/35000

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

Licero, Jordan. “People and products: Is there a synergistic relationship? .” 2014. Thesis, Cornell University. Accessed September 18, 2019. http://hdl.handle.net/1813/35000.

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

MLA Handbook (7th Edition):

Licero, Jordan. “People and products: Is there a synergistic relationship? .” 2014. Web. 18 Sep 2019.

Vancouver:

Licero J. People and products: Is there a synergistic relationship? . [Internet] [Thesis]. Cornell University; 2014. [cited 2019 Sep 18]. Available from: http://hdl.handle.net/1813/35000.

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

Council of Science Editors:

Licero J. People and products: Is there a synergistic relationship? . [Thesis]. Cornell University; 2014. Available from: http://hdl.handle.net/1813/35000

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


University of Otago

28. Weston-Taylor, Lucy. Are all languages equal? .

Degree: 2013, University of Otago

 There is a general orthodoxy in linguistics that all languages are equal. Only in the past 10-15 years have linguists started critiquing this claim. In… (more)

Subjects/Keywords: equality of languages; equi-complexity

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Weston-Taylor, L. (2013). Are all languages equal? . (Masters Thesis). University of Otago. Retrieved from http://hdl.handle.net/10523/4320

Chicago Manual of Style (16th Edition):

Weston-Taylor, Lucy. “Are all languages equal? .” 2013. Masters Thesis, University of Otago. Accessed September 18, 2019. http://hdl.handle.net/10523/4320.

MLA Handbook (7th Edition):

Weston-Taylor, Lucy. “Are all languages equal? .” 2013. Web. 18 Sep 2019.

Vancouver:

Weston-Taylor L. Are all languages equal? . [Internet] [Masters thesis]. University of Otago; 2013. [cited 2019 Sep 18]. Available from: http://hdl.handle.net/10523/4320.

Council of Science Editors:

Weston-Taylor L. Are all languages equal? . [Masters Thesis]. University of Otago; 2013. Available from: http://hdl.handle.net/10523/4320

29. Wennberg, Andreas. Coopetition and Complexity : Exploring a Coopetitive Relationship with Complexity.

Degree: Umeå School of Business and Economics (USBE), 2011, Umeå University

  Cooperation have in previous research been seen as a negative impact on competition and  vice versa. This thesis is building on a concept called… (more)

Subjects/Keywords: Cooperation Competition Coopetition Complexity

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Wennberg, A. (2011). Coopetition and Complexity : Exploring a Coopetitive Relationship with Complexity. (Thesis). Umeå University. Retrieved from http://urn.kb.se/resolve?urn=urn:nbn:se:umu:diva-52689

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

Wennberg, Andreas. “Coopetition and Complexity : Exploring a Coopetitive Relationship with Complexity.” 2011. Thesis, Umeå University. Accessed September 18, 2019. http://urn.kb.se/resolve?urn=urn:nbn:se:umu:diva-52689.

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

MLA Handbook (7th Edition):

Wennberg, Andreas. “Coopetition and Complexity : Exploring a Coopetitive Relationship with Complexity.” 2011. Web. 18 Sep 2019.

Vancouver:

Wennberg A. Coopetition and Complexity : Exploring a Coopetitive Relationship with Complexity. [Internet] [Thesis]. Umeå University; 2011. [cited 2019 Sep 18]. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:umu:diva-52689.

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

Council of Science Editors:

Wennberg A. Coopetition and Complexity : Exploring a Coopetitive Relationship with Complexity. [Thesis]. Umeå University; 2011. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:umu:diva-52689

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

30. MADALA, SRAVYA. Efficient Ways to Upgrade Docker Containers in Cloud to Support Backward Compatibility : Various Upgrade Strategies to Measure Complexity.

Degree: 2016, , Department of Communication Systems

  If the present world scenario in telecommunication systems is considered thousands of systems are getting moved into the cloud because of its wide features.… (more)

Subjects/Keywords: Distributed systems; Complexity measures; Frameworks

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

MADALA, S. (2016). Efficient Ways to Upgrade Docker Containers in Cloud to Support Backward Compatibility : Various Upgrade Strategies to Measure Complexity. (Thesis). , Department of Communication Systems. Retrieved from http://urn.kb.se/resolve?urn=urn:nbn:se:bth-13589

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

MADALA, SRAVYA. “Efficient Ways to Upgrade Docker Containers in Cloud to Support Backward Compatibility : Various Upgrade Strategies to Measure Complexity.” 2016. Thesis, , Department of Communication Systems. Accessed September 18, 2019. http://urn.kb.se/resolve?urn=urn:nbn:se:bth-13589.

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

MLA Handbook (7th Edition):

MADALA, SRAVYA. “Efficient Ways to Upgrade Docker Containers in Cloud to Support Backward Compatibility : Various Upgrade Strategies to Measure Complexity.” 2016. Web. 18 Sep 2019.

Vancouver:

MADALA S. Efficient Ways to Upgrade Docker Containers in Cloud to Support Backward Compatibility : Various Upgrade Strategies to Measure Complexity. [Internet] [Thesis]. , Department of Communication Systems; 2016. [cited 2019 Sep 18]. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:bth-13589.

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

Council of Science Editors:

MADALA S. Efficient Ways to Upgrade Docker Containers in Cloud to Support Backward Compatibility : Various Upgrade Strategies to Measure Complexity. [Thesis]. , Department of Communication Systems; 2016. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:bth-13589

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

[1] [2] [3] [4] [5] … [55]

.