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 8893 total matches.

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

Search Limiters

Last 2 Years | English Only

Languages

Country

▼ Search Limiters

1. 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 September 18, 2020. 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. 18 Sep 2020.

Vancouver:

Ellis A. Emulators to facilitate the development and analysis of computationally expensive decision analytic models in health. [Internet] [Thesis]. Brown University; 2018. [cited 2020 Sep 18]. 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


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

Vancouver:

Rouse KMZ. ON THE EFFICIENCY OF ALGORITHMS FOR TENSOR DECOMPOSITIONS AND THEIR APPLICATIONS. [Internet] [Thesis]. Wake Forest University; 2018. [cited 2020 Sep 18]. 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


Rutgers University

3. Francisco, John-Austen. A novel characterization of signal space distortion and its application to the quantification of localization algorithm error.

Degree: PhD, Computer Science, 2015, Rutgers University

The constant reduction in cost and increase in the power of computing machinery has resulted in an ever-increasing interest and deployment of Internet-enabled sensing systems.… (more)

Subjects/Keywords: Algorithms

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Francisco, J. (2015). A novel characterization of signal space distortion and its application to the quantification of localization algorithm error. (Doctoral Dissertation). Rutgers University. Retrieved from https://rucore.libraries.rutgers.edu/rutgers-lib/48489/

Chicago Manual of Style (16th Edition):

Francisco, John-Austen. “A novel characterization of signal space distortion and its application to the quantification of localization algorithm error.” 2015. Doctoral Dissertation, Rutgers University. Accessed September 18, 2020. https://rucore.libraries.rutgers.edu/rutgers-lib/48489/.

MLA Handbook (7th Edition):

Francisco, John-Austen. “A novel characterization of signal space distortion and its application to the quantification of localization algorithm error.” 2015. Web. 18 Sep 2020.

Vancouver:

Francisco J. A novel characterization of signal space distortion and its application to the quantification of localization algorithm error. [Internet] [Doctoral dissertation]. Rutgers University; 2015. [cited 2020 Sep 18]. Available from: https://rucore.libraries.rutgers.edu/rutgers-lib/48489/.

Council of Science Editors:

Francisco J. A novel characterization of signal space distortion and its application to the quantification of localization algorithm error. [Doctoral Dissertation]. Rutgers University; 2015. Available from: https://rucore.libraries.rutgers.edu/rutgers-lib/48489/


University of Alberta

4. 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 September 18, 2020. https://era.library.ualberta.ca/files/3484zk37r.

MLA Handbook (7th Edition):

Li, Liwu. “Probabilistic analysis of search.” 1989. Web. 18 Sep 2020.

Vancouver:

Li L. Probabilistic analysis of search. [Internet] [Doctoral dissertation]. University of Alberta; 1989. [cited 2020 Sep 18]. 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


Oregon State University

5. 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 September 18, 2020. http://hdl.handle.net/1957/43858.

MLA Handbook (7th Edition):

Miyakawa, Yoshihiro. “Development of network location algorithm for resource planning and management.” 1978. Web. 18 Sep 2020.

Vancouver:

Miyakawa Y. Development of network location algorithm for resource planning and management. [Internet] [Masters thesis]. Oregon State University; 1978. [cited 2020 Sep 18]. 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

6. 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 September 18, 2020. 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. 18 Sep 2020.

Vancouver:

Jang JE. Design and analysis of robust algorithms for fault tolerant computing. [Internet] [Doctoral dissertation]. Oregon State University; 1990. [cited 2020 Sep 18]. 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


Nelson Mandela Metropolitan University

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

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

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

Subjects/Keywords: Computer algorithms

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

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

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

Chicago Manual of Style (16th Edition):

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

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

MLA Handbook (7th Edition):

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

Vancouver:

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


Cornell University

8. Novikoff, Timothy. Algorithmic Education Theory.

Degree: PhD, Applied Mathematics, 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. (Doctoral Dissertation). Cornell University. Retrieved from http://hdl.handle.net/1813/33956

Chicago Manual of Style (16th Edition):

