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:(Computer algorithms). Showing records 1 – 30 of 2178 total matches.

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

Search Limiters

Last 2 Years | English Only

Levels

Languages

Country

▼ Search Limiters


Nelson Mandela Metropolitan University

1. Kapp, Konrad Phillip. Optimal cycle dating of large financial time series.

Degree: Faculty of Science, 2017, Nelson Mandela Metropolitan University

 The study of cycles in the context of economic time series has been active for many decades, if not centuries; however, it was only in… (more)

Subjects/Keywords: Computer algorithms

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Kapp, K. P. (2017). Optimal cycle dating of large financial time series. (Thesis). Nelson Mandela Metropolitan University. Retrieved from http://hdl.handle.net/10948/17767

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

Kapp, Konrad Phillip. “Optimal cycle dating of large financial time series.” 2017. Thesis, Nelson Mandela Metropolitan University. Accessed September 24, 2020. http://hdl.handle.net/10948/17767.

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

MLA Handbook (7th Edition):

Kapp, Konrad Phillip. “Optimal cycle dating of large financial time series.” 2017. Web. 24 Sep 2020.

Vancouver:

Kapp KP. Optimal cycle dating of large financial time series. [Internet] [Thesis]. Nelson Mandela Metropolitan University; 2017. [cited 2020 Sep 24]. Available from: http://hdl.handle.net/10948/17767.

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

Council of Science Editors:

Kapp KP. Optimal cycle dating of large financial time series. [Thesis]. Nelson Mandela Metropolitan University; 2017. Available from: http://hdl.handle.net/10948/17767

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


University of Oklahoma

2. Li, Yu-Hsin. FINDING MINIMUM GAPS AND DESIGNING KEY DERIVATION FUNCTIONS.

Degree: PhD, 2011, University of Oklahoma

 Key generation is an important part of symmetric-key encryption algorithms, such as AES. A key derivation function can be used to generate symmetric cipher session… (more)

Subjects/Keywords: Cryptography; Computer algorithms

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Li, Y. (2011). FINDING MINIMUM GAPS AND DESIGNING KEY DERIVATION FUNCTIONS. (Doctoral Dissertation). University of Oklahoma. Retrieved from http://hdl.handle.net/11244/319191

Chicago Manual of Style (16th Edition):

Li, Yu-Hsin. “FINDING MINIMUM GAPS AND DESIGNING KEY DERIVATION FUNCTIONS.” 2011. Doctoral Dissertation, University of Oklahoma. Accessed September 24, 2020. http://hdl.handle.net/11244/319191.

MLA Handbook (7th Edition):

Li, Yu-Hsin. “FINDING MINIMUM GAPS AND DESIGNING KEY DERIVATION FUNCTIONS.” 2011. Web. 24 Sep 2020.

Vancouver:

Li Y. FINDING MINIMUM GAPS AND DESIGNING KEY DERIVATION FUNCTIONS. [Internet] [Doctoral dissertation]. University of Oklahoma; 2011. [cited 2020 Sep 24]. Available from: http://hdl.handle.net/11244/319191.

Council of Science Editors:

Li Y. FINDING MINIMUM GAPS AND DESIGNING KEY DERIVATION FUNCTIONS. [Doctoral Dissertation]. University of Oklahoma; 2011. Available from: http://hdl.handle.net/11244/319191


UCLA

3. Roytman, Alan James. Making Decisions Under Uncertainty for Large Data Domains.

Degree: Computer Science, 2014, UCLA

 In this thesis, we study key questions that touch upon many important problems in practice which are data-intensive. How can we process this influx of… (more)

Subjects/Keywords: Computer science; Online Algorithms; Streaming Algorithms

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Roytman, A. J. (2014). Making Decisions Under Uncertainty for Large Data Domains. (Thesis). UCLA. Retrieved from http://www.escholarship.org/uc/item/0x16r1xv

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

Roytman, Alan James. “Making Decisions Under Uncertainty for Large Data Domains.” 2014. Thesis, UCLA. Accessed September 24, 2020. http://www.escholarship.org/uc/item/0x16r1xv.

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

MLA Handbook (7th Edition):

Roytman, Alan James. “Making Decisions Under Uncertainty for Large Data Domains.” 2014. Web. 24 Sep 2020.

Vancouver:

Roytman AJ. Making Decisions Under Uncertainty for Large Data Domains. [Internet] [Thesis]. UCLA; 2014. [cited 2020 Sep 24]. Available from: http://www.escholarship.org/uc/item/0x16r1xv.

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

Council of Science Editors:

Roytman AJ. Making Decisions Under Uncertainty for Large Data Domains. [Thesis]. UCLA; 2014. Available from: http://www.escholarship.org/uc/item/0x16r1xv

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

4. Zhao, Yan. Accelerating betweenness centrality computation on heterogeneous processors.

Degree: 2014, Hong Kong University of Science and Technology

 The betweenness centrality (BC) measure of nodes in a graph is widely used in graph analysis. As both multicore CPUs and manycore GPUs are becoming… (more)

