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:(Theory AND Algorithms). Showing records 1 – 30 of 898 total matches.

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

Search Limiters

Last 2 Years | English Only

Degrees

Levels

Languages

Country

▼ Search Limiters


University of Colorado

1. Beach, Aaron. Anonymity in Socio-Digital Systems.

Degree: PhD, Computer Science, 2011, University of Colorado

  Social data is particularly interesting to anonymity research due to its personal nature and recent increase in occurrence and usage. Despite the personal nature… (more)

Subjects/Keywords: Theory and Algorithms

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Beach, A. (2011). Anonymity in Socio-Digital Systems. (Doctoral Dissertation). University of Colorado. Retrieved from https://scholar.colorado.edu/csci_gradetds/23

Chicago Manual of Style (16th Edition):

Beach, Aaron. “Anonymity in Socio-Digital Systems.” 2011. Doctoral Dissertation, University of Colorado. Accessed August 06, 2020. https://scholar.colorado.edu/csci_gradetds/23.

MLA Handbook (7th Edition):

Beach, Aaron. “Anonymity in Socio-Digital Systems.” 2011. Web. 06 Aug 2020.

Vancouver:

Beach A. Anonymity in Socio-Digital Systems. [Internet] [Doctoral dissertation]. University of Colorado; 2011. [cited 2020 Aug 06]. Available from: https://scholar.colorado.edu/csci_gradetds/23.

Council of Science Editors:

Beach A. Anonymity in Socio-Digital Systems. [Doctoral Dissertation]. University of Colorado; 2011. Available from: https://scholar.colorado.edu/csci_gradetds/23


Ryerson University

2. Patel, Sonal. Clique Listing Algorithms and Characteristics of Cliques in Random Graphics.

Degree: 2010, Ryerson University

 In this thesis we address three main problems in clique detection in the area of Graph Theory. i) Most of current methods for clique detection… (more)

Subjects/Keywords: Random graphs; Graph theory; Algorithms; Graph algorithms

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Patel, S. (2010). Clique Listing Algorithms and Characteristics of Cliques in Random Graphics. (Thesis). Ryerson University. Retrieved from https://digital.library.ryerson.ca/islandora/object/RULA%3A1845

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

Patel, Sonal. “Clique Listing Algorithms and Characteristics of Cliques in Random Graphics.” 2010. Thesis, Ryerson University. Accessed August 06, 2020. https://digital.library.ryerson.ca/islandora/object/RULA%3A1845.

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

MLA Handbook (7th Edition):

Patel, Sonal. “Clique Listing Algorithms and Characteristics of Cliques in Random Graphics.” 2010. Web. 06 Aug 2020.

Vancouver:

Patel S. Clique Listing Algorithms and Characteristics of Cliques in Random Graphics. [Internet] [Thesis]. Ryerson University; 2010. [cited 2020 Aug 06]. Available from: https://digital.library.ryerson.ca/islandora/object/RULA%3A1845.

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

Council of Science Editors:

Patel S. Clique Listing Algorithms and Characteristics of Cliques in Random Graphics. [Thesis]. Ryerson University; 2010. Available from: https://digital.library.ryerson.ca/islandora/object/RULA%3A1845

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


University of Colorado

3. Nelson, Thomas Harrison. Genetic Algorithms with Chaotic Population Dynamics.

Degree: MS, Computer Science, 2010, University of Colorado

  In this thesis I demonstrate a novel application of chaotic dynamics to evolutionary algorithms, specifically in population size management. Typical evolutionary algorithms require a… (more)

Subjects/Keywords: algorithms; population size management; Theory and Algorithms

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Nelson, T. H. (2010). Genetic Algorithms with Chaotic Population Dynamics. (Masters Thesis). University of Colorado. Retrieved from https://scholar.colorado.edu/csci_gradetds/18

Chicago Manual of Style (16th Edition):

Nelson, Thomas Harrison. “Genetic Algorithms with Chaotic Population Dynamics.” 2010. Masters Thesis, University of Colorado. Accessed August 06, 2020. https://scholar.colorado.edu/csci_gradetds/18.

MLA Handbook (7th Edition):

Nelson, Thomas Harrison. “Genetic Algorithms with Chaotic Population Dynamics.” 2010. Web. 06 Aug 2020.

Vancouver:

Nelson TH. Genetic Algorithms with Chaotic Population Dynamics. [Internet] [Masters thesis]. University of Colorado; 2010. [cited 2020 Aug 06]. Available from: https://scholar.colorado.edu/csci_gradetds/18.

Council of Science Editors:

Nelson TH. Genetic Algorithms with Chaotic Population Dynamics. [Masters Thesis]. University of Colorado; 2010. Available from: https://scholar.colorado.edu/csci_gradetds/18

4. Allbee, Matthew. An approximation algorithm with additive error for extensive-form, pure Stackelberg games with a chance player.

Degree: 2018, University of Wisconsin – Whitewater

This file was last viewed in Microsoft Edge.

Substantial work has gone into finding techniques for solving real-world sized Nash games. Stackelberg Equilibria is another… (more)

Subjects/Keywords: Game theory; Approximation algorithms

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Allbee, M. (2018). An approximation algorithm with additive error for extensive-form, pure Stackelberg games with a chance player. (Thesis). University of Wisconsin – Whitewater. Retrieved from http://digital.library.wisc.edu/1793/78968

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

Allbee, Matthew. “An approximation algorithm with additive error for extensive-form, pure Stackelberg games with a chance player.” 2018. Thesis, University of Wisconsin – Whitewater. Accessed August 06, 2020. http://digital.library.wisc.edu/1793/78968.

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

MLA Handbook (7th Edition):

Allbee, Matthew. “An approximation algorithm with additive error for extensive-form, pure Stackelberg games with a chance player.” 2018. Web. 06 Aug 2020.

Vancouver:

Allbee M. An approximation algorithm with additive error for extensive-form, pure Stackelberg games with a chance player. [Internet] [Thesis]. University of Wisconsin – Whitewater; 2018. [cited 2020 Aug 06]. Available from: http://digital.library.wisc.edu/1793/78968.

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