Novikoff, Timothy. “Algorithmic Education Theory.” 2013. Doctoral Dissertation, Cornell University. Accessed September 18, 2020. http://hdl.handle.net/1813/33956.

MLA Handbook (7th Edition):

Novikoff, Timothy. “Algorithmic Education Theory.” 2013. Web. 18 Sep 2020.

Vancouver:

Novikoff T. Algorithmic Education Theory. [Internet] [Doctoral dissertation]. Cornell University; 2013. [cited 2020 Sep 18]. Available from: http://hdl.handle.net/1813/33956.

Council of Science Editors:

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

9. 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 September 18, 2020. 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. 18 Sep 2020.

Vancouver:

Satishkumar MV. Simultaneous scheduling of machines and Agvs using evolutionary optimization algorithms. [Internet] [Thesis]. Jawaharlal Nehru Technological University; 2010. [cited 2020 Sep 18]. 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

10. 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 September 18, 2020. 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. 18 Sep 2020.

Vancouver:

Pearce RA. Scalable Parallel Algorithms for Massive Scale-free Graphs. [Internet] [Thesis]. Texas Digital Library; 2013. [cited 2020 Sep 18]. 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


Texas A&M University

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

Degree: PhD, Computer Science, 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. (Doctoral Dissertation). Texas A&M University. Retrieved from http://hdl.handle.net/1969.1/155629

Chicago Manual of Style (16th Edition):

Crosby, Ralph. “Phylogenetic Divergence Time, Algorithms for Improved Accuracy and Performance.” 2015. Doctoral Dissertation, Texas A&M University. Accessed September 18, 2020. http://hdl.handle.net/1969.1/155629.

MLA Handbook (7th Edition):

Crosby, Ralph. “Phylogenetic Divergence Time, Algorithms for Improved Accuracy and Performance.” 2015. Web. 18 Sep 2020.

Vancouver:

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

Council of Science Editors:

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

12. Calciu, Irina. Concurrent Algorithms for Emerging Hardware Platforms.

Degree: PhD, Computer Science, 2015, Brown University

 Computer architecture has recently seen an explosion of innovation that has enabled more parallel execution, while parallel software systems have been making strides in providing… (more)

Subjects/Keywords: concurrent algorithms

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Calciu, I. (2015). Concurrent Algorithms for Emerging Hardware Platforms. (Doctoral Dissertation). Brown University. Retrieved from https://repository.library.brown.edu/studio/item/bdr:419436/

Chicago Manual of Style (16th Edition):

Calciu, Irina. “Concurrent Algorithms for Emerging Hardware Platforms.” 2015. Doctoral Dissertation, Brown University. Accessed September 18, 2020. https://repository.library.brown.edu/studio/item/bdr:419436/.

MLA Handbook (7th Edition):

Calciu, Irina. “Concurrent Algorithms for Emerging Hardware Platforms.” 2015. Web. 18 Sep 2020.

Vancouver:

Calciu I. Concurrent Algorithms for Emerging Hardware Platforms. [Internet] [Doctoral dissertation]. Brown University; 2015. [cited 2020 Sep 18]. Available from: https://repository.library.brown.edu/studio/item/bdr:419436/.

Council of Science Editors:

Calciu I. Concurrent Algorithms for Emerging Hardware Platforms. [Doctoral Dissertation]. Brown University; 2015. Available from: https://repository.library.brown.edu/studio/item/bdr:419436/


University of British Columbia

13. 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 September 18, 2020. 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. 18 Sep 2020.

Vancouver:

Kallberg JG. Implementable algorithms for stochastic nonlinear programs with applications to portfolio selection and revision . [Internet] [Thesis]. University of British Columbia; 1979. [cited 2020 Sep 18]. 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

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

…functional descriptors in random logic design algorithms [BBH+88, MB90]. The size of the… …representation impacts the efficiency of such design algorithms. Two-level logic design is much easier… …parameters, Some two-level minimization algorithms work directly with existing covers, per­ C H A… …a high-level “template” into which lower level algorithms are inserted, Alba, the… …T R O D U C T IO N 6 The efficacy of the methods, techniques, and algorithms reported… 