Subjects/Keywords: Graphics processing units ; Computer algorithms ; Parallel algorithms

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Zhao, Y. (2014). Accelerating betweenness centrality computation on heterogeneous processors. (Thesis). Hong Kong University of Science and Technology. Retrieved from http://repository.ust.hk/ir/Record/1783.1-70599 ; https://doi.org/10.14711/thesis-b1301512 ; http://repository.ust.hk/ir/bitstream/1783.1-70599/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):

Zhao, Yan. “Accelerating betweenness centrality computation on heterogeneous processors.” 2014. Thesis, Hong Kong University of Science and Technology. Accessed September 24, 2020. http://repository.ust.hk/ir/Record/1783.1-70599 ; https://doi.org/10.14711/thesis-b1301512 ; http://repository.ust.hk/ir/bitstream/1783.1-70599/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):

Zhao, Yan. “Accelerating betweenness centrality computation on heterogeneous processors.” 2014. Web. 24 Sep 2020.

Vancouver:

Zhao Y. Accelerating betweenness centrality computation on heterogeneous processors. [Internet] [Thesis]. Hong Kong University of Science and Technology; 2014. [cited 2020 Sep 24]. Available from: http://repository.ust.hk/ir/Record/1783.1-70599 ; https://doi.org/10.14711/thesis-b1301512 ; http://repository.ust.hk/ir/bitstream/1783.1-70599/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:

Zhao Y. Accelerating betweenness centrality computation on heterogeneous processors. [Thesis]. Hong Kong University of Science and Technology; 2014. Available from: http://repository.ust.hk/ir/Record/1783.1-70599 ; https://doi.org/10.14711/thesis-b1301512 ; http://repository.ust.hk/ir/bitstream/1783.1-70599/1/th_redirect.html

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


Penn State University

5. Dixit, Kashyap. Robust Models For Property Testing.

Degree: 2015, Penn State University

 Property testing [Rubinfeld Sudan 96,Goldreich Goldwasser Ron 98] is a formal framework for studying approximate sublinear time randomized algorithms for decision problems. These algorithms have… (more)

Subjects/Keywords: Property Testing; Sublinear Algorithms; Randomized Algorithms; Approximation Algorithms; Theoretical Computer Science

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Dixit, K. (2015). Robust Models For Property Testing. (Thesis). Penn State University. Retrieved from https://submit-etda.libraries.psu.edu/catalog/27153

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

Dixit, Kashyap. “Robust Models For Property Testing.” 2015. Thesis, Penn State University. Accessed September 24, 2020. https://submit-etda.libraries.psu.edu/catalog/27153.

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

MLA Handbook (7th Edition):

Dixit, Kashyap. “Robust Models For Property Testing.” 2015. Web. 24 Sep 2020.

Vancouver:

Dixit K. Robust Models For Property Testing. [Internet] [Thesis]. Penn State University; 2015. [cited 2020 Sep 24]. Available from: https://submit-etda.libraries.psu.edu/catalog/27153.

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

Council of Science Editors:

Dixit K. Robust Models For Property Testing. [Thesis]. Penn State University; 2015. Available from: https://submit-etda.libraries.psu.edu/catalog/27153

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


University of Waterloo

6. McAulay, Caelyn Burnham. The Incremental Constraint of k-Server.

Degree: 2012, University of Waterloo

 Online algorithms are characterized by operating on an input sequence revealed over time versus a single static input. Instead of generating a single solution, they… (more)

Subjects/Keywords: computer science; algorithms; online algorithms; k-server; incremental algorithms

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

McAulay, C. B. (2012). The Incremental Constraint of k-Server. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/6758

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

McAulay, Caelyn Burnham. “The Incremental Constraint of k-Server.” 2012. Thesis, University of Waterloo. Accessed September 24, 2020. http://hdl.handle.net/10012/6758.

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

MLA Handbook (7th Edition):

McAulay, Caelyn Burnham. “The Incremental Constraint of k-Server.” 2012. Web. 24 Sep 2020.

Vancouver:

McAulay CB. The Incremental Constraint of k-Server. [Internet] [Thesis]. University of Waterloo; 2012. [cited 2020 Sep 24]. Available from: http://hdl.handle.net/10012/6758.

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

Council of Science Editors:

McAulay CB. The Incremental Constraint of k-Server. [Thesis]. University of Waterloo; 2012. Available from: http://hdl.handle.net/10012/6758

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


University of Hong Kong

7. 譚小龍. Linear-size indexes for approximate pattern matching and dictionary matching.

Degree: 2010, University of Hong Kong

Subjects/Keywords: Computer algorithms.

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

譚小龍. (2010). Linear-size indexes for approximate pattern matching and dictionary matching. (Thesis). University of Hong Kong. Retrieved from http://hdl.handle.net/10722/65311

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

Chicago Manual of Style (16th Edition):

譚小龍. “Linear-size indexes for approximate pattern matching and dictionary matching.” 2010. Thesis, University of Hong Kong. Accessed September 24, 2020. http://hdl.handle.net/10722/65311.

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

MLA Handbook (7th Edition):

譚小龍. “Linear-size indexes for approximate pattern matching and dictionary matching.” 2010. Web. 24 Sep 2020.

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

Vancouver:

譚小龍. Linear-size indexes for approximate pattern matching and dictionary matching. [Internet] [Thesis]. University of Hong Kong; 2010. [cited 2020 Sep 24]. Available from: http://hdl.handle.net/10722/65311.

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

