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 897 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 http://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 May 20, 2019. http://scholar.colorado.edu/csci_gradetds/23.

MLA Handbook (7th Edition):

Beach, Aaron. “Anonymity in Socio-Digital Systems.” 2011. Web. 20 May 2019.

Vancouver:

Beach A. Anonymity in Socio-Digital Systems. [Internet] [Doctoral dissertation]. University of Colorado; 2011. [cited 2019 May 20]. Available from: http://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: http://scholar.colorado.edu/csci_gradetds/23


University of Victoria

2. Boyer, John M. Simplified O(n) algorithms for planar graph embedding, Kuratowski subgraph isolation, and related problems.

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

 A graph is planar if it can be drawn on the plane with vertices at unique locations and no edge intersections. Due to the wealth… (more)

Subjects/Keywords: Graph theory; Algorithms

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Boyer, J. M. (2018). Simplified O(n) algorithms for planar graph embedding, Kuratowski subgraph isolation, and related problems. (Thesis). University of Victoria. Retrieved from https://dspace.library.uvic.ca//handle/1828/9918

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

Boyer, John M. “Simplified O(n) algorithms for planar graph embedding, Kuratowski subgraph isolation, and related problems.” 2018. Thesis, University of Victoria. Accessed May 20, 2019. https://dspace.library.uvic.ca//handle/1828/9918.

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

MLA Handbook (7th Edition):

Boyer, John M. “Simplified O(n) algorithms for planar graph embedding, Kuratowski subgraph isolation, and related problems.” 2018. Web. 20 May 2019.

Vancouver:

Boyer JM. Simplified O(n) algorithms for planar graph embedding, Kuratowski subgraph isolation, and related problems. [Internet] [Thesis]. University of Victoria; 2018. [cited 2019 May 20]. Available from: https://dspace.library.uvic.ca//handle/1828/9918.

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

Council of Science Editors:

Boyer JM. Simplified O(n) algorithms for planar graph embedding, Kuratowski subgraph isolation, and related problems. [Thesis]. University of Victoria; 2018. Available from: https://dspace.library.uvic.ca//handle/1828/9918

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


Colorado State University

3. Chaturvedi, Mmanu. Parametric classification of directed acyclic graphs, A.

Degree: MS(M.S.), Computer Science, 2017, Colorado State University

 We consider four NP-hard optimization problems on directed acyclic graphs (DAGs), namely, max clique, min coloring, max independent set and min clique cover. It is… (more)

Subjects/Keywords: Graph Theory; Algorithms

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Chaturvedi, M. (2017). Parametric classification of directed acyclic graphs, A. (Masters Thesis). Colorado State University. Retrieved from http://hdl.handle.net/10217/183921

Chicago Manual of Style (16th Edition):

Chaturvedi, Mmanu. “Parametric classification of directed acyclic graphs, A.” 2017. Masters Thesis, Colorado State University. Accessed May 20, 2019. http://hdl.handle.net/10217/183921.

MLA Handbook (7th Edition):

Chaturvedi, Mmanu. “Parametric classification of directed acyclic graphs, A.” 2017. Web. 20 May 2019.

Vancouver:

Chaturvedi M. Parametric classification of directed acyclic graphs, A. [Internet] [Masters thesis]. Colorado State University; 2017. [cited 2019 May 20]. Available from: http://hdl.handle.net/10217/183921.

Council of Science Editors:

Chaturvedi M. Parametric classification of directed acyclic graphs, A. [Masters Thesis]. Colorado State University; 2017. Available from: http://hdl.handle.net/10217/183921


Cal Poly

4. Lovelace, April L. On the Complexity of Scheduling University Courses.

Degree: MS, Computer Science, 2010, Cal Poly

 It has often been said that the problem of creating timetables for scheduling university courses is hard, even as hard as solving an NP-Complete problem.… (more)

Subjects/Keywords: Theory and Algorithms

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Lovelace, A. L. (2010). On the Complexity of Scheduling University Courses. (Masters Thesis). Cal Poly. Retrieved from https://digitalcommons.calpoly.edu/theses/245 ; 10.15368/theses.2010.16

Chicago Manual of Style (16th Edition):

Lovelace, April L. “On the Complexity of Scheduling University Courses.” 2010. Masters Thesis, Cal Poly. Accessed May 20, 2019. https://digitalcommons.calpoly.edu/theses/245 ; 10.15368/theses.2010.16.