Council of Science Editors:

Allbee M. An approximation algorithm with additive error for extensive-form, pure Stackelberg games with a chance player. [Thesis]. University of Wisconsin – Whitewater; 2018. Available from: http://digital.library.wisc.edu/1793/78968

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

5. Ireland, Forrest L. GPU accelerated risk quantification.

Degree: MS, Computer Science, 2018, Eastern Washington University

  Factor Analysis of Information Risk (FAIR) is a standard model for quantitatively estimating cybersecurity risks and has been implemented as a sequential Monte Carlo… (more)

Subjects/Keywords: Information Security; Theory and Algorithms

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Ireland, F. L. (2018). GPU accelerated risk quantification. (Thesis). Eastern Washington University. Retrieved from https://dc.ewu.edu/theses/497

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

Ireland, Forrest L. “GPU accelerated risk quantification.” 2018. Thesis, Eastern Washington University. Accessed August 06, 2020. https://dc.ewu.edu/theses/497.

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

MLA Handbook (7th Edition):

Ireland, Forrest L. “GPU accelerated risk quantification.” 2018. Web. 06 Aug 2020.

Vancouver:

Ireland FL. GPU accelerated risk quantification. [Internet] [Thesis]. Eastern Washington University; 2018. [cited 2020 Aug 06]. Available from: https://dc.ewu.edu/theses/497.

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

Council of Science Editors:

Ireland FL. GPU accelerated risk quantification. [Thesis]. Eastern Washington University; 2018. Available from: https://dc.ewu.edu/theses/497

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


University of Nevada – Las Vegas

6. Kubushyn, Vitaliy. Concurrent Localized Wait-Free Operations on a Red Black Tree.

Degree: MSin Computer Science, Computer Science, 2014, University of Nevada – Las Vegas

  A red-black tree is a type of self-balancing binary search tree. Some wait-free algorithms have been proposed for concurrently accessing and modifying a red-black… (more)

Subjects/Keywords: Computer Sciences; Theory and Algorithms

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Kubushyn, V. (2014). Concurrent Localized Wait-Free Operations on a Red Black Tree. (Masters Thesis). University of Nevada – Las Vegas. Retrieved from https://digitalscholarship.unlv.edu/thesesdissertations/2278

Chicago Manual of Style (16th Edition):

Kubushyn, Vitaliy. “Concurrent Localized Wait-Free Operations on a Red Black Tree.” 2014. Masters Thesis, University of Nevada – Las Vegas. Accessed August 06, 2020. https://digitalscholarship.unlv.edu/thesesdissertations/2278.

MLA Handbook (7th Edition):

Kubushyn, Vitaliy. “Concurrent Localized Wait-Free Operations on a Red Black Tree.” 2014. Web. 06 Aug 2020.

Vancouver:

Kubushyn V. Concurrent Localized Wait-Free Operations on a Red Black Tree. [Internet] [Masters thesis]. University of Nevada – Las Vegas; 2014. [cited 2020 Aug 06]. Available from: https://digitalscholarship.unlv.edu/thesesdissertations/2278.

Council of Science Editors:

Kubushyn V. Concurrent Localized Wait-Free Operations on a Red Black Tree. [Masters Thesis]. University of Nevada – Las Vegas; 2014. Available from: https://digitalscholarship.unlv.edu/thesesdissertations/2278


University of Nevada – Las Vegas

7. Andro-Vasko, James. Shop problems in scheduling.

Degree: MSin Computer Science, Computer Science, 2011, University of Nevada – Las Vegas

  The shop problems in scheduling will be discussed in this thesis. The ones I'll be discussing will be the flow shop, open shop, and… (more)

Subjects/Keywords: Computer Sciences; Theory and Algorithms

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Andro-Vasko, J. (2011). Shop problems in scheduling. (Masters Thesis). University of Nevada – Las Vegas. Retrieved from https://digitalscholarship.unlv.edu/thesesdissertations/945

Chicago Manual of Style (16th Edition):

Andro-Vasko, James. “Shop problems in scheduling.” 2011. Masters Thesis, University of Nevada – Las Vegas. Accessed August 06, 2020. https://digitalscholarship.unlv.edu/thesesdissertations/945.

MLA Handbook (7th Edition):

Andro-Vasko, James. “Shop problems in scheduling.” 2011. Web. 06 Aug 2020.

Vancouver:

Andro-Vasko J. Shop problems in scheduling. [Internet] [Masters thesis]. University of Nevada – Las Vegas; 2011. [cited 2020 Aug 06]. Available from: https://digitalscholarship.unlv.edu/thesesdissertations/945.

Council of Science Editors:

Andro-Vasko J. Shop problems in scheduling. [Masters Thesis]. University of Nevada – Las Vegas; 2011. Available from: https://digitalscholarship.unlv.edu/thesesdissertations/945


University of Nevada – Las Vegas

8. Tatavarty, Aditya S. Topic detection and tracking using hidden Markov models.

Degree: MSin Computer Science, Computer Science, 2011, University of Nevada – Las Vegas

  There is a continuous progress in automatic recording of broadcast speech using speech recognition. With the increasing use of this technology, a new source… (more)

Subjects/Keywords: Computer Sciences; Theory and Algorithms

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Tatavarty, A. S. (2011). Topic detection and tracking using hidden Markov models. (Masters Thesis). University of Nevada – Las Vegas. Retrieved from https://digitalscholarship.unlv.edu/thesesdissertations/907

Chicago Manual of Style (16th Edition):

Tatavarty, Aditya S. “Topic detection and tracking using hidden Markov models.” 2011. Masters Thesis, University of Nevada – Las Vegas. Accessed August 06, 2020. https://digitalscholarship.unlv.edu/thesesdissertations/907.

MLA Handbook (7th Edition):

Tatavarty, Aditya S. “Topic detection and tracking using hidden Markov models.” 2011. Web. 06 Aug 2020.