Council of Science Editors:

譚小龍. Linear-size indexes for approximate pattern matching and dictionary matching. [Thesis]. University of Hong Kong; 2010. Available from: http://hdl.handle.net/10722/65311

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


University of Hong Kong

8. 霍志偉. Better algorithms for comparing trees.

Degree: 2010, University of Hong Kong

Subjects/Keywords: Computer algorithms

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

霍志偉.. (2010). Better algorithms for comparing trees. (Thesis). University of Hong Kong. Retrieved from http://hdl.handle.net/10722/128699

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

Chicago Manual of Style (16th Edition):

霍志偉.. “Better algorithms for comparing trees.” 2010. Thesis, University of Hong Kong. Accessed September 24, 2020. http://hdl.handle.net/10722/128699.

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

MLA Handbook (7th Edition):

霍志偉.. “Better algorithms for comparing trees.” 2010. Web. 24 Sep 2020.

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

Vancouver:

霍志偉.. Better algorithms for comparing trees. [Internet] [Thesis]. University of Hong Kong; 2010. [cited 2020 Sep 24]. Available from: http://hdl.handle.net/10722/128699.

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

Council of Science Editors:

霍志偉.. Better algorithms for comparing trees. [Thesis]. University of Hong Kong; 2010. Available from: http://hdl.handle.net/10722/128699

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

9. Mani, K. Evolution of unified framework for run time optimization and security enhancement in cryptographic algorithms; -.

Degree: Computer Science, 2012, Bharathidasan University

With the rapid usage of data communication, security is becoming a more crucial issue. The fundamental requirements for security include authentication, confidentiality, integrity, and non-repudiation.… (more)

Subjects/Keywords: Computer Science; Cryptography; Algorithms

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Mani, K. (2012). Evolution of unified framework for run time optimization and security enhancement in cryptographic algorithms; -. (Thesis). Bharathidasan University. Retrieved from http://shodhganga.inflibnet.ac.in/handle/10603/9531

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

Mani, K. “Evolution of unified framework for run time optimization and security enhancement in cryptographic algorithms; -.” 2012. Thesis, Bharathidasan University. Accessed September 24, 2020. http://shodhganga.inflibnet.ac.in/handle/10603/9531.

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

MLA Handbook (7th Edition):

Mani, K. “Evolution of unified framework for run time optimization and security enhancement in cryptographic algorithms; -.” 2012. Web. 24 Sep 2020.

Vancouver:

Mani K. Evolution of unified framework for run time optimization and security enhancement in cryptographic algorithms; -. [Internet] [Thesis]. Bharathidasan University; 2012. [cited 2020 Sep 24]. Available from: http://shodhganga.inflibnet.ac.in/handle/10603/9531.

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

Council of Science Editors:

Mani K. Evolution of unified framework for run time optimization and security enhancement in cryptographic algorithms; -. [Thesis]. Bharathidasan University; 2012. Available from: http://shodhganga.inflibnet.ac.in/handle/10603/9531

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


Texas A&M University

10. Brammer, Grant. Algorithms for Searching and Analyzing Sets of Evolutionary Trees.

Degree: PhD, Computer Science and Engineering, 2014, Texas A&M University

 The evolutionary relationships between organisms are represented as phylogenetic trees. These trees have important implications for understanding biodiversity, tracking disease, and designing medicine. Since the… (more)

Subjects/Keywords: computer science; phylogenetics; query; algorithms

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Brammer, G. (2014). Algorithms for Searching and Analyzing Sets of Evolutionary Trees. (Doctoral Dissertation). Texas A&M University. Retrieved from http://hdl.handle.net/1969.1/152770

Chicago Manual of Style (16th Edition):

Brammer, Grant. “Algorithms for Searching and Analyzing Sets of Evolutionary Trees.” 2014. Doctoral Dissertation, Texas A&M University. Accessed September 24, 2020. http://hdl.handle.net/1969.1/152770.

MLA Handbook (7th Edition):

Brammer, Grant. “Algorithms for Searching and Analyzing Sets of Evolutionary Trees.” 2014. Web. 24 Sep 2020.

Vancouver:

Brammer G. Algorithms for Searching and Analyzing Sets of Evolutionary Trees. [Internet] [Doctoral dissertation]. Texas A&M University; 2014. [cited 2020 Sep 24]. Available from: http://hdl.handle.net/1969.1/152770.

Council of Science Editors:

Brammer G. Algorithms for Searching and Analyzing Sets of Evolutionary Trees. [Doctoral Dissertation]. Texas A&M University; 2014. Available from: http://hdl.handle.net/1969.1/152770


University of KwaZulu-Natal

11. Obagbuwa, Ibidun Christiana. Improved roach-based algorithms for global optimization problems.

Degree: Computer science, 2014, University of KwaZulu-Natal

 Optimization of systems plays an important role in various fields including mathematics, economics, engineering and life sciences. A lot of real world optimization problems exist… (more)

Subjects/Keywords: Computer science.; Roach-based algorithms.

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Obagbuwa, I. C. (2014). Improved roach-based algorithms for global optimization problems. (Thesis). University of KwaZulu-Natal. Retrieved from http://hdl.handle.net/10413/12896

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