Page 1 Page 2 Page 3 Page 4 Page 5 Page 6 Page 7

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

Vancouver:

Whitney MJ. Minterm based search algorithms for two-level minimization of discrete functions. [Internet] [Thesis]. University of Victoria; 2018. [cited 2020 Sep 18]. 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

15. 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 September 18, 2020. 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. 18 Sep 2020.

Vancouver:

Seal S. Optimzing Web Application Fuzzing with Genetic Algorithms and Language Theory. [Internet] [Thesis]. Wake Forest University; 2016. [cited 2020 Sep 18]. 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

16. 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 September 18, 2020. 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. 18 Sep 2020.

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 2020 Sep 18]. 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


Oregon State University

17. 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 September 18, 2020. 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. 18 Sep 2020.

Vancouver:

Butler KJ. An algorithm for determining the convex hull of N points in 3-space. [Internet] [Masters thesis]. Oregon State University; 1963. [cited 2020 Sep 18]. 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

18. 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 September 18, 2020. http://hdl.handle.net/1957/48819.

MLA Handbook (7th Edition):

Anderson, Sandra Elaine. “Some computational schemes equivalent to Turing machines.” 1963. Web. 18 Sep 2020.

Vancouver:

Anderson SE. Some computational schemes equivalent to Turing machines. [Internet] [Masters thesis]. Oregon State University; 1963. [cited 2020 Sep 18]. 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

19. 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 September 18, 2020. http://hdl.handle.net/1957/49060.

MLA Handbook (7th Edition):

Comstock, Dale R. “Machine algorithms for Boolean matrices.” 1962. Web. 18 Sep 2020.

Vancouver:

Comstock DR. Machine algorithms for Boolean matrices. [Internet] [Masters thesis]. Oregon State University; 1962. [cited 2020 Sep 18]. 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

20. 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 September 18, 2020. http://hdl.handle.net/1957/44160.

MLA Handbook (7th Edition):

Dum, Stephen Anthony. “A fast division algorithm.” 1975. Web. 18 Sep 2020.

Vancouver:

Dum SA. A fast division algorithm. [Internet] [Doctoral dissertation]. Oregon State University; 1975. [cited 2020 Sep 18]. 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

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

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 2020 Sep 18]. 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

22. 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 September 18, 2020. http://hdl.handle.net/1957/17402.

MLA Handbook (7th Edition):

Weingarten, Frederick Wesley. “On triangulations of fixed points in the plane.” 1966. Web. 18 Sep 2020.

Vancouver:

Weingarten FW. On triangulations of fixed points in the plane. [Internet] [Doctoral dissertation]. Oregon State University; 1966. [cited 2020 Sep 18]. 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

23. 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 September 18, 2020. http://hdl.handle.net/1957/17457.

MLA Handbook (7th Edition):

Balogh, Mária Edith Csermelyi. “On scheduling algorithms.” 1964. Web. 18 Sep 2020.

Vancouver:

Balogh MEC. On scheduling algorithms. [Internet] [Doctoral dissertation]. Oregon State University; 1964. [cited 2020 Sep 18]. 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


Rutgers University

24. Dean, Walter H. What algorithms could not be.

Degree: PhD, Philosophy, 2007, Rutgers University

This dissertation addresses a variety of foundational issues pertaining to the notion of algorithm employed in mathematics and computer science. In these settings, an algorithm… (more)

Subjects/Keywords: Algorithms

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Dean, W. H. (2007). What algorithms could not be. (Doctoral Dissertation). Rutgers University. Retrieved from http://hdl.rutgers.edu/1782.2/rucore10001600001.ETD.15811

Chicago Manual of Style (16th Edition):

Dean, Walter H. “What algorithms could not be.” 2007. Doctoral Dissertation, Rutgers University. Accessed September 18, 2020. http://hdl.rutgers.edu/1782.2/rucore10001600001.ETD.15811.

MLA Handbook (7th Edition):