Vancouver:

Tatavarty AS. Topic detection and tracking using hidden Markov models. [Internet] [Masters thesis]. University of Nevada – Las Vegas; 2011. [cited 2020 Aug 06]. Available from: https://digitalscholarship.unlv.edu/thesesdissertations/907.

Council of Science Editors:

Tatavarty AS. Topic detection and tracking using hidden Markov models. [Masters Thesis]. University of Nevada – Las Vegas; 2011. Available from: https://digitalscholarship.unlv.edu/thesesdissertations/907


University of Nevada – Las Vegas

9. Vyas, Lakshmi. Finding acronyms and their definitions using HMM.

Degree: MSin Computer Science, Computer Science, 2011, University of Nevada – Las Vegas

  In this thesis, we report on design and implementation of a Hidden Markov Model (HMM) to extract acronyms and their expansions. We also report… (more)

Subjects/Keywords: Computer Sciences; Theory and Algorithms

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Vyas, L. (2011). Finding acronyms and their definitions using HMM. (Masters Thesis). University of Nevada – Las Vegas. Retrieved from https://digitalscholarship.unlv.edu/thesesdissertations/981

Chicago Manual of Style (16th Edition):

Vyas, Lakshmi. “Finding acronyms and their definitions using HMM.” 2011. Masters Thesis, University of Nevada – Las Vegas. Accessed August 06, 2020. https://digitalscholarship.unlv.edu/thesesdissertations/981.

MLA Handbook (7th Edition):

Vyas, Lakshmi. “Finding acronyms and their definitions using HMM.” 2011. Web. 06 Aug 2020.

Vancouver:

Vyas L. Finding acronyms and their definitions using HMM. [Internet] [Masters thesis]. University of Nevada – Las Vegas; 2011. [cited 2020 Aug 06]. Available from: https://digitalscholarship.unlv.edu/thesesdissertations/981.

Council of Science Editors:

Vyas L. Finding acronyms and their definitions using HMM. [Masters Thesis]. University of Nevada – Las Vegas; 2011. Available from: https://digitalscholarship.unlv.edu/thesesdissertations/981


University of Nevada – Las Vegas

10. Boodidhi, Sweatha. Using smoothing techniques to improve the performance of Hidden Markov’s Model.

Degree: MSin Computer Science, Computer Science, 2011, University of Nevada – Las Vegas

  The result of training a HMM using supervised training is estimated probabilities for emissions and transitions. There are two difficulties with this approach Firstly,… (more)

Subjects/Keywords: Computer Sciences; Theory and Algorithms

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Boodidhi, S. (2011). Using smoothing techniques to improve the performance of Hidden Markov’s Model. (Masters Thesis). University of Nevada – Las Vegas. Retrieved from https://digitalscholarship.unlv.edu/thesesdissertations/1007

Chicago Manual of Style (16th Edition):

Boodidhi, Sweatha. “Using smoothing techniques to improve the performance of Hidden Markov’s Model.” 2011. Masters Thesis, University of Nevada – Las Vegas. Accessed August 06, 2020. https://digitalscholarship.unlv.edu/thesesdissertations/1007.

MLA Handbook (7th Edition):

Boodidhi, Sweatha. “Using smoothing techniques to improve the performance of Hidden Markov’s Model.” 2011. Web. 06 Aug 2020.

Vancouver:

Boodidhi S. Using smoothing techniques to improve the performance of Hidden Markov’s Model. [Internet] [Masters thesis]. University of Nevada – Las Vegas; 2011. [cited 2020 Aug 06]. Available from: https://digitalscholarship.unlv.edu/thesesdissertations/1007.

Council of Science Editors:

Boodidhi S. Using smoothing techniques to improve the performance of Hidden Markov’s Model. [Masters Thesis]. University of Nevada – Las Vegas; 2011. Available from: https://digitalscholarship.unlv.edu/thesesdissertations/1007


Rutgers University

11. Kuksa, Pavel, 1981-. Scalable kernel methods and algorithms for general sequence analysis.

Degree: PhD, Computer Science, 2011, Rutgers University

Analysis of large-scale sequential data has become an important task in machine learning and pattern recognition, inspired in part by numerous scientific and technological applications… (more)

Subjects/Keywords: Computer algorithms; Sequential machine theory

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Kuksa, Pavel, 1. (2011). Scalable kernel methods and algorithms for general sequence analysis. (Doctoral Dissertation). Rutgers University. Retrieved from http://hdl.rutgers.edu/1782.1/rucore10001600001.ETD.000061323

Chicago Manual of Style (16th Edition):

Kuksa, Pavel, 1981-. “Scalable kernel methods and algorithms for general sequence analysis.” 2011. Doctoral Dissertation, Rutgers University. Accessed August 06, 2020. http://hdl.rutgers.edu/1782.1/rucore10001600001.ETD.000061323.

MLA Handbook (7th Edition):

Kuksa, Pavel, 1981-. “Scalable kernel methods and algorithms for general sequence analysis.” 2011. Web. 06 Aug 2020.

Vancouver:

Kuksa, Pavel 1. Scalable kernel methods and algorithms for general sequence analysis. [Internet] [Doctoral dissertation]. Rutgers University; 2011. [cited 2020 Aug 06]. Available from: http://hdl.rutgers.edu/1782.1/rucore10001600001.ETD.000061323.

Council of Science Editors:

Kuksa, Pavel 1. Scalable kernel methods and algorithms for general sequence analysis. [Doctoral Dissertation]. Rutgers University; 2011. Available from: http://hdl.rutgers.edu/1782.1/rucore10001600001.ETD.000061323


Rutgers University

12. Naumovitz, Timothy Ryan. Very efficient approximation algorithms to edit distance problems.

Degree: PhD, Mathematics, 2016, Rutgers University

This thesis deals with the question of approximating distance to monotonicity in the streaming setting as well as the task of approximating the ulam distance… (more)