Obagbuwa, Ibidun Christiana. “Improved roach-based algorithms for global optimization problems.” 2014. Thesis, University of KwaZulu-Natal. Accessed September 24, 2020. http://hdl.handle.net/10413/12896.

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

MLA Handbook (7th Edition):

Obagbuwa, Ibidun Christiana. “Improved roach-based algorithms for global optimization problems.” 2014. Web. 24 Sep 2020.

Vancouver:

Obagbuwa IC. Improved roach-based algorithms for global optimization problems. [Internet] [Thesis]. University of KwaZulu-Natal; 2014. [cited 2020 Sep 24]. Available from: http://hdl.handle.net/10413/12896.

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

Council of Science Editors:

Obagbuwa IC. Improved roach-based algorithms for global optimization problems. [Thesis]. University of KwaZulu-Natal; 2014. Available from: http://hdl.handle.net/10413/12896

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


University of Johannesburg

12. Leenen, Louise. Contributions towards an implementation of a branch-and-cut algorithm for the travelling salesman problem.

Degree: 2014, University of Johannesburg

M.Sc. (Computer Science)

The STSP (symmetric travelling salesman problem) involves finding the cheapest tour through a number of cities. It is a difficult problem and… (more)

Subjects/Keywords: Computer algorithms; Traveling-salesman problem

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Leenen, L. (2014). Contributions towards an implementation of a branch-and-cut algorithm for the travelling salesman problem. (Thesis). University of Johannesburg. Retrieved from http://hdl.handle.net/10210/12237

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

Leenen, Louise. “Contributions towards an implementation of a branch-and-cut algorithm for the travelling salesman problem.” 2014. Thesis, University of Johannesburg. Accessed September 24, 2020. http://hdl.handle.net/10210/12237.

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

MLA Handbook (7th Edition):

Leenen, Louise. “Contributions towards an implementation of a branch-and-cut algorithm for the travelling salesman problem.” 2014. Web. 24 Sep 2020.

Vancouver:

Leenen L. Contributions towards an implementation of a branch-and-cut algorithm for the travelling salesman problem. [Internet] [Thesis]. University of Johannesburg; 2014. [cited 2020 Sep 24]. Available from: http://hdl.handle.net/10210/12237.

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

Council of Science Editors:

Leenen L. Contributions towards an implementation of a branch-and-cut algorithm for the travelling salesman problem. [Thesis]. University of Johannesburg; 2014. Available from: http://hdl.handle.net/10210/12237

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


University of Johannesburg

13. Geldenhuys, Christel Erna. An implementation of a branch-and-cut algorithm for the travelling salesman problem.

Degree: 2012, University of Johannesburg

M.Sc. (Computer Science)

The Travelling Salesman Problem (TSP) comprises the following: A salesman is required, by definition of his job description, to visit a set… (more)

Subjects/Keywords: Traveling-salesman problem; Computer algorithms

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Geldenhuys, C. E. (2012). An implementation of a branch-and-cut algorithm for the travelling salesman problem. (Thesis). University of Johannesburg. Retrieved from http://hdl.handle.net/10210/7337

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

Geldenhuys, Christel Erna. “An implementation of a branch-and-cut algorithm for the travelling salesman problem.” 2012. Thesis, University of Johannesburg. Accessed September 24, 2020. http://hdl.handle.net/10210/7337.

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

MLA Handbook (7th Edition):

Geldenhuys, Christel Erna. “An implementation of a branch-and-cut algorithm for the travelling salesman problem.” 2012. Web. 24 Sep 2020.

Vancouver:

Geldenhuys CE. An implementation of a branch-and-cut algorithm for the travelling salesman problem. [Internet] [Thesis]. University of Johannesburg; 2012. [cited 2020 Sep 24]. Available from: http://hdl.handle.net/10210/7337.

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

Council of Science Editors:

Geldenhuys CE. An implementation of a branch-and-cut algorithm for the travelling salesman problem. [Thesis]. University of Johannesburg; 2012. Available from: http://hdl.handle.net/10210/7337

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


RMIT University

14. Bird, S. Adaptive techniques for enhancing the robustness and performance of speciated PSOs in multimodal environments.

Degree: 2008, RMIT University

 This thesis proposes several new techniques to improve the performance of speciated particle swarms in multimodal environments. We investigate how these algorithms can become more… (more)

Subjects/Keywords: Fields of Research; Computer algorithms

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Bird, S. (2008). Adaptive techniques for enhancing the robustness and performance of speciated PSOs in multimodal environments. (Thesis). RMIT University. Retrieved from http://researchbank.rmit.edu.au/view/rmit:6619

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

Bird, S. “Adaptive techniques for enhancing the robustness and performance of speciated PSOs in multimodal environments.” 2008. Thesis, RMIT University. Accessed September 24, 2020. http://researchbank.rmit.edu.au/view/rmit:6619.

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

MLA Handbook (7th Edition):

Bird, S. “Adaptive techniques for enhancing the robustness and performance of speciated PSOs in multimodal environments.” 2008. Web. 24 Sep 2020.

Vancouver:

Bird S. Adaptive techniques for enhancing the robustness and performance of speciated PSOs in multimodal environments. [Internet] [Thesis]. RMIT University; 2008. [cited 2020 Sep 24]. Available from: http://researchbank.rmit.edu.au/view/rmit:6619.

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

