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

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

Search Limiters

Last 2 Years | English Only

Degrees

Levels

Languages

Country

▼ Search Limiters


University of Victoria

1. Whitney, Michael James. Minterm based search algorithms for two-level minimization of discrete functions.

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

 Techniques for the heuristic and exact two-level minimization of Boolean and multivalued functions are presented. The work is based on a previously existing algorithmic framework… (more)

Subjects/Keywords: Algorithms

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Whitney, M. J. (2018). Minterm based search algorithms for two-level minimization of discrete functions. (Thesis). University of Victoria. Retrieved from https://dspace.library.uvic.ca//handle/1828/9643

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

Whitney, Michael James. “Minterm based search algorithms for two-level minimization of discrete functions.” 2018. Thesis, University of Victoria. Accessed April 25, 2019. https://dspace.library.uvic.ca//handle/1828/9643.

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

MLA Handbook (7th Edition):

Whitney, Michael James. “Minterm based search algorithms for two-level minimization of discrete functions.” 2018. Web. 25 Apr 2019.

Vancouver:

Whitney MJ. Minterm based search algorithms for two-level minimization of discrete functions. [Internet] [Thesis]. University of Victoria; 2018. [cited 2019 Apr 25]. Available from: https://dspace.library.uvic.ca//handle/1828/9643.

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

Council of Science Editors:

Whitney MJ. Minterm based search algorithms for two-level minimization of discrete functions. [Thesis]. University of Victoria; 2018. Available from: https://dspace.library.uvic.ca//handle/1828/9643

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


Wake Forest University

2. Rouse, Kathryn Margaret Zuhr. ON THE EFFICIENCY OF ALGORITHMS FOR TENSOR DECOMPOSITIONS AND THEIR APPLICATIONS.

Degree: 2018, Wake Forest University

Multi-dimensional arrays, or tensors, are fundamental objects in computational science for their ability to store multi-dimensional data and to encode bilinear forms. We will consider algorithms and applications of the CP and Tucker tensor decompositions, focusing our efforts on optimizing subroutines required to compute tensor decompositions.

Subjects/Keywords: Algorithms

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Rouse, K. M. Z. (2018). ON THE EFFICIENCY OF ALGORITHMS FOR TENSOR DECOMPOSITIONS AND THEIR APPLICATIONS. (Thesis). Wake Forest University. Retrieved from http://hdl.handle.net/10339/90764

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

Rouse, Kathryn Margaret Zuhr. “ON THE EFFICIENCY OF ALGORITHMS FOR TENSOR DECOMPOSITIONS AND THEIR APPLICATIONS.” 2018. Thesis, Wake Forest University. Accessed April 25, 2019. http://hdl.handle.net/10339/90764.

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

MLA Handbook (7th Edition):

Rouse, Kathryn Margaret Zuhr. “ON THE EFFICIENCY OF ALGORITHMS FOR TENSOR DECOMPOSITIONS AND THEIR APPLICATIONS.” 2018. Web. 25 Apr 2019.

Vancouver:

Rouse KMZ. ON THE EFFICIENCY OF ALGORITHMS FOR TENSOR DECOMPOSITIONS AND THEIR APPLICATIONS. [Internet] [Thesis]. Wake Forest University; 2018. [cited 2019 Apr 25]. Available from: http://hdl.handle.net/10339/90764.

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

Council of Science Editors:

Rouse KMZ. ON THE EFFICIENCY OF ALGORITHMS FOR TENSOR DECOMPOSITIONS AND THEIR APPLICATIONS. [Thesis]. Wake Forest University; 2018. Available from: http://hdl.handle.net/10339/90764

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

3. Ellis, Alexandra. Emulators to facilitate the development and analysis of computationally expensive decision analytic models in health.

Degree: Department of Health Services, Policy and Practice, 2018, Brown University

 In order for a mathematical model to be useful for decision-making, it needs to be detailed enough to capture the salient aspects of the decisional… (more)

Subjects/Keywords: Algorithms

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Ellis, A. (2018). Emulators to facilitate the development and analysis of computationally expensive decision analytic models in health. (Thesis). Brown University. Retrieved from https://repository.library.brown.edu/studio/item/bdr:792778/

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

Ellis, Alexandra. “Emulators to facilitate the development and analysis of computationally expensive decision analytic models in health.” 2018. Thesis, Brown University. Accessed April 25, 2019. https://repository.library.brown.edu/studio/item/bdr:792778/.

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

MLA Handbook (7th Edition):

Ellis, Alexandra. “Emulators to facilitate the development and analysis of computationally expensive decision analytic models in health.” 2018. Web. 25 Apr 2019.

Vancouver:

Ellis A. Emulators to facilitate the development and analysis of computationally expensive decision analytic models in health. [Internet] [Thesis]. Brown University; 2018. [cited 2019 Apr 25]. Available from: https://repository.library.brown.edu/studio/item/bdr:792778/.

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

Council of Science Editors:

Ellis A. Emulators to facilitate the development and analysis of computationally expensive decision analytic models in health. [Thesis]. Brown University; 2018. Available from: https://repository.library.brown.edu/studio/item/bdr:792778/

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


University of Georgia

4. Shi, Liang. Adaptive surrogate-assisted evolution.

Degree: PhD, Computer Science, 2008, University of Georgia

 Evolutionary Algorithms (EAs) used in complex optimization domains usually need to perform a large number of fitness function evaluations in order to find near-optimal solutions.… (more)