Subjects/Keywords: Computer algorithms; Approximation theory

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Naumovitz, T. R. (2016). Very efficient approximation algorithms to edit distance problems. (Doctoral Dissertation). Rutgers University. Retrieved from https://rucore.libraries.rutgers.edu/rutgers-lib/51382/

Chicago Manual of Style (16th Edition):

Naumovitz, Timothy Ryan. “Very efficient approximation algorithms to edit distance problems.” 2016. Doctoral Dissertation, Rutgers University. Accessed August 06, 2020. https://rucore.libraries.rutgers.edu/rutgers-lib/51382/.

MLA Handbook (7th Edition):

Naumovitz, Timothy Ryan. “Very efficient approximation algorithms to edit distance problems.” 2016. Web. 06 Aug 2020.

Vancouver:

Naumovitz TR. Very efficient approximation algorithms to edit distance problems. [Internet] [Doctoral dissertation]. Rutgers University; 2016. [cited 2020 Aug 06]. Available from: https://rucore.libraries.rutgers.edu/rutgers-lib/51382/.

Council of Science Editors:

Naumovitz TR. Very efficient approximation algorithms to edit distance problems. [Doctoral Dissertation]. Rutgers University; 2016. Available from: https://rucore.libraries.rutgers.edu/rutgers-lib/51382/


Hong Kong University of Science and Technology

13. Antony, Mathis Aurelius. Partial information, noise and network topology in 2x2 games with memory.

Degree: 2011, Hong Kong University of Science and Technology

 We investigate the collective behaviour of a large number of agents with one step memory horizon in the framework of evolutionary game theory. A refinement… (more)

Subjects/Keywords: Game theory ; Algorithms ; Topology

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Antony, M. A. (2011). Partial information, noise and network topology in 2x2 games with memory. (Thesis). Hong Kong University of Science and Technology. Retrieved from http://repository.ust.hk/ir/Record/1783.1-7274 ; https://doi.org/10.14711/thesis-b1156461 ; http://repository.ust.hk/ir/bitstream/1783.1-7274/1/th_redirect.html

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

Antony, Mathis Aurelius. “Partial information, noise and network topology in 2x2 games with memory.” 2011. Thesis, Hong Kong University of Science and Technology. Accessed August 06, 2020. http://repository.ust.hk/ir/Record/1783.1-7274 ; https://doi.org/10.14711/thesis-b1156461 ; http://repository.ust.hk/ir/bitstream/1783.1-7274/1/th_redirect.html.

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

MLA Handbook (7th Edition):

Antony, Mathis Aurelius. “Partial information, noise and network topology in 2x2 games with memory.” 2011. Web. 06 Aug 2020.

Vancouver:

Antony MA. Partial information, noise and network topology in 2x2 games with memory. [Internet] [Thesis]. Hong Kong University of Science and Technology; 2011. [cited 2020 Aug 06]. Available from: http://repository.ust.hk/ir/Record/1783.1-7274 ; https://doi.org/10.14711/thesis-b1156461 ; http://repository.ust.hk/ir/bitstream/1783.1-7274/1/th_redirect.html.

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

Council of Science Editors:

Antony MA. Partial information, noise and network topology in 2x2 games with memory. [Thesis]. Hong Kong University of Science and Technology; 2011. Available from: http://repository.ust.hk/ir/Record/1783.1-7274 ; https://doi.org/10.14711/thesis-b1156461 ; http://repository.ust.hk/ir/bitstream/1783.1-7274/1/th_redirect.html

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


University of Illinois – Urbana-Champaign

14. Doan, Thinh Thanh. On the performance of distributed algorithms for network optimization problems.

Degree: PhD, Electrical & Computer Engr, 2018, University of Illinois – Urbana-Champaign

 This thesis considers optimization problems defined over a network of nodes, where each node knows only part of the objective functions. We are motivated by… (more)

Subjects/Keywords: Distributed algorithms; optimization; control theory

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Doan, T. T. (2018). On the performance of distributed algorithms for network optimization problems. (Doctoral Dissertation). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/100998

Chicago Manual of Style (16th Edition):

Doan, Thinh Thanh. “On the performance of distributed algorithms for network optimization problems.” 2018. Doctoral Dissertation, University of Illinois – Urbana-Champaign. Accessed August 06, 2020. http://hdl.handle.net/2142/100998.

MLA Handbook (7th Edition):

Doan, Thinh Thanh. “On the performance of distributed algorithms for network optimization problems.” 2018. Web. 06 Aug 2020.

Vancouver:

Doan TT. On the performance of distributed algorithms for network optimization problems. [Internet] [Doctoral dissertation]. University of Illinois – Urbana-Champaign; 2018. [cited 2020 Aug 06]. Available from: http://hdl.handle.net/2142/100998.

Council of Science Editors:

Doan TT. On the performance of distributed algorithms for network optimization problems. [Doctoral Dissertation]. University of Illinois – Urbana-Champaign; 2018. Available from: http://hdl.handle.net/2142/100998


Duke University

15. Haney, Samuel Mitchell. Algorithms for Networks With Uncertainty .

Degree: 2019, Duke University

  In this dissertation, we study algorithmic problems motivated by the optimization of networks under uncertainty. We summarize our contributions: \begin{itemize} \item bf{Subset k-server:} We… (more)

Subjects/Keywords: Computer science; Algorithms; Theory

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Haney, S. M. (2019). Algorithms for Networks With Uncertainty . (Thesis). Duke University. Retrieved from http://hdl.handle.net/10161/18661

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

Haney, Samuel Mitchell. “Algorithms for Networks With Uncertainty .” 2019. Thesis, Duke University. Accessed August 06, 2020. http://hdl.handle.net/10161/18661.

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

MLA Handbook (7th Edition):

Haney, Samuel Mitchell. “Algorithms for Networks With Uncertainty .” 2019. Web. 06 Aug 2020.

Vancouver:

Haney SM. Algorithms for Networks With Uncertainty . [Internet] [Thesis]. Duke University; 2019. [cited 2020 Aug 06]. Available from: http://hdl.handle.net/10161/18661.

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