Council of Science Editors:

Bird S. Adaptive techniques for enhancing the robustness and performance of speciated PSOs in multimodal environments. [Thesis]. RMIT University; 2008. Available from: http://researchbank.rmit.edu.au/view/rmit:6619

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


Oregon State University

15. Amoth, Thomas R. Exact learning of tree patterns.

Degree: PhD, Computer Science, 2001, Oregon State University

 Tree patterns are natural candidates for representing rules and hypotheses in many tasks such as information extraction and symbolic mathematics. A tree pattern is a… (more)

Subjects/Keywords: Computer algorithms

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Amoth, T. R. (2001). Exact learning of tree patterns. (Doctoral Dissertation). Oregon State University. Retrieved from http://hdl.handle.net/1957/11820

Chicago Manual of Style (16th Edition):

Amoth, Thomas R. “Exact learning of tree patterns.” 2001. Doctoral Dissertation, Oregon State University. Accessed September 24, 2020. http://hdl.handle.net/1957/11820.

MLA Handbook (7th Edition):

Amoth, Thomas R. “Exact learning of tree patterns.” 2001. Web. 24 Sep 2020.

Vancouver:

Amoth TR. Exact learning of tree patterns. [Internet] [Doctoral dissertation]. Oregon State University; 2001. [cited 2020 Sep 24]. Available from: http://hdl.handle.net/1957/11820.

Council of Science Editors:

Amoth TR. Exact learning of tree patterns. [Doctoral Dissertation]. Oregon State University; 2001. Available from: http://hdl.handle.net/1957/11820


Oregon State University

16. Johnson, Scott Andrew. Rapid hardware implementations of classical modular multiplication.

Degree: MS, Electrical and Computer Engineering, 1995, Oregon State University

 Modular multiplication is a mathematical operation fundamental to the RSA cryptosystern, a public-key cryptosystem with many applications in privacy, security, and authenticity. However, cryptosecurity requires… (more)

Subjects/Keywords: Computer algorithms

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Johnson, S. A. (1995). Rapid hardware implementations of classical modular multiplication. (Masters Thesis). Oregon State University. Retrieved from http://hdl.handle.net/1957/35211

Chicago Manual of Style (16th Edition):

Johnson, Scott Andrew. “Rapid hardware implementations of classical modular multiplication.” 1995. Masters Thesis, Oregon State University. Accessed September 24, 2020. http://hdl.handle.net/1957/35211.

MLA Handbook (7th Edition):

Johnson, Scott Andrew. “Rapid hardware implementations of classical modular multiplication.” 1995. Web. 24 Sep 2020.

Vancouver:

Johnson SA. Rapid hardware implementations of classical modular multiplication. [Internet] [Masters thesis]. Oregon State University; 1995. [cited 2020 Sep 24]. Available from: http://hdl.handle.net/1957/35211.

Council of Science Editors:

Johnson SA. Rapid hardware implementations of classical modular multiplication. [Masters Thesis]. Oregon State University; 1995. Available from: http://hdl.handle.net/1957/35211


Oregon State University

17. Joshi, Varad Vidyadhar. Expert-gate algorithm.

Degree: MS, Computer Science, 1992, Oregon State University

 The goal of Inductive Learning is to produce general rules from a set of seen examples, which can then be applied to other unseen examples.… (more)

Subjects/Keywords: Computer algorithms

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Joshi, V. V. (1992). Expert-gate algorithm. (Masters Thesis). Oregon State University. Retrieved from http://hdl.handle.net/1957/36248

Chicago Manual of Style (16th Edition):

Joshi, Varad Vidyadhar. “Expert-gate algorithm.” 1992. Masters Thesis, Oregon State University. Accessed September 24, 2020. http://hdl.handle.net/1957/36248.

MLA Handbook (7th Edition):

Joshi, Varad Vidyadhar. “Expert-gate algorithm.” 1992. Web. 24 Sep 2020.

Vancouver:

Joshi VV. Expert-gate algorithm. [Internet] [Masters thesis]. Oregon State University; 1992. [cited 2020 Sep 24]. Available from: http://hdl.handle.net/1957/36248.

Council of Science Editors:

Joshi VV. Expert-gate algorithm. [Masters Thesis]. Oregon State University; 1992. Available from: http://hdl.handle.net/1957/36248


University of Delaware

18. Livingston, Kelly. Towards co-designed energy efficient computing and runtimes: simulation-framework and experiments.

Degree: PhD, University of Delaware, Department of Electrical and Computer Engineering, 2015, University of Delaware

 As silicon field effect transistor based computing continues into the twenty-first century, there has been a shift in the design of computational hardware systems. Having… (more)

Subjects/Keywords: Computer systems  – Energy conservation.; Algorithms.

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Livingston, K. (2015). Towards co-designed energy efficient computing and runtimes: simulation-framework and experiments. (Doctoral Dissertation). University of Delaware. Retrieved from http://udspace.udel.edu/handle/19716/17600

Chicago Manual of Style (16th Edition):

Livingston, Kelly. “Towards co-designed energy efficient computing and runtimes: simulation-framework and experiments.” 2015. Doctoral Dissertation, University of Delaware. Accessed September 24, 2020. http://udspace.udel.edu/handle/19716/17600.