Subjects/Keywords: Evolutionary algorithms

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Shi, L. (2008). Adaptive surrogate-assisted evolution. (Doctoral Dissertation). University of Georgia. Retrieved from http://purl.galileo.usg.edu/uga_etd/shi_liang_200812_phd

Chicago Manual of Style (16th Edition):

Shi, Liang. “Adaptive surrogate-assisted evolution.” 2008. Doctoral Dissertation, University of Georgia. Accessed April 25, 2019. http://purl.galileo.usg.edu/uga_etd/shi_liang_200812_phd.

MLA Handbook (7th Edition):

Shi, Liang. “Adaptive surrogate-assisted evolution.” 2008. Web. 25 Apr 2019.

Vancouver:

Shi L. Adaptive surrogate-assisted evolution. [Internet] [Doctoral dissertation]. University of Georgia; 2008. [cited 2019 Apr 25]. Available from: http://purl.galileo.usg.edu/uga_etd/shi_liang_200812_phd.

Council of Science Editors:

Shi L. Adaptive surrogate-assisted evolution. [Doctoral Dissertation]. University of Georgia; 2008. Available from: http://purl.galileo.usg.edu/uga_etd/shi_liang_200812_phd


University of Alberta

5. Li, Liwu. Probabilistic analysis of search.

Degree: PhD, Department of Computing Science, 1989, University of Alberta

Subjects/Keywords: Algorithms.

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Li, L. (1989). Probabilistic analysis of search. (Doctoral Dissertation). University of Alberta. Retrieved from https://era.library.ualberta.ca/files/3484zk37r

Chicago Manual of Style (16th Edition):

Li, Liwu. “Probabilistic analysis of search.” 1989. Doctoral Dissertation, University of Alberta. Accessed April 25, 2019. https://era.library.ualberta.ca/files/3484zk37r.

MLA Handbook (7th Edition):

Li, Liwu. “Probabilistic analysis of search.” 1989. Web. 25 Apr 2019.

Vancouver:

Li L. Probabilistic analysis of search. [Internet] [Doctoral dissertation]. University of Alberta; 1989. [cited 2019 Apr 25]. Available from: https://era.library.ualberta.ca/files/3484zk37r.

Council of Science Editors:

Li L. Probabilistic analysis of search. [Doctoral Dissertation]. University of Alberta; 1989. Available from: https://era.library.ualberta.ca/files/3484zk37r


Texas A&M University

6. Crosby, Ralph. Phylogenetic Divergence Time, Algorithms for Improved Accuracy and Performance.

Degree: 2015, Texas A&M University

 The inference of species divergence time is a key step in the study of phylogenetics. Methods have been available for the last ten years to… (more)

Subjects/Keywords: Algorithms; Phylogenetics

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Crosby, R. (2015). Phylogenetic Divergence Time, Algorithms for Improved Accuracy and Performance. (Thesis). Texas A&M University. Retrieved from http://hdl.handle.net/1969.1/155629

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

Crosby, Ralph. “Phylogenetic Divergence Time, Algorithms for Improved Accuracy and Performance.” 2015. Thesis, Texas A&M University. Accessed April 25, 2019. http://hdl.handle.net/1969.1/155629.

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

MLA Handbook (7th Edition):

Crosby, Ralph. “Phylogenetic Divergence Time, Algorithms for Improved Accuracy and Performance.” 2015. Web. 25 Apr 2019.

Vancouver:

Crosby R. Phylogenetic Divergence Time, Algorithms for Improved Accuracy and Performance. [Internet] [Thesis]. Texas A&M University; 2015. [cited 2019 Apr 25]. Available from: http://hdl.handle.net/1969.1/155629.

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

Council of Science Editors:

Crosby R. Phylogenetic Divergence Time, Algorithms for Improved Accuracy and Performance. [Thesis]. Texas A&M University; 2015. Available from: http://hdl.handle.net/1969.1/155629

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

7. Satishkumar, M V. Simultaneous scheduling of machines and Agvs using evolutionary optimization algorithms.

Degree: 2010, Jawaharlal Nehru Technological University

 High degree of flexibility and quick response times have become essential features of modern manufacturing systems where customers are demanding for a variety of products… (more)

Subjects/Keywords: Genetic Algorithms

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Satishkumar, M. V. (2010). Simultaneous scheduling of machines and Agvs using evolutionary optimization algorithms. (Thesis). Jawaharlal Nehru Technological University. Retrieved from http://shodhganga.inflibnet.ac.in/handle/10603/2255

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

Satishkumar, M V. “Simultaneous scheduling of machines and Agvs using evolutionary optimization algorithms.” 2010. Thesis, Jawaharlal Nehru Technological University. Accessed April 25, 2019. http://shodhganga.inflibnet.ac.in/handle/10603/2255.

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

MLA Handbook (7th Edition):

Satishkumar, M V. “Simultaneous scheduling of machines and Agvs using evolutionary optimization algorithms.” 2010. Web. 25 Apr 2019.

Vancouver:

Satishkumar MV. Simultaneous scheduling of machines and Agvs using evolutionary optimization algorithms. [Internet] [Thesis]. Jawaharlal Nehru Technological University; 2010. [cited 2019 Apr 25]. Available from: http://shodhganga.inflibnet.ac.in/handle/10603/2255.

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

Council of Science Editors:

Satishkumar MV. Simultaneous scheduling of machines and Agvs using evolutionary optimization algorithms. [Thesis]. Jawaharlal Nehru Technological University; 2010. Available from: http://shodhganga.inflibnet.ac.in/handle/10603/2255

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