MLA Handbook (7th Edition):

Lovelace, April L. “On the Complexity of Scheduling University Courses.” 2010. Web. 20 May 2019.

Vancouver:

Lovelace AL. On the Complexity of Scheduling University Courses. [Internet] [Masters thesis]. Cal Poly; 2010. [cited 2019 May 20]. Available from: https://digitalcommons.calpoly.edu/theses/245 ; 10.15368/theses.2010.16.

Council of Science Editors:

Lovelace AL. On the Complexity of Scheduling University Courses. [Masters Thesis]. Cal Poly; 2010. Available from: https://digitalcommons.calpoly.edu/theses/245 ; 10.15368/theses.2010.16


University of Colorado

5. 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 http://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 May 20, 2019. http://scholar.colorado.edu/csci_gradetds/18.

MLA Handbook (7th Edition):

Nelson, Thomas Harrison. “Genetic Algorithms with Chaotic Population Dynamics.” 2010. Web. 20 May 2019.

Vancouver:

Nelson TH. Genetic Algorithms with Chaotic Population Dynamics. [Internet] [Masters thesis]. University of Colorado; 2010. [cited 2019 May 20]. Available from: http://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: http://scholar.colorado.edu/csci_gradetds/18


Ryerson University

6. 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 May 20, 2019. 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. 20 May 2019.

Vancouver:

Patel S. Clique Listing Algorithms and Characteristics of Cliques in Random Graphics. [Internet] [Thesis]. Ryerson University; 2010. [cited 2019 May 20]. 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 Nevada – Las Vegas

7. Koganti, Reshma. Detours admitting short paths.

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

  Finding shortest paths between two vertices in a weighted graph is a well explored problem and several efficient algorithms for solving it have been… (more)

Subjects/Keywords: Computer algorithms; Graph algorithms; Graph theory

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Koganti, R. (2010). Detours admitting short paths. (Masters Thesis). University of Nevada – Las Vegas. Retrieved from https://digitalscholarship.unlv.edu/thesesdissertations/888

Chicago Manual of Style (16th Edition):

Koganti, Reshma. “Detours admitting short paths.” 2010. Masters Thesis, University of Nevada – Las Vegas. Accessed May 20, 2019. https://digitalscholarship.unlv.edu/thesesdissertations/888.

MLA Handbook (7th Edition):

Koganti, Reshma. “Detours admitting short paths.” 2010. Web. 20 May 2019.

Vancouver:

Koganti R. Detours admitting short paths. [Internet] [Masters thesis]. University of Nevada – Las Vegas; 2010. [cited 2019 May 20]. Available from: https://digitalscholarship.unlv.edu/thesesdissertations/888.

Council of Science Editors:

Koganti R. Detours admitting short paths. [Masters Thesis]. University of Nevada – Las Vegas; 2010. Available from: https://digitalscholarship.unlv.edu/thesesdissertations/888


Hong Kong University of Science and Technology

8. 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 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 May 20, 2019. 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. 20 May 2019.

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 2019 May 20]. Available from: 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: 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

9. 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 http://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 May 20, 2019. http://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. 20 May 2019.

Vancouver:

Ireland FL. GPU accelerated risk quantification. [Internet] [Thesis]. Eastern Washington University; 2018. [cited 2019 May 20]. Available from: http://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: http://dc.ewu.edu/theses/497

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


Rutgers University

10. 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 May 20, 2019. 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. 20 May 2019.

Vancouver:

Kuksa, Pavel 1. Scalable kernel methods and algorithms for general sequence analysis. [Internet] [Doctoral dissertation]. Rutgers University; 2011. [cited 2019 May 20]. 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


Georgia Tech

11. Yazdanbod, Sadra. Combinatorial and exchange markets: Algorithms, complexity, and applications.

Degree: PhD, Computer Science, 2018, Georgia Tech

 In today's world, globalization and the Internet have resulted in the creation of enormously many different kinds of marketplaces. The marketplaces naturally tend to find… (more)

Subjects/Keywords: Game theory; Market algorithms; Equilibrium

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Yazdanbod, S. (2018). Combinatorial and exchange markets: Algorithms, complexity, and applications. (Doctoral Dissertation). Georgia Tech. Retrieved from http://hdl.handle.net/1853/60221

