Advanced search options

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

You searched for `subject:(Theory AND Algorithms)`

.
Showing records 1 – 30 of
939 total matches.

◁ [1] [2] [3] [4] [5] … [32] ▶

Search Limiters

Dates

- 2015 – 2019 (269)
- 2010 – 2014 (337)
- 2005 – 2009 (198)
- 2000 – 2004 (85)
- 1995 – 1999 (41)
- 1990 – 1994 (29)
- 1985 – 1989 (19)
- 1980 – 1984 (13)

Universities

- ETH Zürich (61)
- Georgia Tech (43)
- University of Western Ontario (41)
- University of Canterbury (37)
- Indian Institute of Science (33)
- University of Nevada – Las Vegas (29)
- University of Oxford (21)
- University of Colorado (20)
- University of Florida (18)
- University of Tennessee – Knoxville (18)
- Florida International University (14)
- Hong Kong University of Science and Technology (14)
- McMaster University (14)
- Nanyang Technological University (14)
- Ryerson University (12)

Department

- Computer Science (117)
- Electrical and Computer Engineering (26)
- Mathematics (14)
- Electrical Engineering (11)
- Department of Computer Science (10)
- Informatique (10)

Degrees

- PhD (233)
- MS (89)
- MSin Computer Science (32)
- Docteur es (22)

Languages

- English (548)
- Portuguese (21)
- Greek (16)

Country

- US (438)
- Canada (120)
- Switzerland (65)
- New Zealand (38)
- India (34)
- UK (29)
- Australia (28)
- Hong Kong (24)
- Greece (23)
- France (22)
- Brazil (20)
- Singapore (18)
- South Africa (14)

▼ Search Limiters

University of Colorado

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

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

URL: http://scholar.colorado.edu/csci_gradetds/23

► 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 Details Similar Records

❌

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