8. Pearce, Roger Allan. Scalable Parallel Algorithms for Massive Scale-free Graphs.

Degree: 2013, Texas Digital Library

 Efficiently storing and processing massive graph data sets is a challenging problem as researchers seek to leverage ???Big Data??? to answer next-generation scientific questions. New… (more)

Subjects/Keywords: parallel algorithms

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Pearce, R. A. (2013). Scalable Parallel Algorithms for Massive Scale-free Graphs. (Thesis). Texas Digital Library. Retrieved from http://hdl.handle.net/1969; http://hdl.handle.net/2249.1/66830

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

Pearce, Roger Allan. “Scalable Parallel Algorithms for Massive Scale-free Graphs.” 2013. Thesis, Texas Digital Library. Accessed April 25, 2019. http://hdl.handle.net/1969; http://hdl.handle.net/2249.1/66830.

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

MLA Handbook (7th Edition):

Pearce, Roger Allan. “Scalable Parallel Algorithms for Massive Scale-free Graphs.” 2013. Web. 25 Apr 2019.

Vancouver:

Pearce RA. Scalable Parallel Algorithms for Massive Scale-free Graphs. [Internet] [Thesis]. Texas Digital Library; 2013. [cited 2019 Apr 25]. Available from: http://hdl.handle.net/1969; http://hdl.handle.net/2249.1/66830.

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

Council of Science Editors:

Pearce RA. Scalable Parallel Algorithms for Massive Scale-free Graphs. [Thesis]. Texas Digital Library; 2013. Available from: http://hdl.handle.net/1969; http://hdl.handle.net/2249.1/66830

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


Cornell University

9. Novikoff, Timothy. Algorithmic Education Theory .

Degree: 2013, Cornell University

 In order to build toward an algorithmic theory of education we construct simple, idealized mathematical models of students, learning, educational software and educational software usage… (more)

Subjects/Keywords: algorithms; education

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Novikoff, T. (2013). Algorithmic Education Theory . (Thesis). Cornell University. Retrieved from http://hdl.handle.net/1813/33956

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

Novikoff, Timothy. “Algorithmic Education Theory .” 2013. Thesis, Cornell University. Accessed April 25, 2019. http://hdl.handle.net/1813/33956.

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

MLA Handbook (7th Edition):

Novikoff, Timothy. “Algorithmic Education Theory .” 2013. Web. 25 Apr 2019.

Vancouver:

Novikoff T. Algorithmic Education Theory . [Internet] [Thesis]. Cornell University; 2013. [cited 2019 Apr 25]. Available from: http://hdl.handle.net/1813/33956.

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

Council of Science Editors:

Novikoff T. Algorithmic Education Theory . [Thesis]. Cornell University; 2013. Available from: http://hdl.handle.net/1813/33956

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


Queens University

10. Torbey, Sami. Beneath the surface electrocardiogram: computer algorithms for the non-invasive assessment of cardiac electrophysiology .

Degree: Computing, 2013, Queens University

 The surface electrocardiogram (ECG) is a periodic signal portraying the electrical activity of the heart from the torso. The past fifty years have witnessed a… (more)

Subjects/Keywords: ECG; Algorithms

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Torbey, S. (2013). Beneath the surface electrocardiogram: computer algorithms for the non-invasive assessment of cardiac electrophysiology . (Thesis). Queens University. Retrieved from http://hdl.handle.net/1974/8392

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

Torbey, Sami. “Beneath the surface electrocardiogram: computer algorithms for the non-invasive assessment of cardiac electrophysiology .” 2013. Thesis, Queens University. Accessed April 25, 2019. http://hdl.handle.net/1974/8392.

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

MLA Handbook (7th Edition):

Torbey, Sami. “Beneath the surface electrocardiogram: computer algorithms for the non-invasive assessment of cardiac electrophysiology .” 2013. Web. 25 Apr 2019.

Vancouver:

Torbey S. Beneath the surface electrocardiogram: computer algorithms for the non-invasive assessment of cardiac electrophysiology . [Internet] [Thesis]. Queens University; 2013. [cited 2019 Apr 25]. Available from: http://hdl.handle.net/1974/8392.

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

Council of Science Editors:

Torbey S. Beneath the surface electrocardiogram: computer algorithms for the non-invasive assessment of cardiac electrophysiology . [Thesis]. Queens University; 2013. Available from: http://hdl.handle.net/1974/8392

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


Oregon State University

11. Miyakawa, Yoshihiro. Development of network location algorithm for resource planning and management.

Degree: MS, Industrial Engineering, 1978, Oregon State University

Algorithms capable of automatically drawing Resource Planning and Management (RPM) network models from standard Linear Programming data files are developed. An RPM network is a… (more)

Subjects/Keywords: Algorithms

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Miyakawa, Y. (1978). Development of network location algorithm for resource planning and management. (Masters Thesis). Oregon State University. Retrieved from http://hdl.handle.net/1957/43858

Chicago Manual of Style (16th Edition):

Miyakawa, Yoshihiro. “Development of network location algorithm for resource planning and management.” 1978. Masters Thesis, Oregon State University. Accessed April 25, 2019. http://hdl.handle.net/1957/43858.

MLA Handbook (7th Edition):

Miyakawa, Yoshihiro. “Development of network location algorithm for resource planning and management.” 1978. Web. 25 Apr 2019.

Vancouver:

Miyakawa Y. Development of network location algorithm for resource planning and management. [Internet] [Masters thesis]. Oregon State University; 1978. [cited 2019 Apr 25]. Available from: http://hdl.handle.net/1957/43858.