Dean, Walter H. “What algorithms could not be.” 2007. Web. 18 Sep 2020.

Vancouver:

Dean WH. What algorithms could not be. [Internet] [Doctoral dissertation]. Rutgers University; 2007. [cited 2020 Sep 18]. Available from: http://hdl.rutgers.edu/1782.2/rucore10001600001.ETD.15811.

Council of Science Editors:

Dean WH. What algorithms could not be. [Doctoral Dissertation]. Rutgers University; 2007. Available from: http://hdl.rutgers.edu/1782.2/rucore10001600001.ETD.15811


Rutgers University

25. Le, Long T., 1985. Minimizing dissemination on large graphs.

Degree: MS, Computer Science, 2015, Rutgers University

 Given the topology of a graph G and a budget k, can we quickly find the best k edges to delete that minimize dissemination on… (more)

Subjects/Keywords: Topology; Algorithms

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Le, Long T., 1. (2015). Minimizing dissemination on large graphs. (Masters Thesis). Rutgers University. Retrieved from https://rucore.libraries.rutgers.edu/rutgers-lib/46381/

Chicago Manual of Style (16th Edition):

Le, Long T., 1985. “Minimizing dissemination on large graphs.” 2015. Masters Thesis, Rutgers University. Accessed September 18, 2020. https://rucore.libraries.rutgers.edu/rutgers-lib/46381/.

MLA Handbook (7th Edition):

Le, Long T., 1985. “Minimizing dissemination on large graphs.” 2015. Web. 18 Sep 2020.

Vancouver:

Le, Long T. 1. Minimizing dissemination on large graphs. [Internet] [Masters thesis]. Rutgers University; 2015. [cited 2020 Sep 18]. Available from: https://rucore.libraries.rutgers.edu/rutgers-lib/46381/.

Council of Science Editors:

Le, Long T. 1. Minimizing dissemination on large graphs. [Masters Thesis]. Rutgers University; 2015. Available from: https://rucore.libraries.rutgers.edu/rutgers-lib/46381/


Michigan State University

26. Lin, Tsung-Ming. Optimal bounding ellipsoid algorithms with automatic bound estimation.

Degree: PhD, Department of Electrical Engineering, 1996, Michigan State University

Subjects/Keywords: Algorithms

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Lin, T. (1996). Optimal bounding ellipsoid algorithms with automatic bound estimation. (Doctoral Dissertation). Michigan State University. Retrieved from http://etd.lib.msu.edu/islandora/object/etd:26165

Chicago Manual of Style (16th Edition):

Lin, Tsung-Ming. “Optimal bounding ellipsoid algorithms with automatic bound estimation.” 1996. Doctoral Dissertation, Michigan State University. Accessed September 18, 2020. http://etd.lib.msu.edu/islandora/object/etd:26165.

MLA Handbook (7th Edition):

Lin, Tsung-Ming. “Optimal bounding ellipsoid algorithms with automatic bound estimation.” 1996. Web. 18 Sep 2020.

Vancouver:

Lin T. Optimal bounding ellipsoid algorithms with automatic bound estimation. [Internet] [Doctoral dissertation]. Michigan State University; 1996. [cited 2020 Sep 18]. Available from: http://etd.lib.msu.edu/islandora/object/etd:26165.

Council of Science Editors:

Lin T. Optimal bounding ellipsoid algorithms with automatic bound estimation. [Doctoral Dissertation]. Michigan State University; 1996. Available from: http://etd.lib.msu.edu/islandora/object/etd:26165


Michigan State University

27. Guthery, Scott B. An inversion algorithm for one-dimensional F-expansions.

Degree: PhD, Department of Statistics and Probability, 1969, Michigan State University

Subjects/Keywords: Algorithms

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Guthery, S. B. (1969). An inversion algorithm for one-dimensional F-expansions. (Doctoral Dissertation). Michigan State University. Retrieved from http://etd.lib.msu.edu/islandora/object/etd:40636

Chicago Manual of Style (16th Edition):