APA (6^{th} 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 (16^{th} Edition):

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

MLA Handbook (7^{th} Edition):

Beach, Aaron. “Anonymity in Socio-Digital Systems.” 2011. Web. 23 Aug 2019.

Vancouver:

Beach A. Anonymity in Socio-Digital Systems. [Internet] [Doctoral dissertation]. University of Colorado; 2011. [cited 2019 Aug 23]. 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

URL: https://dspace.library.uvic.ca//handle/1828/9918

► 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 Details Similar Records

❌

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

APA (6^{th} 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 (16^{th} Edition):

Boyer, John M. “Simplified O(n) algorithms for planar graph embedding, Kuratowski subgraph isolation, and related problems.” 2018. Thesis, University of Victoria. Accessed August 23, 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 (7^{th} Edition):

Boyer, John M. “Simplified O(n) algorithms for planar graph embedding, Kuratowski subgraph isolation, and related problems.” 2018. Web. 23 Aug 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 Aug 23]. 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

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

URL: http://hdl.handle.net/10217/183921

► 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 Details Similar Records

❌

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

APA (6^{th} 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 (16^{th} Edition):

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

MLA Handbook (7^{th} Edition):

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

Vancouver:

Chaturvedi M. Parametric classification of directed acyclic graphs, A. [Internet] [Masters thesis]. Colorado State University; 2017. [cited 2019 Aug 23]. 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

URL: https://digitalcommons.calpoly.edu/theses/245 ; 10.15368/theses.2010.16

► 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 Details Similar Records

❌

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

APA (6^{th} 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 (16^{th} Edition):

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

MLA Handbook (7^{th} Edition):

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

Vancouver:

Lovelace AL. On the Complexity of Scheduling University Courses. [Internet] [Masters thesis]. Cal Poly; 2010. [cited 2019 Aug 23]. 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

URL: http://scholar.colorado.edu/csci_gradetds/18

► 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 Details Similar Records

❌

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

APA (6^{th} 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 (16^{th} Edition):

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

MLA Handbook (7^{th} Edition):

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

Vancouver:

Nelson TH. Genetic Algorithms with Chaotic Population Dynamics. [Internet] [Masters thesis]. University of Colorado; 2010. [cited 2019 Aug 23]. 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

URL: https://digital.library.ryerson.ca/islandora/object/RULA%3A1845

► 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 Details Similar Records

❌

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

APA (6^{th} 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

Not specified: Masters Thesis or Doctoral Dissertation

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

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

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

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

Vancouver:

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

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

Not specified: Masters Thesis or Doctoral Dissertation

Hong Kong University of Science and Technology

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

Degree: 2011, Hong Kong University of Science and Technology

URL: https://doi.org/10.14711/thesis-b1156461 ; http://repository.ust.hk/ir/bitstream/1783.1-7274/1/th_redirect.html

► 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 Details Similar Records

❌

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

APA (6^{th} 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

Not specified: Masters Thesis or Doctoral Dissertation

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

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

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Antony, Mathis Aurelius. “Partial information, noise and network topology in 2x2 games with memory.” 2011. Web. 23 Aug 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 Aug 23]. Available from: https://doi.org/10.14711/thesis-b1156461 ; http://repository.ust.hk/ir/bitstream/1783.1-7274/1/th_redirect.html.

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

Not specified: Masters Thesis or Doctoral Dissertation

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

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

URL: http://dc.ewu.edu/theses/497

► 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 Details Similar Records

❌

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

APA (6^{th} Edition):

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

Not specified: Masters Thesis or Doctoral Dissertation

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

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

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Ireland, Forrest L. “GPU accelerated risk quantification.” 2018. Web. 23 Aug 2019.

Vancouver:

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

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

Not specified: Masters Thesis or Doctoral Dissertation

Georgia Tech

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

Degree: PhD, Computer Science, 2018, Georgia Tech

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

► 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 Details Similar Records

❌

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

APA (6^{th} 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 (16^{th} Edition):

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

MLA Handbook (7^{th} Edition):

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

Vancouver:

Yazdanbod S. Combinatorial and exchange markets: Algorithms, complexity, and applications. [Internet] [Doctoral dissertation]. Georgia Tech; 2018. [cited 2019 Aug 23]. 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

Duke University

10.
Haney, Samuel Mitchell.
* Algorithms* for Networks With Uncertainty
.

Degree: 2019, Duke University

URL: http://hdl.handle.net/10161/18661

► 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 Details Similar Records

❌

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

APA (6^{th} Edition):

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

Not specified: Masters Thesis or Doctoral Dissertation

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

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

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

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

Vancouver:

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

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

Not specified: Masters Thesis or Doctoral Dissertation

University of Illinois – Urbana-Champaign

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

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

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

► 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 Details Similar Records

❌

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

APA (6^{th} 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 (16^{th} Edition):

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

MLA Handbook (7^{th} Edition):

Doan, Thinh Thanh. “On the performance of distributed algorithms for network optimization problems.” 2018. Web. 23 Aug 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 Aug 23]. 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

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

Degree: Department of Computer Science, 2010, Brock University

URL: http://hdl.handle.net/10464/2950

► 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 Details Similar Records

❌

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

APA (6^{th} Edition):

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

Not specified: Masters Thesis or Doctoral Dissertation

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

Li, Yifeng. “Properties and algorithms of the (n, k)-arrangement graphs .” 2010. Thesis, Brock University. Accessed August 23, 2019. http://hdl.handle.net/10464/2950.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

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

Vancouver:

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

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

Not specified: Masters Thesis or Doctoral Dissertation

University of Nevada – Las Vegas

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

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

URL: https://digitalscholarship.unlv.edu/thesesdissertations/2278

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

Subjects/Keywords: Computer Sciences; Theory and Algorithms

Record Details Similar Records

❌

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

APA (6^{th} Edition):

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

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

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

MLA Handbook (7^{th} Edition):

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

Vancouver:

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

Council of Science Editors:

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

University of Nevada – Las Vegas

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

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

URL: https://digitalscholarship.unlv.edu/thesesdissertations/945

► 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 Details Similar Records

❌

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

APA (6^{th} 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 (16^{th} Edition):

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

MLA Handbook (7^{th} Edition):

Andro-Vasko, James. “Shop problems in scheduling.” 2011. Web. 23 Aug 2019.

Vancouver:

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

Council of Science Editors:

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

University of Nevada – Las Vegas

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

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

URL: https://digitalscholarship.unlv.edu/thesesdissertations/907

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

Subjects/Keywords: Computer Sciences; Theory and Algorithms

Record Details Similar Records

❌

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

APA (6^{th} Edition):

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

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

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

MLA Handbook (7^{th} Edition):

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

Vancouver:

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

Council of Science Editors:

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

University of Nevada – Las Vegas

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

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

URL: https://digitalscholarship.unlv.edu/thesesdissertations/981

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

Subjects/Keywords: Computer Sciences; Theory and Algorithms

Record Details Similar Records

❌

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

APA (6^{th} Edition):

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

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

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

MLA Handbook (7^{th} Edition):

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

Vancouver:

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

Council of Science Editors:

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

University of Nevada – Las Vegas

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

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

URL: https://digitalscholarship.unlv.edu/thesesdissertations/1007

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

Subjects/Keywords: Computer Sciences; Theory and Algorithms

Record Details Similar Records

❌

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

APA (6^{th} Edition):

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

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

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

MLA Handbook (7^{th} Edition):

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

Vancouver:

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

Council of Science Editors:

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

Rutgers University

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

Degree: PhD, Computer Science, 2011, Rutgers University

URL: http://hdl.rutgers.edu/1782.1/rucore10001600001.ETD.000061323

►

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 Details Similar Records

❌

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

APA (6^{th} 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 (16^{th} Edition):

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

MLA Handbook (7^{th} Edition):

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

Vancouver:

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

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

Degree: PhD, Mathematics, 2016, Rutgers University

URL: https://rucore.libraries.rutgers.edu/rutgers-lib/51382/

►

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 Details Similar Records

❌

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

APA (6^{th} 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 (16^{th} Edition):

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

MLA Handbook (7^{th} Edition):

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

Vancouver:

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

McMaster University

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

Degree: MSc, 2011, McMaster University

URL: http://hdl.handle.net/11375/11286

►

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 Details Similar Records

❌

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

APA (6^{th} 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 (16^{th} Edition):

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

MLA Handbook (7^{th} Edition):

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

Vancouver:

Weng C. Implementing Efficient Algorithms for Computing Runs. [Internet] [Masters thesis]. McMaster University; 2011. [cited 2019 Aug 23]. 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

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

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

URL: http://hdl.handle.net/1893/20248

► 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 Details Similar Records

❌

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

APA (6^{th} 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 (16^{th} Edition):

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

MLA Handbook (7^{th} Edition):

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

Vancouver:

Neumann GK. TEDA: A Targeted Estimation of Distribution Algorithm. [Internet] [Doctoral dissertation]. University of Stirling; 2014. [cited 2019 Aug 23]. 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

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

Degree: 2006, Technische Universität Dortmund

URL: http://hdl.handle.net/2003/23261

► 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 Details Similar Records

❌

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

APA (6^{th} 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

Not specified: Masters Thesis or Doctoral Dissertation

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

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

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

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

Vancouver:

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

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

Not specified: Masters Thesis or Doctoral Dissertation

Penn State University

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

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

URL: https://etda.libraries.psu.edu/catalog/22793

► 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 Details Similar Records

❌

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

APA (6^{th} 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 (16^{th} Edition):

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

MLA Handbook (7^{th} Edition):

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

Vancouver:

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

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

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

URL: https://etda.libraries.psu.edu/catalog/20047

► 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 Details Similar Records

❌

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

APA (6^{th} 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 (16^{th} Edition):

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

MLA Handbook (7^{th} Edition):

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

Vancouver:

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

25. 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

URL: http://pdxscholar.library.pdx.edu/open_access_etds/3313

► 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 Details Similar Records

❌

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

APA (6^{th} 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 (16^{th} Edition):

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

MLA Handbook (7^{th} Edition):

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

Vancouver:

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

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

Degree: 2016, University of Western Ontario

URL: https://ir.lib.uwo.ca/etd/4105

► 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 Details Similar Records

❌

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

APA (6^{th} 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

Not specified: Masters Thesis or Doctoral Dissertation

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

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

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

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

Vancouver:

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

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

Not specified: Masters Thesis or Doctoral Dissertation

University of Iowa

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

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

URL: https://ir.uiowa.edu/etd/1152

► 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 Details Similar Records

❌

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

APA (6^{th} 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 (16^{th} Edition):

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

MLA Handbook (7^{th} Edition):

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

Vancouver:

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

Northeastern University

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

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

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

► 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 Details Similar Records

❌

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

APA (6^{th} 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 (16^{th} Edition):

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

MLA Handbook (7^{th} Edition):

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

Vancouver:

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

Council of Science Editors:

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

University of Technology, Sydney

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

Degree: 2009, University of Technology, Sydney

URL: http://hdl.handle.net/10453/20252

► 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 Details Similar Records

❌

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

APA (6^{th} 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

Not specified: Masters Thesis or Doctoral Dissertation

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

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

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

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

Vancouver:

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

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

Not specified: Masters Thesis or Doctoral Dissertation

Cape Peninsula University of Technology

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

Degree: 2014, Cape Peninsula University of Technology

URL: http://etd.cput.ac.za/handle/20.500.11838/1187

► 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 Details Similar Records

❌

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

APA (6^{th} 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

Not specified: Masters Thesis or Doctoral Dissertation

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

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

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

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

Vancouver:

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

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

Not specified: Masters Thesis or Doctoral Dissertation