Council of Science Editors:

Miyakawa Y. Development of network location algorithm for resource planning and management. [Masters Thesis]. Oregon State University; 1978. Available from: http://hdl.handle.net/1957/43858


Oregon State University

12. Jang, Jai Eun. Design and analysis of robust algorithms for fault tolerant computing.

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

Subjects/Keywords: Algorithms

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Jang, J. E. (1990). Design and analysis of robust algorithms for fault tolerant computing. (Doctoral Dissertation). Oregon State University. Retrieved from http://hdl.handle.net/1957/38192

Chicago Manual of Style (16th Edition):

Jang, Jai Eun. “Design and analysis of robust algorithms for fault tolerant computing.” 1990. Doctoral Dissertation, Oregon State University. Accessed April 25, 2019. http://hdl.handle.net/1957/38192.

MLA Handbook (7th Edition):

Jang, Jai Eun. “Design and analysis of robust algorithms for fault tolerant computing.” 1990. Web. 25 Apr 2019.

Vancouver:

Jang JE. Design and analysis of robust algorithms for fault tolerant computing. [Internet] [Doctoral dissertation]. Oregon State University; 1990. [cited 2019 Apr 25]. Available from: http://hdl.handle.net/1957/38192.

Council of Science Editors:

Jang JE. Design and analysis of robust algorithms for fault tolerant computing. [Doctoral Dissertation]. Oregon State University; 1990. Available from: http://hdl.handle.net/1957/38192


University of Hong Kong

13. Dong, Fengjiao. Improving discrete AdaBoost for classification by randomization methods.

Degree: M. Phil., 2016, University of Hong Kong

Adaboost, a typical boosting method for classification, performs well in classification problems. Many researchers have applied different types of randomization techniques to Adaboost for further… (more)

Subjects/Keywords: Boosting (Algorithms)

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Dong, F. (2016). Improving discrete AdaBoost for classification by randomization methods. (Masters Thesis). University of Hong Kong. Retrieved from Dong, F. [董凤娇]. (2016). Improving discrete AdaBoost for classification by randomization methods. (Thesis). University of Hong Kong, Pokfulam, Hong Kong SAR. Retrieved from http://dx.doi.org/10.5353/th_b5760964 ; http://hdl.handle.net/10722/226781

Chicago Manual of Style (16th Edition):

Dong, Fengjiao. “Improving discrete AdaBoost for classification by randomization methods.” 2016. Masters Thesis, University of Hong Kong. Accessed April 25, 2019. Dong, F. [董凤娇]. (2016). Improving discrete AdaBoost for classification by randomization methods. (Thesis). University of Hong Kong, Pokfulam, Hong Kong SAR. Retrieved from http://dx.doi.org/10.5353/th_b5760964 ; http://hdl.handle.net/10722/226781.

MLA Handbook (7th Edition):

Dong, Fengjiao. “Improving discrete AdaBoost for classification by randomization methods.” 2016. Web. 25 Apr 2019.

Vancouver:

Dong F. Improving discrete AdaBoost for classification by randomization methods. [Internet] [Masters thesis]. University of Hong Kong; 2016. [cited 2019 Apr 25]. Available from: Dong, F. [董凤娇]. (2016). Improving discrete AdaBoost for classification by randomization methods. (Thesis). University of Hong Kong, Pokfulam, Hong Kong SAR. Retrieved from http://dx.doi.org/10.5353/th_b5760964 ; http://hdl.handle.net/10722/226781.

Council of Science Editors:

Dong F. Improving discrete AdaBoost for classification by randomization methods. [Masters Thesis]. University of Hong Kong; 2016. Available from: Dong, F. [董凤娇]. (2016). Improving discrete AdaBoost for classification by randomization methods. (Thesis). University of Hong Kong, Pokfulam, Hong Kong SAR. Retrieved from http://dx.doi.org/10.5353/th_b5760964 ; http://hdl.handle.net/10722/226781


Nelson Mandela Metropolitan University

14. 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 April 25, 2019. 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. 25 Apr 2019.

Vancouver:

Kapp KP. Optimal cycle dating of large financial time series. [Internet] [Thesis]. Nelson Mandela Metropolitan University; 2017. [cited 2019 Apr 25]. 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 Victoria

15. Chen, Shu. Influential community discovery in massive social networks using a consumer-grade machine.

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

 Graphs have become very crucial as they can represent a wide variety of systems in different areas. One interesting structure called community in graphs has… (more)

Subjects/Keywords: algorithms; graphs

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Chen, S. (2017). Influential community discovery in massive social networks using a consumer-grade machine. (Masters Thesis). University of Victoria. Retrieved from https://dspace.library.uvic.ca//handle/1828/8367

Chicago Manual of Style (16th Edition):

Chen, Shu. “Influential community discovery in massive social networks using a consumer-grade machine.” 2017. Masters Thesis, University of Victoria. Accessed April 25, 2019. https://dspace.library.uvic.ca//handle/1828/8367.

MLA Handbook (7th Edition):

Chen, Shu. “Influential community discovery in massive social networks using a consumer-grade machine.” 2017. Web. 25 Apr 2019.

Vancouver:

Chen S. Influential community discovery in massive social networks using a consumer-grade machine. [Internet] [Masters thesis]. University of Victoria; 2017. [cited 2019 Apr 25]. Available from: https://dspace.library.uvic.ca//handle/1828/8367.

Council of Science Editors:

Chen S. Influential community discovery in massive social networks using a consumer-grade machine. [Masters Thesis]. University of Victoria; 2017. Available from: https://dspace.library.uvic.ca//handle/1828/8367


McGill University

16. Kim, Chang Young. Implementation and comparison of key-finding algorithms.

Degree: MS, School of Computer Science, 1976, McGill University

Subjects/Keywords: Algorithms.

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Kim, C. Y. (1976). Implementation and comparison of key-finding algorithms. (Masters Thesis). McGill University. Retrieved from http://digitool.library.mcgill.ca/thesisfile51998.pdf

Chicago Manual of Style (16th Edition):

Kim, Chang Young. “Implementation and comparison of key-finding algorithms.” 1976. Masters Thesis, McGill University. Accessed April 25, 2019. http://digitool.library.mcgill.ca/thesisfile51998.pdf.

MLA Handbook (7th Edition):

Kim, Chang Young. “Implementation and comparison of key-finding algorithms.” 1976. Web. 25 Apr 2019.

Vancouver:

Kim CY. Implementation and comparison of key-finding algorithms. [Internet] [Masters thesis]. McGill University; 1976. [cited 2019 Apr 25]. Available from: http://digitool.library.mcgill.ca/thesisfile51998.pdf.

Council of Science Editors:

Kim CY. Implementation and comparison of key-finding algorithms. [Masters Thesis]. McGill University; 1976. Available from: http://digitool.library.mcgill.ca/thesisfile51998.pdf


McGill University

17. Kipnis, Evan Jonathan. Algorithms for presenting subgroups.

Degree: MS, Department of Mathematics, 1978, McGill University

Subjects/Keywords: Algorithms.

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Kipnis, E. J. (1978). Algorithms for presenting subgroups. (Masters Thesis). McGill University. Retrieved from http://digitool.library.mcgill.ca/thesisfile54580.pdf

Chicago Manual of Style (16th Edition):

Kipnis, Evan Jonathan. “Algorithms for presenting subgroups.” 1978. Masters Thesis, McGill University. Accessed April 25, 2019. http://digitool.library.mcgill.ca/thesisfile54580.pdf.

MLA Handbook (7th Edition):

Kipnis, Evan Jonathan. “Algorithms for presenting subgroups.” 1978. Web. 25 Apr 2019.

Vancouver:

Kipnis EJ. Algorithms for presenting subgroups. [Internet] [Masters thesis]. McGill University; 1978. [cited 2019 Apr 25]. Available from: http://digitool.library.mcgill.ca/thesisfile54580.pdf.

Council of Science Editors:

Kipnis EJ. Algorithms for presenting subgroups. [Masters Thesis]. McGill University; 1978. Available from: http://digitool.library.mcgill.ca/thesisfile54580.pdf


Montana Tech

18. Schuman, Elmer Luis. Three characterizations of algorithm.

Degree: MA, 1966, Montana Tech

Subjects/Keywords: Algorithms.

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Schuman, E. L. (1966). Three characterizations of algorithm. (Masters Thesis). Montana Tech. Retrieved from https://scholarworks.umt.edu/etd/8190

Chicago Manual of Style (16th Edition):

Schuman, Elmer Luis. “Three characterizations of algorithm.” 1966. Masters Thesis, Montana Tech. Accessed April 25, 2019. https://scholarworks.umt.edu/etd/8190.

MLA Handbook (7th Edition):

Schuman, Elmer Luis. “Three characterizations of algorithm.” 1966. Web. 25 Apr 2019.

Vancouver:

Schuman EL. Three characterizations of algorithm. [Internet] [Masters thesis]. Montana Tech; 1966. [cited 2019 Apr 25]. Available from: https://scholarworks.umt.edu/etd/8190.

Council of Science Editors:

Schuman EL. Three characterizations of algorithm. [Masters Thesis]. Montana Tech; 1966. Available from: https://scholarworks.umt.edu/etd/8190


Oregon State University

19. Butler, Karen Jensen. An algorithm for determining the convex hull of N points in 3-space.

Degree: MS, Mathematics, 1963, Oregon State University

 An algorithm is described for determining the vertices and supporting planes (or lines) of the convex hull of a given set of N distinct points… (more)

Subjects/Keywords: Algorithms

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Butler, K. J. (1963). An algorithm for determining the convex hull of N points in 3-space. (Masters Thesis). Oregon State University. Retrieved from http://hdl.handle.net/1957/48642

Chicago Manual of Style (16th Edition):

Butler, Karen Jensen. “An algorithm for determining the convex hull of N points in 3-space.” 1963. Masters Thesis, Oregon State University. Accessed April 25, 2019. http://hdl.handle.net/1957/48642.

MLA Handbook (7th Edition):

Butler, Karen Jensen. “An algorithm for determining the convex hull of N points in 3-space.” 1963. Web. 25 Apr 2019.

Vancouver:

Butler KJ. An algorithm for determining the convex hull of N points in 3-space. [Internet] [Masters thesis]. Oregon State University; 1963. [cited 2019 Apr 25]. Available from: http://hdl.handle.net/1957/48642.

Council of Science Editors:

Butler KJ. An algorithm for determining the convex hull of N points in 3-space. [Masters Thesis]. Oregon State University; 1963. Available from: http://hdl.handle.net/1957/48642


Oregon State University

20. Anderson, Sandra Elaine. Some computational schemes equivalent to Turing machines.

Degree: MS, Mathematics, 1963, Oregon State University