MLA Handbook (7th Edition):

Livingston, Kelly. “Towards co-designed energy efficient computing and runtimes: simulation-framework and experiments.” 2015. Web. 24 Sep 2020.

Vancouver:

Livingston K. Towards co-designed energy efficient computing and runtimes: simulation-framework and experiments. [Internet] [Doctoral dissertation]. University of Delaware; 2015. [cited 2020 Sep 24]. Available from: http://udspace.udel.edu/handle/19716/17600.

Council of Science Editors:

Livingston K. Towards co-designed energy efficient computing and runtimes: simulation-framework and experiments. [Doctoral Dissertation]. University of Delaware; 2015. Available from: http://udspace.udel.edu/handle/19716/17600


New Jersey Institute of Technology

19. Wang, Yiran. Matrix completion algorithms with applications in biomedicine, e-commerce and social science.

Degree: MSin Computer Science - (M.S.), Computer Science, 2017, New Jersey Institute of Technology

  This thesis investigates matrix completion algorithms with applications in biomedicine, e-commerce and social science. In general, matrix completion algorithms work well for low rank… (more)

Subjects/Keywords: Matrix completion algorithms; Computer Sciences

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Wang, Y. (2017). Matrix completion algorithms with applications in biomedicine, e-commerce and social science. (Thesis). New Jersey Institute of Technology. Retrieved from https://digitalcommons.njit.edu/theses/37

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

Wang, Yiran. “Matrix completion algorithms with applications in biomedicine, e-commerce and social science.” 2017. Thesis, New Jersey Institute of Technology. Accessed September 24, 2020. https://digitalcommons.njit.edu/theses/37.

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

MLA Handbook (7th Edition):

Wang, Yiran. “Matrix completion algorithms with applications in biomedicine, e-commerce and social science.” 2017. Web. 24 Sep 2020.

Vancouver:

Wang Y. Matrix completion algorithms with applications in biomedicine, e-commerce and social science. [Internet] [Thesis]. New Jersey Institute of Technology; 2017. [cited 2020 Sep 24]. Available from: https://digitalcommons.njit.edu/theses/37.

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

Council of Science Editors:

Wang Y. Matrix completion algorithms with applications in biomedicine, e-commerce and social science. [Thesis]. New Jersey Institute of Technology; 2017. Available from: https://digitalcommons.njit.edu/theses/37

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


Rutgers University

20. 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 September 24, 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. 24 Sep 2020.

Vancouver:

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

21. 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 September 24, 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. 24 Sep 2020.

Vancouver:

Naumovitz TR. Very efficient approximation algorithms to edit distance problems. [Internet] [Doctoral dissertation]. Rutgers University; 2016. [cited 2020 Sep 24]. 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/


University of Houston

22. Sharma, Meenakshi 1984-. NOVEL ALGORITHMS TO ESTIMATE GENOME COVERAGE USING HIGH THROUGHPUT SEQUENCING DATA.

Degree: PhD, Computer Science, 2014, University of Houston

 Genetic variation can occur in the form of single base changes called Single Nucleotide Polymorphisms (SNPs) or large-scale structural alterations called Copy Number Variations (CNVs).… (more)

Subjects/Keywords: Algorithms; Methylation; Bioinformatics; Computer science

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Sharma, M. 1. (2014). NOVEL ALGORITHMS TO ESTIMATE GENOME COVERAGE USING HIGH THROUGHPUT SEQUENCING DATA. (Doctoral Dissertation). University of Houston. Retrieved from http://hdl.handle.net/10657/900

Chicago Manual of Style (16th Edition):

Sharma, Meenakshi 1984-. “NOVEL ALGORITHMS TO ESTIMATE GENOME COVERAGE USING HIGH THROUGHPUT SEQUENCING DATA.” 2014. Doctoral Dissertation, University of Houston. Accessed September 24, 2020. http://hdl.handle.net/10657/900.

MLA Handbook (7th Edition):

Sharma, Meenakshi 1984-. “NOVEL ALGORITHMS TO ESTIMATE GENOME COVERAGE USING HIGH THROUGHPUT SEQUENCING DATA.” 2014. Web. 24 Sep 2020.

Vancouver:

Sharma M1. NOVEL ALGORITHMS TO ESTIMATE GENOME COVERAGE USING HIGH THROUGHPUT SEQUENCING DATA. [Internet] [Doctoral dissertation]. University of Houston; 2014. [cited 2020 Sep 24]. Available from: http://hdl.handle.net/10657/900.

Council of Science Editors:

Sharma M1. NOVEL ALGORITHMS TO ESTIMATE GENOME COVERAGE USING HIGH THROUGHPUT SEQUENCING DATA. [Doctoral Dissertation]. University of Houston; 2014. Available from: http://hdl.handle.net/10657/900


Hong Kong University of Science and Technology

23. Chiu, Man Kwun. Manifold reconstruction from discrete point sets.

Degree: 2013, Hong Kong University of Science and Technology

 In many applications involving datasets in high dimensional spaces, it is often postulated that the data points lie on an unknown manifold of much lower… (more)