Council of Science Editors:

Haney SM. Algorithms for Networks With Uncertainty . [Thesis]. Duke University; 2019. Available from: http://hdl.handle.net/10161/18661

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


Columbia University

16. Shadravan, Mohammad. Submodular Secretary Problem with Shortlists under General Constraints.

Degree: 2020, Columbia University

 In submodular k-secretary problem, the goal is to select k items in a randomly ordered input so as to maximize the expected value of a… (more)

Subjects/Keywords: Operations research; Computer science; Online algorithms; Approximation algorithms; Algorithms; Secretary problem (Probability theory); Submodular functions

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Shadravan, M. (2020). Submodular Secretary Problem with Shortlists under General Constraints. (Doctoral Dissertation). Columbia University. Retrieved from https://doi.org/10.7916/d8-cvbj-6c48

Chicago Manual of Style (16th Edition):

Shadravan, Mohammad. “Submodular Secretary Problem with Shortlists under General Constraints.” 2020. Doctoral Dissertation, Columbia University. Accessed August 06, 2020. https://doi.org/10.7916/d8-cvbj-6c48.

MLA Handbook (7th Edition):

Shadravan, Mohammad. “Submodular Secretary Problem with Shortlists under General Constraints.” 2020. Web. 06 Aug 2020.

Vancouver:

Shadravan M. Submodular Secretary Problem with Shortlists under General Constraints. [Internet] [Doctoral dissertation]. Columbia University; 2020. [cited 2020 Aug 06]. Available from: https://doi.org/10.7916/d8-cvbj-6c48.

Council of Science Editors:

Shadravan M. Submodular Secretary Problem with Shortlists under General Constraints. [Doctoral Dissertation]. Columbia University; 2020. Available from: https://doi.org/10.7916/d8-cvbj-6c48

17. Jägersküpper, Jens. Probabilistic analysis of evolution strategies using isotropic mutations.

Degree: 2006, Technische Universität Dortmund

 This dissertation deals with optimization in high-dimensional Euclidean space. Namely, a particular type of direct-search methods known as Evolution Strategies (ESs) are investigated. Evolution Strategies… (more)

Subjects/Keywords: algorithms; evolutionary algorithms; heuristic optimization; probabilistic analysis; theory; 004

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Jägersküpper, J. (2006). Probabilistic analysis of evolution strategies using isotropic mutations. (Thesis). Technische Universität Dortmund. Retrieved from http://hdl.handle.net/2003/23261

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

Jägersküpper, Jens. “Probabilistic analysis of evolution strategies using isotropic mutations.” 2006. Thesis, Technische Universität Dortmund. Accessed August 06, 2020. http://hdl.handle.net/2003/23261.

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

MLA Handbook (7th Edition):

Jägersküpper, Jens. “Probabilistic analysis of evolution strategies using isotropic mutations.” 2006. Web. 06 Aug 2020.

Vancouver:

Jägersküpper J. Probabilistic analysis of evolution strategies using isotropic mutations. [Internet] [Thesis]. Technische Universität Dortmund; 2006. [cited 2020 Aug 06]. Available from: http://hdl.handle.net/2003/23261.

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

Council of Science Editors:

Jägersküpper J. Probabilistic analysis of evolution strategies using isotropic mutations. [Thesis]. Technische Universität Dortmund; 2006. Available from: http://hdl.handle.net/2003/23261

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


Penn State University

18. Li, Zhenyao. Greedy Algorithm for approximating maximum induced matching.

Degree: MS, Computer Science and Engineering, 2014, Penn State University

 An induced matching in a graph G=(V,E) is M\subseteq E such that it is a matching and also the edge set of an induced subgraph… (more)

Subjects/Keywords: graph theory; combinatorial problem; approximation algorithms; induced matching; greedy algorithms

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Li, Z. (2014). Greedy Algorithm for approximating maximum induced matching. (Masters Thesis). Penn State University. Retrieved from https://etda.libraries.psu.edu/catalog/22793

Chicago Manual of Style (16th Edition):

Li, Zhenyao. “Greedy Algorithm for approximating maximum induced matching.” 2014. Masters Thesis, Penn State University. Accessed August 06, 2020. https://etda.libraries.psu.edu/catalog/22793.

MLA Handbook (7th Edition):

Li, Zhenyao. “Greedy Algorithm for approximating maximum induced matching.” 2014. Web. 06 Aug 2020.

Vancouver:

Li Z. Greedy Algorithm for approximating maximum induced matching. [Internet] [Masters thesis]. Penn State University; 2014. [cited 2020 Aug 06]. Available from: https://etda.libraries.psu.edu/catalog/22793.

Council of Science Editors:

Li Z. Greedy Algorithm for approximating maximum induced matching. [Masters Thesis]. Penn State University; 2014. Available from: https://etda.libraries.psu.edu/catalog/22793


Penn State University

19. Yaroslavtsev, Grigory. "efficient Combinatorial Methods in Sparsification, Summarization and Testing of Large Datasets".

Degree: PhD, Computer Science and Engineering, 2013, Penn State University

 Increasingly large amounts of structured data are being collected by personal computers, mobile devices, personal gadgets, sensors, etc., and stored in data centers operated by… (more)

Subjects/Keywords: algorithms; big data; sublinear algorithms; graph theory; sparsification; summarization

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Yaroslavtsev, G. (2013). "efficient Combinatorial Methods in Sparsification, Summarization and Testing of Large Datasets". (Doctoral Dissertation). Penn State University. Retrieved from https://etda.libraries.psu.edu/catalog/20047

Chicago Manual of Style (16th Edition):

Yaroslavtsev, Grigory. “"efficient Combinatorial Methods in Sparsification, Summarization and Testing of Large Datasets".” 2013. Doctoral Dissertation, Penn State University. Accessed August 06, 2020. https://etda.libraries.psu.edu/catalog/20047.

MLA Handbook (7th Edition):