Chicago Manual of Style (16th Edition):

Yazdanbod, Sadra. “Combinatorial and exchange markets: Algorithms, complexity, and applications.” 2018. Doctoral Dissertation, Georgia Tech. Accessed May 20, 2019. http://hdl.handle.net/1853/60221.

MLA Handbook (7th Edition):

Yazdanbod, Sadra. “Combinatorial and exchange markets: Algorithms, complexity, and applications.” 2018. Web. 20 May 2019.

Vancouver:

Yazdanbod S. Combinatorial and exchange markets: Algorithms, complexity, and applications. [Internet] [Doctoral dissertation]. Georgia Tech; 2018. [cited 2019 May 20]. Available from: http://hdl.handle.net/1853/60221.

Council of Science Editors:

Yazdanbod S. Combinatorial and exchange markets: Algorithms, complexity, and applications. [Doctoral Dissertation]. Georgia Tech; 2018. Available from: http://hdl.handle.net/1853/60221


University of Illinois – Urbana-Champaign

12. 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 May 20, 2019. 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. 20 May 2019.

Vancouver:

Doan TT. On the performance of distributed algorithms for network optimization problems. [Internet] [Doctoral dissertation]. University of Illinois – Urbana-Champaign; 2018. [cited 2019 May 20]. 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


Brock University

13. Li, Yifeng. Properties and algorithms of the (n, k)-arrangement graphs .

Degree: Department of Computer Science, 2010, Brock University

 The (n, k)-arrangement interconnection topology was first introduced in 1992. The (n, k )-arrangement graph is a class of generalized star graphs. Compared with the… (more)

Subjects/Keywords: Topological graph theory.; Computer algorithms.

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Li, Y. (2010). Properties and algorithms of the (n, k)-arrangement graphs . (Thesis). Brock University. Retrieved from http://hdl.handle.net/10464/2950

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, Yifeng. “Properties and algorithms of the (n, k)-arrangement graphs .” 2010. Thesis, Brock University. Accessed May 20, 2019. http://hdl.handle.net/10464/2950.

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

MLA Handbook (7th Edition):

Li, Yifeng. “Properties and algorithms of the (n, k)-arrangement graphs .” 2010. Web. 20 May 2019.

Vancouver:

Li Y. Properties and algorithms of the (n, k)-arrangement graphs . [Internet] [Thesis]. Brock University; 2010. [cited 2019 May 20]. Available from: http://hdl.handle.net/10464/2950.

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

Council of Science Editors:

Li Y. Properties and algorithms of the (n, k)-arrangement graphs . [Thesis]. Brock University; 2010. Available from: http://hdl.handle.net/10464/2950

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


University of Nevada – Las Vegas

14. 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 May 20, 2019. https://digitalscholarship.unlv.edu/thesesdissertations/945.

MLA Handbook (7th Edition):

Andro-Vasko, James. “Shop problems in scheduling.” 2011. Web. 20 May 2019.

Vancouver:

Andro-Vasko J. Shop problems in scheduling. [Internet] [Masters thesis]. University of Nevada – Las Vegas; 2011. [cited 2019 May 20]. 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


McMaster University

15. Weng, Chia-Chun. Implementing Efficient Algorithms for Computing Runs.

Degree: MSc, 2011, McMaster University

In the first part of this thesis we present a C++ implementation of an improved O(n log n) algorithm to compute runs, number of… (more)

Subjects/Keywords: run; repetition; periodicity; string; Theory and Algorithms; Theory and Algorithms

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Weng, C. (2011). Implementing Efficient Algorithms for Computing Runs. (Masters Thesis). McMaster University. Retrieved from http://hdl.handle.net/11375/11286

Chicago Manual of Style (16th Edition):

Weng, Chia-Chun. “Implementing Efficient Algorithms for Computing Runs.” 2011. Masters Thesis, McMaster University. Accessed May 20, 2019. http://hdl.handle.net/11375/11286.

MLA Handbook (7th Edition):

Weng, Chia-Chun. “Implementing Efficient Algorithms for Computing Runs.” 2011. Web. 20 May 2019.

Vancouver:

Weng C. Implementing Efficient Algorithms for Computing Runs. [Internet] [Masters thesis]. McMaster University; 2011. [cited 2019 May 20]. Available from: http://hdl.handle.net/11375/11286.