Computational scheme, equivalence, and Turing machine are defined. Some computational schemes are examined and shown to be equivalent to the computational scheme of a Turing machine. Advisors/Committee Members: Goheen, Harry (advisor).

Subjects/Keywords: Algorithms

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Anderson, S. E. (1963). Some computational schemes equivalent to Turing machines. (Masters Thesis). Oregon State University. Retrieved from http://hdl.handle.net/1957/48819

Chicago Manual of Style (16th Edition):

Anderson, Sandra Elaine. “Some computational schemes equivalent to Turing machines.” 1963. Masters Thesis, Oregon State University. Accessed April 25, 2019. http://hdl.handle.net/1957/48819.

MLA Handbook (7th Edition):

Anderson, Sandra Elaine. “Some computational schemes equivalent to Turing machines.” 1963. Web. 25 Apr 2019.

Vancouver:

Anderson SE. Some computational schemes equivalent to Turing machines. [Internet] [Masters thesis]. Oregon State University; 1963. [cited 2019 Apr 25]. Available from: http://hdl.handle.net/1957/48819.

Council of Science Editors:

Anderson SE. Some computational schemes equivalent to Turing machines. [Masters Thesis]. Oregon State University; 1963. Available from: http://hdl.handle.net/1957/48819


Oregon State University

21. Comstock, Dale R. Machine algorithms for Boolean matrices.

Degree: MS, Mathematics, 1962, Oregon State University

Subjects/Keywords: Algorithms

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Comstock, D. R. (1962). Machine algorithms for Boolean matrices. (Masters Thesis). Oregon State University. Retrieved from http://hdl.handle.net/1957/49060

Chicago Manual of Style (16th Edition):

Comstock, Dale R. “Machine algorithms for Boolean matrices.” 1962. Masters Thesis, Oregon State University. Accessed April 25, 2019. http://hdl.handle.net/1957/49060.

MLA Handbook (7th Edition):

Comstock, Dale R. “Machine algorithms for Boolean matrices.” 1962. Web. 25 Apr 2019.

Vancouver:

Comstock DR. Machine algorithms for Boolean matrices. [Internet] [Masters thesis]. Oregon State University; 1962. [cited 2019 Apr 25]. Available from: http://hdl.handle.net/1957/49060.

Council of Science Editors:

Comstock DR. Machine algorithms for Boolean matrices. [Masters Thesis]. Oregon State University; 1962. Available from: http://hdl.handle.net/1957/49060


Oregon State University

22. Dum, Stephen Anthony. A fast division algorithm.

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

 A radix 2n non-restoring division algorithm is described. The algorithm is designed to be compatible with hardware multiprecision multiplication methods currectly used in high speed… (more)

Subjects/Keywords: Algorithms

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Dum, S. A. (1975). A fast division algorithm. (Doctoral Dissertation). Oregon State University. Retrieved from http://hdl.handle.net/1957/44160

Chicago Manual of Style (16th Edition):

Dum, Stephen Anthony. “A fast division algorithm.” 1975. Doctoral Dissertation, Oregon State University. Accessed April 25, 2019. http://hdl.handle.net/1957/44160.

MLA Handbook (7th Edition):

Dum, Stephen Anthony. “A fast division algorithm.” 1975. Web. 25 Apr 2019.

Vancouver:

Dum SA. A fast division algorithm. [Internet] [Doctoral dissertation]. Oregon State University; 1975. [cited 2019 Apr 25]. Available from: http://hdl.handle.net/1957/44160.

Council of Science Editors:

Dum SA. A fast division algorithm. [Doctoral Dissertation]. Oregon State University; 1975. Available from: http://hdl.handle.net/1957/44160


Oregon State University

23. Nelson, Thomas Clayton. Universal computing systems. Part 1, Simulation of any Normal Algorithm by Turing machine. Part 2, A universal Turing machine to translate any Turing machine to a Normal Algorithm.

Degree: PhD, Mathematics, 1969, Oregon State University

 In this paper a direct, constructive proof of the equivalence of the Normal Algorithm and Turing machine using the Turing machines NAS (Normal Algorithm Simulator)… (more)

Subjects/Keywords: Algorithms

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Nelson, T. C. (1969). Universal computing systems. Part 1, Simulation of any Normal Algorithm by Turing machine. Part 2, A universal Turing machine to translate any Turing machine to a Normal Algorithm. (Doctoral Dissertation). Oregon State University. Retrieved from http://hdl.handle.net/1957/17119

Chicago Manual of Style (16th Edition):

Nelson, Thomas Clayton. “Universal computing systems. Part 1, Simulation of any Normal Algorithm by Turing machine. Part 2, A universal Turing machine to translate any Turing machine to a Normal Algorithm.” 1969. Doctoral Dissertation, Oregon State University. Accessed April 25, 2019. http://hdl.handle.net/1957/17119.

MLA Handbook (7th Edition):

Nelson, Thomas Clayton. “Universal computing systems. Part 1, Simulation of any Normal Algorithm by Turing machine. Part 2, A universal Turing machine to translate any Turing machine to a Normal Algorithm.” 1969. Web. 25 Apr 2019.

Vancouver:

Nelson TC. Universal computing systems. Part 1, Simulation of any Normal Algorithm by Turing machine. Part 2, A universal Turing machine to translate any Turing machine to a Normal Algorithm. [Internet] [Doctoral dissertation]. Oregon State University; 1969. [cited 2019 Apr 25]. Available from: http://hdl.handle.net/1957/17119.

Council of Science Editors:

Nelson TC. Universal computing systems. Part 1, Simulation of any Normal Algorithm by Turing machine. Part 2, A universal Turing machine to translate any Turing machine to a Normal Algorithm. [Doctoral Dissertation]. Oregon State University; 1969. Available from: http://hdl.handle.net/1957/17119


Oregon State University

24. Weingarten, Frederick Wesley. On triangulations of fixed points in the plane.

Degree: PhD, Mathematics, 1966, Oregon State University

 A theory of straight line triangulations of points in the plane is developed. A basic transformation is presented, and it is shown that any triangulation… (more)

Subjects/Keywords: Algorithms

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Weingarten, F. W. (1966). On triangulations of fixed points in the plane. (Doctoral Dissertation). Oregon State University. Retrieved from http://hdl.handle.net/1957/17402

Chicago Manual of Style (16th Edition):

Weingarten, Frederick Wesley. “On triangulations of fixed points in the plane.” 1966. Doctoral Dissertation, Oregon State University. Accessed April 25, 2019. http://hdl.handle.net/1957/17402.

MLA Handbook (7th Edition):

Weingarten, Frederick Wesley. “On triangulations of fixed points in the plane.” 1966. Web. 25 Apr 2019.

Vancouver:

Weingarten FW. On triangulations of fixed points in the plane. [Internet] [Doctoral dissertation]. Oregon State University; 1966. [cited 2019 Apr 25]. Available from: http://hdl.handle.net/1957/17402.

Council of Science Editors:

Weingarten FW. On triangulations of fixed points in the plane. [Doctoral Dissertation]. Oregon State University; 1966. Available from: http://hdl.handle.net/1957/17402


Oregon State University

25. Balogh, Mária Edith Csermelyi. On scheduling algorithms.

Degree: PhD, Mathematics, 1964, Oregon State University

General techniques for constructing Scheduling Algorithms are described as well as their applications to two diverse problems, namely the scheduling at a university and the imitation of the activity of a taxonomist in microbiology. Advisors/Committee Members: Goheen, Harry E. (advisor).

Subjects/Keywords: Algorithms

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Balogh, M. E. C. (1964). On scheduling algorithms. (Doctoral Dissertation). Oregon State University. Retrieved from http://hdl.handle.net/1957/17457

Chicago Manual of Style (16th Edition):

Balogh, Mária Edith Csermelyi. “On scheduling algorithms.” 1964. Doctoral Dissertation, Oregon State University. Accessed April 25, 2019. http://hdl.handle.net/1957/17457.

MLA Handbook (7th Edition):

Balogh, Mária Edith Csermelyi. “On scheduling algorithms.” 1964. Web. 25 Apr 2019.

Vancouver:

Balogh MEC. On scheduling algorithms. [Internet] [Doctoral dissertation]. Oregon State University; 1964. [cited 2019 Apr 25]. Available from: http://hdl.handle.net/1957/17457.

Council of Science Editors:

Balogh MEC. On scheduling algorithms. [Doctoral Dissertation]. Oregon State University; 1964. Available from: http://hdl.handle.net/1957/17457


University of British Columbia

26. Kallberg, Jarl Gunnar. Implementable algorithms for stochastic nonlinear programs with applications to portfolio selection and revision .

Degree: 1979, University of British Columbia

 This dissertation has two main objectives: first, to develop efficient algorithms for the solution of one and two period constrained optimization problems, and second, to… (more)

Subjects/Keywords: Algorithms.

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Kallberg, J. G. (1979). Implementable algorithms for stochastic nonlinear programs with applications to portfolio selection and revision . (Thesis). University of British Columbia. Retrieved from http://hdl.handle.net/2429/22205

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

Kallberg, Jarl Gunnar. “Implementable algorithms for stochastic nonlinear programs with applications to portfolio selection and revision .” 1979. Thesis, University of British Columbia. Accessed April 25, 2019. http://hdl.handle.net/2429/22205.

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

MLA Handbook (7th Edition):

Kallberg, Jarl Gunnar. “Implementable algorithms for stochastic nonlinear programs with applications to portfolio selection and revision .” 1979. Web. 25 Apr 2019.

Vancouver:

Kallberg JG. Implementable algorithms for stochastic nonlinear programs with applications to portfolio selection and revision . [Internet] [Thesis]. University of British Columbia; 1979. [cited 2019 Apr 25]. Available from: http://hdl.handle.net/2429/22205.

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

Council of Science Editors:

Kallberg JG. Implementable algorithms for stochastic nonlinear programs with applications to portfolio selection and revision . [Thesis]. University of British Columbia; 1979. Available from: http://hdl.handle.net/2429/22205

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


University of British Columbia

27. Fitzpatrick, Gordon James. Variable metric methods without exact one- dimensional searches.

Degree: 1972, University of British Columbia

 The selection of updating formulas for the H matrix and the subproblem of one-dimensional search are considered for variable metric algorithms not using exact linear… (more)

Subjects/Keywords: Algorithms

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Fitzpatrick, G. J. (1972). Variable metric methods without exact one- dimensional searches. (Thesis). University of British Columbia. Retrieved from http://hdl.handle.net/2429/33336

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

Fitzpatrick, Gordon James. “Variable metric methods without exact one- dimensional searches. ” 1972. Thesis, University of British Columbia. Accessed April 25, 2019. http://hdl.handle.net/2429/33336.

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

MLA Handbook (7th Edition):

Fitzpatrick, Gordon James. “Variable metric methods without exact one- dimensional searches. ” 1972. Web. 25 Apr 2019.

Vancouver:

Fitzpatrick GJ. Variable metric methods without exact one- dimensional searches. [Internet] [Thesis]. University of British Columbia; 1972. [cited 2019 Apr 25]. Available from: http://hdl.handle.net/2429/33336.

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

Council of Science Editors:

Fitzpatrick GJ. Variable metric methods without exact one- dimensional searches. [Thesis]. University of British Columbia; 1972. Available from: http://hdl.handle.net/2429/33336

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


University of Waterloo

28. Boucher, Christina, Anne. Combinatorial and Probabilistic Approaches to Motif Recognition.

Degree: 2010, University of Waterloo

 Short substrings of genomic data that are responsible for biological processes, such as gene expression, are referred to as motifs. Motifs with the same function… (more)

Subjects/Keywords: bioinfotmatics; algorithms

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Boucher, Christina, A. (2010). Combinatorial and Probabilistic Approaches to Motif Recognition. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/5627

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

Boucher, Christina, Anne. “Combinatorial and Probabilistic Approaches to Motif Recognition.” 2010. Thesis, University of Waterloo. Accessed April 25, 2019. http://hdl.handle.net/10012/5627.

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

MLA Handbook (7th Edition):

Boucher, Christina, Anne. “Combinatorial and Probabilistic Approaches to Motif Recognition.” 2010. Web. 25 Apr 2019.

Vancouver:

Boucher, Christina A. Combinatorial and Probabilistic Approaches to Motif Recognition. [Internet] [Thesis]. University of Waterloo; 2010. [cited 2019 Apr 25]. Available from: http://hdl.handle.net/10012/5627.

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

Council of Science Editors:

Boucher, Christina A. Combinatorial and Probabilistic Approaches to Motif Recognition. [Thesis]. University of Waterloo; 2010. Available from: http://hdl.handle.net/10012/5627

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

29. Rush Jr., Larry Edward. FIRST-PRINCIPLES INVESTIGATION OF ELECTRONIC PROPERTIES IN SODIUM-ION ELECTROLYTES FOR SOLID-STATE BATTERY MATERIALS.

Degree: 2017, Wake Forest University

 This thesis mainly focuses on characterizing and understanding the electronic properties of sodium-ion electrolytes using first-principles calculations. The core of these calculations is built upon… (more)

Subjects/Keywords: Algorithms

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Rush Jr., L. E. (2017). FIRST-PRINCIPLES INVESTIGATION OF ELECTRONIC PROPERTIES IN SODIUM-ION ELECTROLYTES FOR SOLID-STATE BATTERY MATERIALS. (Thesis). Wake Forest University. Retrieved from http://hdl.handle.net/10339/82233

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

Rush Jr., Larry Edward. “FIRST-PRINCIPLES INVESTIGATION OF ELECTRONIC PROPERTIES IN SODIUM-ION ELECTROLYTES FOR SOLID-STATE BATTERY MATERIALS.” 2017. Thesis, Wake Forest University. Accessed April 25, 2019. http://hdl.handle.net/10339/82233.

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

MLA Handbook (7th Edition):

Rush Jr., Larry Edward. “FIRST-PRINCIPLES INVESTIGATION OF ELECTRONIC PROPERTIES IN SODIUM-ION ELECTROLYTES FOR SOLID-STATE BATTERY MATERIALS.” 2017. Web. 25 Apr 2019.

Vancouver:

Rush Jr. LE. FIRST-PRINCIPLES INVESTIGATION OF ELECTRONIC PROPERTIES IN SODIUM-ION ELECTROLYTES FOR SOLID-STATE BATTERY MATERIALS. [Internet] [Thesis]. Wake Forest University; 2017. [cited 2019 Apr 25]. Available from: http://hdl.handle.net/10339/82233.

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

Council of Science Editors:

Rush Jr. LE. FIRST-PRINCIPLES INVESTIGATION OF ELECTRONIC PROPERTIES IN SODIUM-ION ELECTROLYTES FOR SOLID-STATE BATTERY MATERIALS. [Thesis]. Wake Forest University; 2017. Available from: http://hdl.handle.net/10339/82233

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


Wake Forest University

30. Seal, Scott. Optimzing Web Application Fuzzing with Genetic Algorithms and Language Theory.

Degree: 2016, Wake Forest University

 The widespread availability and use of computing and internet resources require soft- ware developers to implement secure development standards and rigorous testing to prevent vulnerabilities.… (more)

Subjects/Keywords: evolutionary algorithms

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Seal, S. (2016). Optimzing Web Application Fuzzing with Genetic Algorithms and Language Theory. (Thesis). Wake Forest University. Retrieved from http://hdl.handle.net/10339/59321

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

Seal, Scott. “Optimzing Web Application Fuzzing with Genetic Algorithms and Language Theory.” 2016. Thesis, Wake Forest University. Accessed April 25, 2019. http://hdl.handle.net/10339/59321.

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

MLA Handbook (7th Edition):

Seal, Scott. “Optimzing Web Application Fuzzing with Genetic Algorithms and Language Theory.” 2016. Web. 25 Apr 2019.

Vancouver:

Seal S. Optimzing Web Application Fuzzing with Genetic Algorithms and Language Theory. [Internet] [Thesis]. Wake Forest University; 2016. [cited 2019 Apr 25]. Available from: http://hdl.handle.net/10339/59321.

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

Council of Science Editors:

Seal S. Optimzing Web Application Fuzzing with Genetic Algorithms and Language Theory. [Thesis]. Wake Forest University; 2016. Available from: http://hdl.handle.net/10339/59321

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

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

.