Guthery, Scott B. “An inversion algorithm for one-dimensional F-expansions.” 1969. Doctoral Dissertation, Michigan State University. Accessed September 18, 2020. http://etd.lib.msu.edu/islandora/object/etd:40636.

MLA Handbook (7th Edition):

Guthery, Scott B. “An inversion algorithm for one-dimensional F-expansions.” 1969. Web. 18 Sep 2020.

Vancouver:

Guthery SB. An inversion algorithm for one-dimensional F-expansions. [Internet] [Doctoral dissertation]. Michigan State University; 1969. [cited 2020 Sep 18]. Available from: http://etd.lib.msu.edu/islandora/object/etd:40636.

Council of Science Editors:

Guthery SB. An inversion algorithm for one-dimensional F-expansions. [Doctoral Dissertation]. Michigan State University; 1969. Available from: http://etd.lib.msu.edu/islandora/object/etd:40636


Michigan State University

28. Joachim, Dale. Multiweight optimization in optimal bounding ellipsoid algorithms.

Degree: PhD, Department of Electrical Engineering, 1998, Michigan State University

Subjects/Keywords: Algorithms

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Joachim, D. (1998). Multiweight optimization in optimal bounding ellipsoid algorithms. (Doctoral Dissertation). Michigan State University. Retrieved from http://etd.lib.msu.edu/islandora/object/etd:27819

Chicago Manual of Style (16th Edition):

Joachim, Dale. “Multiweight optimization in optimal bounding ellipsoid algorithms.” 1998. Doctoral Dissertation, Michigan State University. Accessed September 18, 2020. http://etd.lib.msu.edu/islandora/object/etd:27819.

MLA Handbook (7th Edition):

Joachim, Dale. “Multiweight optimization in optimal bounding ellipsoid algorithms.” 1998. Web. 18 Sep 2020.

Vancouver:

Joachim D. Multiweight optimization in optimal bounding ellipsoid algorithms. [Internet] [Doctoral dissertation]. Michigan State University; 1998. [cited 2020 Sep 18]. Available from: http://etd.lib.msu.edu/islandora/object/etd:27819.

Council of Science Editors:

Joachim D. Multiweight optimization in optimal bounding ellipsoid algorithms. [Doctoral Dissertation]. Michigan State University; 1998. Available from: http://etd.lib.msu.edu/islandora/object/etd:27819


University of Ontario Institute of Technology

29. Tanaka, Richard. A few randomized protocols in peer-to-peer networks.

Degree: 2019, University of Ontario Institute of Technology

 This thesis studies a few randomized algorithms in application-layer peer-to-peer networks. The significant gain in scalability and resilience that peer-to-peer networks provide has made them… (more)

Subjects/Keywords: Random; Algorithms

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Tanaka, R. (2019). A few randomized protocols in peer-to-peer networks. (Thesis). University of Ontario Institute of Technology. Retrieved from http://hdl.handle.net/10155/1092

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

Tanaka, Richard. “A few randomized protocols in peer-to-peer networks.” 2019. Thesis, University of Ontario Institute of Technology. Accessed September 18, 2020. http://hdl.handle.net/10155/1092.

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

MLA Handbook (7th Edition):

Tanaka, Richard. “A few randomized protocols in peer-to-peer networks.” 2019. Web. 18 Sep 2020.

Vancouver:

Tanaka R. A few randomized protocols in peer-to-peer networks. [Internet] [Thesis]. University of Ontario Institute of Technology; 2019. [cited 2020 Sep 18]. Available from: http://hdl.handle.net/10155/1092.

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

Council of Science Editors:

Tanaka R. A few randomized protocols in peer-to-peer networks. [Thesis]. University of Ontario Institute of Technology; 2019. Available from: http://hdl.handle.net/10155/1092

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


University of British Columbia

30. 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 September 18, 2020. 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. 18 Sep 2020.

Vancouver:

Fitzpatrick GJ. Variable metric methods without exact one- dimensional searches. [Internet] [Thesis]. University of British Columbia; 1972. [cited 2020 Sep 18]. 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

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

.