Council of Science Editors:

Weng C. Implementing Efficient Algorithms for Computing Runs. [Masters Thesis]. McMaster University; 2011. Available from: http://hdl.handle.net/11375/11286


University of Stirling

16. Neumann, Geoffrey K. TEDA: A Targeted Estimation of Distribution Algorithm.

Degree: PhD, School of Natural Sciences, 2014, University of Stirling

 This thesis discusses the development and performance of a novel evolutionary algorithm, the Targeted Estimation of Distribution Algorithm (TEDA). TEDA takes the concept of targeting,… (more)

Subjects/Keywords: Evolutionary Algorithms; Genetic Algorithms; Estimation of Distribution Algorithms; Targeting; TEDA; FDC; Distribution (Probability theory); Genetic algorithms; Algorithms

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Neumann, G. K. (2014). TEDA: A Targeted Estimation of Distribution Algorithm. (Doctoral Dissertation). University of Stirling. Retrieved from http://hdl.handle.net/1893/20248

Chicago Manual of Style (16th Edition):

Neumann, Geoffrey K. “TEDA: A Targeted Estimation of Distribution Algorithm.” 2014. Doctoral Dissertation, University of Stirling. Accessed May 20, 2019. http://hdl.handle.net/1893/20248.

MLA Handbook (7th Edition):

Neumann, Geoffrey K. “TEDA: A Targeted Estimation of Distribution Algorithm.” 2014. Web. 20 May 2019.

Vancouver:

Neumann GK. TEDA: A Targeted Estimation of Distribution Algorithm. [Internet] [Doctoral dissertation]. University of Stirling; 2014. [cited 2019 May 20]. Available from: http://hdl.handle.net/1893/20248.

Council of Science Editors:

Neumann GK. TEDA: A Targeted Estimation of Distribution Algorithm. [Doctoral Dissertation]. University of Stirling; 2014. Available from: http://hdl.handle.net/1893/20248

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 May 20, 2019. 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. 20 May 2019.

Vancouver:

Jägersküpper J. Probabilistic analysis of evolution strategies using isotropic mutations. [Internet] [Thesis]. Technische Universität Dortmund; 2006. [cited 2019 May 20]. 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


Northeastern University

18. 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 May 20, 2019. 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. 20 May 2019.

Vancouver:

Roche ST. Robust local algorithms for communication and stability in distributed networks. [Internet] [Doctoral dissertation]. Northeastern University; 2017. [cited 2019 May 20]. 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


Penn State University

19. 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 May 20, 2019. https://etda.libraries.psu.edu/catalog/22793.

MLA Handbook (7th Edition):

Li, Zhenyao. “Greedy Algorithm for approximating maximum induced matching.” 2014. Web. 20 May 2019.

Vancouver:

Li Z. Greedy Algorithm for approximating maximum induced matching. [Internet] [Masters thesis]. Penn State University; 2014. [cited 2019 May 20]. 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

20. 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 May 20, 2019. 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. 20 May 2019.

Vancouver:

Yaroslavtsev G. "efficient Combinatorial Methods in Sparsification, Summarization and Testing of Large Datasets". [Internet] [Doctoral dissertation]. Penn State University; 2013. [cited 2019 May 20]. 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

21. 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 May 20, 2019. 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. 20 May 2019.

Vancouver:

Shelly IL. Algorithm for Premature Ventricular Contraction Detection from a Subcutaneous Electrocardiogram Signal. [Internet] [Masters thesis]. Portland State University; 2016. [cited 2019 May 20]. 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


University of Western Ontario

22. 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 May 20, 2019. 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. 20 May 2019.

Vancouver:

Sun W. Algorithms for Glycan Structure Identification with Tandem Mass Spectrometry. [Internet] [Thesis]. University of Western Ontario; 2016. [cited 2019 May 20]. 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


University of Iowa

23. 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 May 20, 2019. https://ir.uiowa.edu/etd/1152.

MLA Handbook (7th Edition):

Kanade, Gaurav Nandkumar. “Combinatorial optimization problems in geometric settings.” 2011. Web. 20 May 2019.

Vancouver:

Kanade GN. Combinatorial optimization problems in geometric settings. [Internet] [Doctoral dissertation]. University of Iowa; 2011. [cited 2019 May 20]. 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 Technology, Sydney

24. Milton, JE. Analaysis and improvement of genetic algorithms using concepts from information theory.

Degree: 2009, University of Technology, Sydney

 Evolutionary algorithms are based on the principles of biological evolution (Bre- mermann et al., 1966; Fraser, 1957; Box, 1957). Genetic algorithms are a class of… (more)

Subjects/Keywords: Genetic algorithms.; Information theory.; Information density.

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Milton, J. (2009). Analaysis and improvement of genetic algorithms using concepts from information theory. (Thesis). University of Technology, Sydney. Retrieved from http://hdl.handle.net/10453/20252

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

Milton, JE. “Analaysis and improvement of genetic algorithms using concepts from information theory.” 2009. Thesis, University of Technology, Sydney. Accessed May 20, 2019. http://hdl.handle.net/10453/20252.

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

MLA Handbook (7th Edition):

Milton, JE. “Analaysis and improvement of genetic algorithms using concepts from information theory.” 2009. Web. 20 May 2019.

Vancouver:

Milton J. Analaysis and improvement of genetic algorithms using concepts from information theory. [Internet] [Thesis]. University of Technology, Sydney; 2009. [cited 2019 May 20]. Available from: http://hdl.handle.net/10453/20252.

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

Council of Science Editors:

Milton J. Analaysis and improvement of genetic algorithms using concepts from information theory. [Thesis]. University of Technology, Sydney; 2009. Available from: http://hdl.handle.net/10453/20252

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


Cape Peninsula University of Technology

25. 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 May 20, 2019. 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. 20 May 2019.

Vancouver:

Mfoumboulou YD. Development of nonlinear control algorithms for implementation in distributed systems . [Internet] [Thesis]. Cape Peninsula University of Technology; 2014. [cited 2019 May 20]. 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


Georgia Tech

26. Sanders, Daniel Preston. Linear algorithms for graphs of tree-width at most four.

Degree: PhD, Algorithms, Combinatorics, and Optimization, 1993, Georgia Tech

Subjects/Keywords: Graph theory; Algorithms

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Sanders, D. P. (1993). Linear algorithms for graphs of tree-width at most four. (Doctoral Dissertation). Georgia Tech. Retrieved from http://hdl.handle.net/1853/30061

Chicago Manual of Style (16th Edition):

Sanders, Daniel Preston. “Linear algorithms for graphs of tree-width at most four.” 1993. Doctoral Dissertation, Georgia Tech. Accessed May 20, 2019. http://hdl.handle.net/1853/30061.

MLA Handbook (7th Edition):

Sanders, Daniel Preston. “Linear algorithms for graphs of tree-width at most four.” 1993. Web. 20 May 2019.

Vancouver:

Sanders DP. Linear algorithms for graphs of tree-width at most four. [Internet] [Doctoral dissertation]. Georgia Tech; 1993. [cited 2019 May 20]. Available from: http://hdl.handle.net/1853/30061.

Council of Science Editors:

Sanders DP. Linear algorithms for graphs of tree-width at most four. [Doctoral Dissertation]. Georgia Tech; 1993. Available from: http://hdl.handle.net/1853/30061


Hong Kong University of Science and Technology

27. Liu, Lian. Finding shortest gentle paths.

Degree: 2010, Hong Kong University of Science and Technology

 Finding shortest paths is a fundamental operator in spatial databases, which has a wide range of applications to both academia and industry. Although shortest path… (more)

Subjects/Keywords: Paths and cycles (Graph theory); Algorithms

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Liu, L. (2010). Finding shortest gentle paths. (Thesis). Hong Kong University of Science and Technology. Retrieved from https://doi.org/10.14711/thesis-b1115261 ; http://repository.ust.hk/ir/bitstream/1783.1-6950/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):

Liu, Lian. “Finding shortest gentle paths.” 2010. Thesis, Hong Kong University of Science and Technology. Accessed May 20, 2019. https://doi.org/10.14711/thesis-b1115261 ; http://repository.ust.hk/ir/bitstream/1783.1-6950/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):

Liu, Lian. “Finding shortest gentle paths.” 2010. Web. 20 May 2019.

Vancouver:

Liu L. Finding shortest gentle paths. [Internet] [Thesis]. Hong Kong University of Science and Technology; 2010. [cited 2019 May 20]. Available from: https://doi.org/10.14711/thesis-b1115261 ; http://repository.ust.hk/ir/bitstream/1783.1-6950/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:

Liu L. Finding shortest gentle paths. [Thesis]. Hong Kong University of Science and Technology; 2010. Available from: https://doi.org/10.14711/thesis-b1115261 ; http://repository.ust.hk/ir/bitstream/1783.1-6950/1/th_redirect.html

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


Hong Kong University of Science and Technology

28. Chen, Junting. Design and analysis of iterative algorithms via nonlinear control theory.

Degree: 2015, Hong Kong University of Science and Technology

 Efficient resource allocation plays a critical role in wireless communication systems. Many resource allocation problems can be formulated into constrained optimization problems, and when the… (more)

Subjects/Keywords: Nonlinear control theory; Iterative methods (Mathematics); Algorithms

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Chen, J. (2015). Design and analysis of iterative algorithms via nonlinear control theory. (Thesis). Hong Kong University of Science and Technology. Retrieved from https://doi.org/10.14711/thesis-b1449468 ; http://repository.ust.hk/ir/bitstream/1783.1-76119/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):

Chen, Junting. “Design and analysis of iterative algorithms via nonlinear control theory.” 2015. Thesis, Hong Kong University of Science and Technology. Accessed May 20, 2019. https://doi.org/10.14711/thesis-b1449468 ; http://repository.ust.hk/ir/bitstream/1783.1-76119/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):

Chen, Junting. “Design and analysis of iterative algorithms via nonlinear control theory.” 2015. Web. 20 May 2019.

Vancouver:

Chen J. Design and analysis of iterative algorithms via nonlinear control theory. [Internet] [Thesis]. Hong Kong University of Science and Technology; 2015. [cited 2019 May 20]. Available from: https://doi.org/10.14711/thesis-b1449468 ; http://repository.ust.hk/ir/bitstream/1783.1-76119/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:

Chen J. Design and analysis of iterative algorithms via nonlinear control theory. [Thesis]. Hong Kong University of Science and Technology; 2015. Available from: https://doi.org/10.14711/thesis-b1449468 ; http://repository.ust.hk/ir/bitstream/1783.1-76119/1/th_redirect.html

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


Hong Kong University of Science and Technology

29. Wen, Xing. Algorithm and hardware co-design for video processing applications.

Degree: 2011, Hong Kong University of Science and Technology

 Many commercial applications use dedicated hardware such as ASIC to allow efficient and low power implementation of the solution. In the design process, the software… (more)

Subjects/Keywords: Video compression; Coding theory; Computer algorithms

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Wen, X. (2011). Algorithm and hardware co-design for video processing applications. (Thesis). Hong Kong University of Science and Technology. Retrieved from https://doi.org/10.14711/thesis-b1158389 ; http://repository.ust.hk/ir/bitstream/1783.1-7267/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):

Wen, Xing. “Algorithm and hardware co-design for video processing applications.” 2011. Thesis, Hong Kong University of Science and Technology. Accessed May 20, 2019. https://doi.org/10.14711/thesis-b1158389 ; http://repository.ust.hk/ir/bitstream/1783.1-7267/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):

Wen, Xing. “Algorithm and hardware co-design for video processing applications.” 2011. Web. 20 May 2019.

Vancouver:

Wen X. Algorithm and hardware co-design for video processing applications. [Internet] [Thesis]. Hong Kong University of Science and Technology; 2011. [cited 2019 May 20]. Available from: https://doi.org/10.14711/thesis-b1158389 ; http://repository.ust.hk/ir/bitstream/1783.1-7267/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:

Wen X. Algorithm and hardware co-design for video processing applications. [Thesis]. Hong Kong University of Science and Technology; 2011. Available from: https://doi.org/10.14711/thesis-b1158389 ; http://repository.ust.hk/ir/bitstream/1783.1-7267/1/th_redirect.html

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

30. 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 May 20, 2019. 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. 20 May 2019.

Vancouver:

Stamm KD. Gene Set Enrichment and Projection: A Computational Tool for Knowledge Discovery in Transcriptomes. [Internet] [Thesis]. Marquette University; 2016. [cited 2019 May 20]. 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

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

.