Yaroslavtsev, Grigory. “"efficient Combinatorial Methods in Sparsification, Summarization and Testing of Large Datasets".” 2013. Web. 06 Aug 2020.

Vancouver:

Yaroslavtsev G. "efficient Combinatorial Methods in Sparsification, Summarization and Testing of Large Datasets". [Internet] [Doctoral dissertation]. Penn State University; 2013. [cited 2020 Aug 06]. Available from: https://etda.libraries.psu.edu/catalog/20047.

Council of Science Editors:

Yaroslavtsev G. "efficient Combinatorial Methods in Sparsification, Summarization and Testing of Large Datasets". [Doctoral Dissertation]. Penn State University; 2013. Available from: https://etda.libraries.psu.edu/catalog/20047


Portland State University

20. Shelly, Iris Lynn. Algorithm for Premature Ventricular Contraction Detection from a Subcutaneous Electrocardiogram Signal.

Degree: MS(M.S.) in Electrical and Computer Engineering, Electrical and Computer Engineering, 2016, Portland State University

  Cardiac arrhythmias occur when the normal pattern of electrical signals in the heart breaks down. A premature ventricular contraction (PVC) is a common type… (more)

Subjects/Keywords: Arrhythmia  – Diagnosis; Electrocardiography; Algorithms; Biomedical; Theory and Algorithms

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Shelly, I. L. (2016). Algorithm for Premature Ventricular Contraction Detection from a Subcutaneous Electrocardiogram Signal. (Masters Thesis). Portland State University. Retrieved from http://pdxscholar.library.pdx.edu/open_access_etds/3313

Chicago Manual of Style (16th Edition):

Shelly, Iris Lynn. “Algorithm for Premature Ventricular Contraction Detection from a Subcutaneous Electrocardiogram Signal.” 2016. Masters Thesis, Portland State University. Accessed August 06, 2020. http://pdxscholar.library.pdx.edu/open_access_etds/3313.

MLA Handbook (7th Edition):

Shelly, Iris Lynn. “Algorithm for Premature Ventricular Contraction Detection from a Subcutaneous Electrocardiogram Signal.” 2016. Web. 06 Aug 2020.

Vancouver:

Shelly IL. Algorithm for Premature Ventricular Contraction Detection from a Subcutaneous Electrocardiogram Signal. [Internet] [Masters thesis]. Portland State University; 2016. [cited 2020 Aug 06]. Available from: http://pdxscholar.library.pdx.edu/open_access_etds/3313.

Council of Science Editors:

Shelly IL. Algorithm for Premature Ventricular Contraction Detection from a Subcutaneous Electrocardiogram Signal. [Masters Thesis]. Portland State University; 2016. Available from: http://pdxscholar.library.pdx.edu/open_access_etds/3313


Northeastern University

21. Roche, Scott T. Robust local algorithms for communication and stability in distributed networks.

Degree: PhD, Computer Science Program, 2017, Northeastern University

 In a world in which our technological infrastructure is increasingly reliant on platforms that are distributed in nature, there is a substantial need for distributed… (more)

Subjects/Keywords: applied graph theory; distributed algorithms; epidemic processes; randomized algorithms; random walks

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Roche, S. T. (2017). Robust local algorithms for communication and stability in distributed networks. (Doctoral Dissertation). Northeastern University. Retrieved from http://hdl.handle.net/2047/D20247295

Chicago Manual of Style (16th Edition):

Roche, Scott T. “Robust local algorithms for communication and stability in distributed networks.” 2017. Doctoral Dissertation, Northeastern University. Accessed August 06, 2020. http://hdl.handle.net/2047/D20247295.

MLA Handbook (7th Edition):

Roche, Scott T. “Robust local algorithms for communication and stability in distributed networks.” 2017. Web. 06 Aug 2020.

Vancouver:

Roche ST. Robust local algorithms for communication and stability in distributed networks. [Internet] [Doctoral dissertation]. Northeastern University; 2017. [cited 2020 Aug 06]. Available from: http://hdl.handle.net/2047/D20247295.

Council of Science Editors:

Roche ST. Robust local algorithms for communication and stability in distributed networks. [Doctoral Dissertation]. Northeastern University; 2017. Available from: http://hdl.handle.net/2047/D20247295


University of Iowa

22. Kanade, Gaurav Nandkumar. Combinatorial optimization problems in geometric settings.

Degree: PhD, Computer Science, 2011, University of Iowa

  We consider several combinatorial optimization problems in a geometric set- ting. The first problem we consider is the problem of clustering to minimize the… (more)

Subjects/Keywords: Algorithms; Approximation Algorithms; Computational Geometry; Network Design; Theory; Computer Sciences

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Kanade, G. N. (2011). Combinatorial optimization problems in geometric settings. (Doctoral Dissertation). University of Iowa. Retrieved from https://ir.uiowa.edu/etd/1152

Chicago Manual of Style (16th Edition):

Kanade, Gaurav Nandkumar. “Combinatorial optimization problems in geometric settings.” 2011. Doctoral Dissertation, University of Iowa. Accessed August 06, 2020. https://ir.uiowa.edu/etd/1152.

MLA Handbook (7th Edition):

Kanade, Gaurav Nandkumar. “Combinatorial optimization problems in geometric settings.” 2011. Web. 06 Aug 2020.

Vancouver:

Kanade GN. Combinatorial optimization problems in geometric settings. [Internet] [Doctoral dissertation]. University of Iowa; 2011. [cited 2020 Aug 06]. Available from: https://ir.uiowa.edu/etd/1152.

Council of Science Editors:

Kanade GN. Combinatorial optimization problems in geometric settings. [Doctoral Dissertation]. University of Iowa; 2011. Available from: https://ir.uiowa.edu/etd/1152


University of Western Ontario

23. Sun, Weiping. Algorithms for Glycan Structure Identification with Tandem Mass Spectrometry.