Subjects/Keywords: Manifolds (Mathematics) ; Computer algorithms

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Chiu, M. K. (2013). Manifold reconstruction from discrete point sets. (Thesis). Hong Kong University of Science and Technology. Retrieved from http://repository.ust.hk/ir/Record/1783.1-83680 ; https://doi.org/10.14711/thesis-b1274233 ; http://repository.ust.hk/ir/bitstream/1783.1-83680/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):

Chiu, Man Kwun. “Manifold reconstruction from discrete point sets.” 2013. Thesis, Hong Kong University of Science and Technology. Accessed September 24, 2020. http://repository.ust.hk/ir/Record/1783.1-83680 ; https://doi.org/10.14711/thesis-b1274233 ; http://repository.ust.hk/ir/bitstream/1783.1-83680/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):

Chiu, Man Kwun. “Manifold reconstruction from discrete point sets.” 2013. Web. 24 Sep 2020.

Vancouver:

Chiu MK. Manifold reconstruction from discrete point sets. [Internet] [Thesis]. Hong Kong University of Science and Technology; 2013. [cited 2020 Sep 24]. Available from: http://repository.ust.hk/ir/Record/1783.1-83680 ; https://doi.org/10.14711/thesis-b1274233 ; http://repository.ust.hk/ir/bitstream/1783.1-83680/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:

Chiu MK. Manifold reconstruction from discrete point sets. [Thesis]. Hong Kong University of Science and Technology; 2013. Available from: http://repository.ust.hk/ir/Record/1783.1-83680 ; https://doi.org/10.14711/thesis-b1274233 ; http://repository.ust.hk/ir/bitstream/1783.1-83680/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

24. Hu, Xiuwen. Architecture and performance evaluation of high-speed optical and electronic switches.

Degree: 2012, Hong Kong University of Science and Technology

 A switching fabric is a key component in a router. Its performance has a great impact on the overall performance of a router. In this… (more)

Subjects/Keywords: Switching circuits ; Computer algorithms

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Hu, X. (2012). Architecture and performance evaluation of high-speed optical and electronic switches. (Thesis). Hong Kong University of Science and Technology. Retrieved from http://repository.ust.hk/ir/Record/1783.1-7820 ; https://doi.org/10.14711/thesis-b1206084 ; http://repository.ust.hk/ir/bitstream/1783.1-7820/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):

Hu, Xiuwen. “Architecture and performance evaluation of high-speed optical and electronic switches.” 2012. Thesis, Hong Kong University of Science and Technology. Accessed September 24, 2020. http://repository.ust.hk/ir/Record/1783.1-7820 ; https://doi.org/10.14711/thesis-b1206084 ; http://repository.ust.hk/ir/bitstream/1783.1-7820/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):

Hu, Xiuwen. “Architecture and performance evaluation of high-speed optical and electronic switches.” 2012. Web. 24 Sep 2020.

Vancouver:

Hu X. Architecture and performance evaluation of high-speed optical and electronic switches. [Internet] [Thesis]. Hong Kong University of Science and Technology; 2012. [cited 2020 Sep 24]. Available from: http://repository.ust.hk/ir/Record/1783.1-7820 ; https://doi.org/10.14711/thesis-b1206084 ; http://repository.ust.hk/ir/bitstream/1783.1-7820/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:

Hu X. Architecture and performance evaluation of high-speed optical and electronic switches. [Thesis]. Hong Kong University of Science and Technology; 2012. Available from: http://repository.ust.hk/ir/Record/1783.1-7820 ; https://doi.org/10.14711/thesis-b1206084 ; http://repository.ust.hk/ir/bitstream/1783.1-7820/1/th_redirect.html

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


Iowa State University

25. Leslie, Stroh John. Identify algorithms from code.

Degree: 2019, Iowa State University

 Choosing an algorithm to use can depend on a variety of factors such as runtime, space, and problem requirements. Many algorithms already have tested implementations… (more)

Subjects/Keywords: Algorithms; Code Search; Computer Sciences

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Leslie, S. J. (2019). Identify algorithms from code. (Thesis). Iowa State University. Retrieved from https://lib.dr.iastate.edu/etd/17728

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

Leslie, Stroh John. “Identify algorithms from code.” 2019. Thesis, Iowa State University. Accessed September 24, 2020. https://lib.dr.iastate.edu/etd/17728.

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

MLA Handbook (7th Edition):

Leslie, Stroh John. “Identify algorithms from code.” 2019. Web. 24 Sep 2020.

Vancouver:

Leslie SJ. Identify algorithms from code. [Internet] [Thesis]. Iowa State University; 2019. [cited 2020 Sep 24]. Available from: https://lib.dr.iastate.edu/etd/17728.

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

Council of Science Editors:

Leslie SJ. Identify algorithms from code. [Thesis]. Iowa State University; 2019. Available from: https://lib.dr.iastate.edu/etd/17728

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


University of Victoria

26. Younis, Adel Ayad Hassouna. Space exploration and region elimination global optimization algorithms for multidisciplinary design optimization.

Degree: Dept. of Mechanical Engineering, 2011, University of Victoria

 In modern day engineering, the designer has become more and more dependent on computer simulation. Oftentimes, computational cost and convergence accuracy accompany these simulations to… (more)

Subjects/Keywords: approximation models; computer simulation; algorithms

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Younis, A. A. H. (2011). Space exploration and region elimination global optimization algorithms for multidisciplinary design optimization. (Thesis). University of Victoria. Retrieved from http://hdl.handle.net/1828/3325

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

Younis, Adel Ayad Hassouna. “Space exploration and region elimination global optimization algorithms for multidisciplinary design optimization.” 2011. Thesis, University of Victoria. Accessed September 24, 2020. http://hdl.handle.net/1828/3325.

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

MLA Handbook (7th Edition):

Younis, Adel Ayad Hassouna. “Space exploration and region elimination global optimization algorithms for multidisciplinary design optimization.” 2011. Web. 24 Sep 2020.

Vancouver:

Younis AAH. Space exploration and region elimination global optimization algorithms for multidisciplinary design optimization. [Internet] [Thesis]. University of Victoria; 2011. [cited 2020 Sep 24]. Available from: http://hdl.handle.net/1828/3325.

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

Council of Science Editors:

Younis AAH. Space exploration and region elimination global optimization algorithms for multidisciplinary design optimization. [Thesis]. University of Victoria; 2011. Available from: http://hdl.handle.net/1828/3325

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


Duke University

27. 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 September 24, 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. 24 Sep 2020.

Vancouver:

Haney SM. Algorithms for Networks With Uncertainty . [Internet] [Thesis]. Duke University; 2019. [cited 2020 Sep 24]. 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


University of Hong Kong

28. 王富利. Efficient stabbing algorithms for a set of objects.

Degree: 1999, University of Hong Kong

Subjects/Keywords: Computer algorithms.

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

王富利. (1999). Efficient stabbing algorithms for a set of objects. (Thesis). University of Hong Kong. Retrieved from http://hdl.handle.net/10722/33253

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

Chicago Manual of Style (16th Edition):

王富利. “Efficient stabbing algorithms for a set of objects.” 1999. Thesis, University of Hong Kong. Accessed September 24, 2020. http://hdl.handle.net/10722/33253.

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

MLA Handbook (7th Edition):

王富利. “Efficient stabbing algorithms for a set of objects.” 1999. Web. 24 Sep 2020.

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

Vancouver:

王富利. Efficient stabbing algorithms for a set of objects. [Internet] [Thesis]. University of Hong Kong; 1999. [cited 2020 Sep 24]. Available from: http://hdl.handle.net/10722/33253.

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

Council of Science Editors:

王富利. Efficient stabbing algorithms for a set of objects. [Thesis]. University of Hong Kong; 1999. Available from: http://hdl.handle.net/10722/33253

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


University of Hong Kong

29. Lau, Hing-yip. The power of greediness: a general methodology for designing approximation algorithms.

Degree: 1999, University of Hong Kong

Subjects/Keywords: Computer algorithms.

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Lau, H. (1999). The power of greediness: a general methodology for designing approximation algorithms. (Thesis). University of Hong Kong. Retrieved from http://hdl.handle.net/10722/33435

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

Lau, Hing-yip. “The power of greediness: a general methodology for designing approximation algorithms.” 1999. Thesis, University of Hong Kong. Accessed September 24, 2020. http://hdl.handle.net/10722/33435.

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

MLA Handbook (7th Edition):

Lau, Hing-yip. “The power of greediness: a general methodology for designing approximation algorithms.” 1999. Web. 24 Sep 2020.

Vancouver:

Lau H. The power of greediness: a general methodology for designing approximation algorithms. [Internet] [Thesis]. University of Hong Kong; 1999. [cited 2020 Sep 24]. Available from: http://hdl.handle.net/10722/33435.

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

Council of Science Editors:

Lau H. The power of greediness: a general methodology for designing approximation algorithms. [Thesis]. University of Hong Kong; 1999. Available from: http://hdl.handle.net/10722/33435

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


Reykjavík University

30. Elena Losievskaja 1979-. Approximation algorithms for independent set problems on hypergraphs .

Degree: 2011, Reykjavík University

 This thesis deals with approximation algorithms for the Maximum Independent Set and the Minimum Hitting Set problems on hypergraphs. As a hypergraph is a generalization… (more)

Subjects/Keywords: Algorithms; Computer science; Bestun; Reiknirit

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

1979-, E. L. (2011). Approximation algorithms for independent set problems on hypergraphs . (Thesis). Reykjavík University. Retrieved from http://hdl.handle.net/1946/7410

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

1979-, Elena Losievskaja. “Approximation algorithms for independent set problems on hypergraphs .” 2011. Thesis, Reykjavík University. Accessed September 24, 2020. http://hdl.handle.net/1946/7410.

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

MLA Handbook (7th Edition):

1979-, Elena Losievskaja. “Approximation algorithms for independent set problems on hypergraphs .” 2011. Web. 24 Sep 2020.

Vancouver:

1979- EL. Approximation algorithms for independent set problems on hypergraphs . [Internet] [Thesis]. Reykjavík University; 2011. [cited 2020 Sep 24]. Available from: http://hdl.handle.net/1946/7410.

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

Council of Science Editors:

1979- EL. Approximation algorithms for independent set problems on hypergraphs . [Thesis]. Reykjavík University; 2011. Available from: http://hdl.handle.net/1946/7410

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

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

.