Degree: 2016, University of Western Ontario

 Glycosylation is a frequently observed post-translational modification (PTM) of proteins. It has been estimated over half of eukaryotic proteins in nature are glycoproteins. Glycoprotein analysis… (more)

Subjects/Keywords: Glycan Identification; Tandem Mass Spectrometry; Glycopeptide; Algorithms; Bioinformatics; Theory and Algorithms

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Sun, W. (2016). Algorithms for Glycan Structure Identification with Tandem Mass Spectrometry. (Thesis). University of Western Ontario. Retrieved from https://ir.lib.uwo.ca/etd/4105

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

Sun, Weiping. “Algorithms for Glycan Structure Identification with Tandem Mass Spectrometry.” 2016. Thesis, University of Western Ontario. Accessed August 06, 2020. https://ir.lib.uwo.ca/etd/4105.

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

MLA Handbook (7th Edition):

Sun, Weiping. “Algorithms for Glycan Structure Identification with Tandem Mass Spectrometry.” 2016. Web. 06 Aug 2020.

Vancouver:

Sun W. Algorithms for Glycan Structure Identification with Tandem Mass Spectrometry. [Internet] [Thesis]. University of Western Ontario; 2016. [cited 2020 Aug 06]. Available from: https://ir.lib.uwo.ca/etd/4105.

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

Council of Science Editors:

Sun W. Algorithms for Glycan Structure Identification with Tandem Mass Spectrometry. [Thesis]. University of Western Ontario; 2016. Available from: https://ir.lib.uwo.ca/etd/4105

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


Ryerson University

24. Behzadan, Afshin. Game theoretical approach for utility-based distributed balanced data routing in wireless sensor networks.

Degree: 2010, Ryerson University

 In this thesis, two distributed algorithms for the construction of load balanced routing trees in wireless sensor networks are proposed. In such networks load balanced… (more)

Subjects/Keywords: Wireless sensor networks.; Game theory; Computer algorithms.

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Behzadan, A. (2010). Game theoretical approach for utility-based distributed balanced data routing in wireless sensor networks. (Thesis). Ryerson University. Retrieved from https://digital.library.ryerson.ca/islandora/object/RULA%3A6700

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

Behzadan, Afshin. “Game theoretical approach for utility-based distributed balanced data routing in wireless sensor networks.” 2010. Thesis, Ryerson University. Accessed August 06, 2020. https://digital.library.ryerson.ca/islandora/object/RULA%3A6700.

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

MLA Handbook (7th Edition):

Behzadan, Afshin. “Game theoretical approach for utility-based distributed balanced data routing in wireless sensor networks.” 2010. Web. 06 Aug 2020.

Vancouver:

Behzadan A. Game theoretical approach for utility-based distributed balanced data routing in wireless sensor networks. [Internet] [Thesis]. Ryerson University; 2010. [cited 2020 Aug 06]. Available from: https://digital.library.ryerson.ca/islandora/object/RULA%3A6700.

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

Council of Science Editors:

Behzadan A. Game theoretical approach for utility-based distributed balanced data routing in wireless sensor networks. [Thesis]. Ryerson University; 2010. Available from: https://digital.library.ryerson.ca/islandora/object/RULA%3A6700

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


Montana State University

25. Li, Zhongyuan. An efficient implementation of a planarity testing and maximal planar subgraph algorithm.

Degree: College of Engineering, 1996, Montana State University

Subjects/Keywords: Graph theory.; Algorithms.

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Li, Z. (1996). An efficient implementation of a planarity testing and maximal planar subgraph algorithm. (Thesis). Montana State University. Retrieved from https://scholarworks.montana.edu/xmlui/handle/1/7520

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

Li, Zhongyuan. “An efficient implementation of a planarity testing and maximal planar subgraph algorithm.” 1996. Thesis, Montana State University. Accessed August 06, 2020. https://scholarworks.montana.edu/xmlui/handle/1/7520.

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

MLA Handbook (7th Edition):

Li, Zhongyuan. “An efficient implementation of a planarity testing and maximal planar subgraph algorithm.” 1996. Web. 06 Aug 2020.

Vancouver:

Li Z. An efficient implementation of a planarity testing and maximal planar subgraph algorithm. [Internet] [Thesis]. Montana State University; 1996. [cited 2020 Aug 06]. Available from: https://scholarworks.montana.edu/xmlui/handle/1/7520.

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

Council of Science Editors:

Li Z. An efficient implementation of a planarity testing and maximal planar subgraph algorithm. [Thesis]. Montana State University; 1996. Available from: https://scholarworks.montana.edu/xmlui/handle/1/7520

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

26. Stamm, Karl Douglas. Gene Set Enrichment and Projection: A Computational Tool for Knowledge Discovery in Transcriptomes.

Degree: 2016, Marquette University

 Explaining the mechanism behind a genetic disease involves two phases, collecting and analyzing data associated to the disease, then interpreting those data in the context… (more)

Subjects/Keywords: genetics; medicine; rnaseq; Bioinformatics; Theory and Algorithms

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Stamm, K. D. (2016). Gene Set Enrichment and Projection: A Computational Tool for Knowledge Discovery in Transcriptomes. (Thesis). Marquette University. Retrieved from https://epublications.marquette.edu/dissertations_mu/667

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

Stamm, Karl Douglas. “Gene Set Enrichment and Projection: A Computational Tool for Knowledge Discovery in Transcriptomes.” 2016. Thesis, Marquette University. Accessed August 06, 2020. https://epublications.marquette.edu/dissertations_mu/667.

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

MLA Handbook (7th Edition):

Stamm, Karl Douglas. “Gene Set Enrichment and Projection: A Computational Tool for Knowledge Discovery in Transcriptomes.” 2016. Web. 06 Aug 2020.

Vancouver:

Stamm KD. Gene Set Enrichment and Projection: A Computational Tool for Knowledge Discovery in Transcriptomes. [Internet] [Thesis]. Marquette University; 2016. [cited 2020 Aug 06]. Available from: https://epublications.marquette.edu/dissertations_mu/667.

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

Council of Science Editors:

Stamm KD. Gene Set Enrichment and Projection: A Computational Tool for Knowledge Discovery in Transcriptomes. [Thesis]. Marquette University; 2016. Available from: https://epublications.marquette.edu/dissertations_mu/667

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


University of Johannesburg

27. Barnard, Andries. Groepteoretiese algoritmes en die grafiekisomorfie-probleem.

Degree: 2014, University of Johannesburg

M.Sc. (Mathematics)

Please refer to full text to view abstract

Subjects/Keywords: Group theory; Algorithms

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Barnard, A. (2014). Groepteoretiese algoritmes en die grafiekisomorfie-probleem. (Thesis). University of Johannesburg. Retrieved from http://hdl.handle.net/10210/11920

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

Barnard, Andries. “Groepteoretiese algoritmes en die grafiekisomorfie-probleem.” 2014. Thesis, University of Johannesburg. Accessed August 06, 2020. http://hdl.handle.net/10210/11920.

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

MLA Handbook (7th Edition):

Barnard, Andries. “Groepteoretiese algoritmes en die grafiekisomorfie-probleem.” 2014. Web. 06 Aug 2020.

Vancouver:

Barnard A. Groepteoretiese algoritmes en die grafiekisomorfie-probleem. [Internet] [Thesis]. University of Johannesburg; 2014. [cited 2020 Aug 06]. Available from: http://hdl.handle.net/10210/11920.

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

Council of Science Editors:

Barnard A. Groepteoretiese algoritmes en die grafiekisomorfie-probleem. [Thesis]. University of Johannesburg; 2014. Available from: http://hdl.handle.net/10210/11920

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


Montana State University

28. Trieu, Kenneth Lieng-Quac. Algorithms for nearly time-optimal and insensitive computer control of systems.

Degree: College of Engineering, 1971, Montana State University

Subjects/Keywords: Algorithms.; Control theory.

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Trieu, K. L. (1971). Algorithms for nearly time-optimal and insensitive computer control of systems. (Thesis). Montana State University. Retrieved from https://scholarworks.montana.edu/xmlui/handle/1/4684

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

Trieu, Kenneth Lieng-Quac. “Algorithms for nearly time-optimal and insensitive computer control of systems.” 1971. Thesis, Montana State University. Accessed August 06, 2020. https://scholarworks.montana.edu/xmlui/handle/1/4684.

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

MLA Handbook (7th Edition):

Trieu, Kenneth Lieng-Quac. “Algorithms for nearly time-optimal and insensitive computer control of systems.” 1971. Web. 06 Aug 2020.

Vancouver:

Trieu KL. Algorithms for nearly time-optimal and insensitive computer control of systems. [Internet] [Thesis]. Montana State University; 1971. [cited 2020 Aug 06]. Available from: https://scholarworks.montana.edu/xmlui/handle/1/4684.

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

Council of Science Editors:

Trieu KL. Algorithms for nearly time-optimal and insensitive computer control of systems. [Thesis]. Montana State University; 1971. Available from: https://scholarworks.montana.edu/xmlui/handle/1/4684

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


Cape Peninsula University of Technology

29. Mfoumboulou, Yohan Darcy. Development of nonlinear control algorithms for implementation in distributed systems .

Degree: 2014, Cape Peninsula University of Technology

 In the past decade, the need for flexibility and reconfigurability in automation has contributed to the rise of the distributed concept in control systems engineering.… (more)

Subjects/Keywords: Nonlinear control theory; Algorithms; Nonlinear systems

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Mfoumboulou, Y. D. (2014). Development of nonlinear control algorithms for implementation in distributed systems . (Thesis). Cape Peninsula University of Technology. Retrieved from http://etd.cput.ac.za/handle/20.500.11838/1187

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

Mfoumboulou, Yohan Darcy. “Development of nonlinear control algorithms for implementation in distributed systems .” 2014. Thesis, Cape Peninsula University of Technology. Accessed August 06, 2020. http://etd.cput.ac.za/handle/20.500.11838/1187.

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

MLA Handbook (7th Edition):

Mfoumboulou, Yohan Darcy. “Development of nonlinear control algorithms for implementation in distributed systems .” 2014. Web. 06 Aug 2020.

Vancouver:

Mfoumboulou YD. Development of nonlinear control algorithms for implementation in distributed systems . [Internet] [Thesis]. Cape Peninsula University of Technology; 2014. [cited 2020 Aug 06]. Available from: http://etd.cput.ac.za/handle/20.500.11838/1187.

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

Council of Science Editors:

Mfoumboulou YD. Development of nonlinear control algorithms for implementation in distributed systems . [Thesis]. Cape Peninsula University of Technology; 2014. Available from: http://etd.cput.ac.za/handle/20.500.11838/1187

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


Edith Cowan University

30. Shaw, David. An investigation into remote transactions.

Degree: 2012, Edith Cowan University

 Remote transactions globally transfer trillions of dollars annually. Many of these information exchanges are mediated, implicitly or explicitly, by a complex web of agencies that… (more)

Subjects/Keywords: Identification; Authentication; Verification; Transactions; Theory and Algorithms

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Shaw, D. (2012). An investigation into remote transactions. (Thesis). Edith Cowan University. Retrieved from https://ro.ecu.edu.au/theses/441

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

Shaw, David. “An investigation into remote transactions.” 2012. Thesis, Edith Cowan University. Accessed August 06, 2020. https://ro.ecu.edu.au/theses/441.

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

MLA Handbook (7th Edition):

Shaw, David. “An investigation into remote transactions.” 2012. Web. 06 Aug 2020.

Vancouver:

Shaw D. An investigation into remote transactions. [Internet] [Thesis]. Edith Cowan University; 2012. [cited 2020 Aug 06]. Available from: https://ro.ecu.edu.au/theses/441.

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

Council of Science Editors:

Shaw D. An investigation into remote transactions. [Thesis]. Edith Cowan University; 2012. Available from: https://ro.ecu.edu.au/theses/441

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

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

.