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

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

Search Limiters

Last 2 Years | English Only

Degrees

Levels

Languages

Country

▼ Search Limiters


University of Georgia

1. Wu, Jianbao. Spherical splines for Hermite interpolation and surface design.

Degree: PhD, Mathematics, 2007, University of Georgia

 The following dissertation consists of two parts. Throughout this dissertation, we assume that the spherical triangulation could be a part of a sphere with or… (more)

Subjects/Keywords: Approximation

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Wu, J. (2007). Spherical splines for Hermite interpolation and surface design. (Doctoral Dissertation). University of Georgia. Retrieved from http://purl.galileo.usg.edu/uga_etd/wu_jianbao_200708_phd

Chicago Manual of Style (16th Edition):

Wu, Jianbao. “Spherical splines for Hermite interpolation and surface design.” 2007. Doctoral Dissertation, University of Georgia. Accessed April 21, 2019. http://purl.galileo.usg.edu/uga_etd/wu_jianbao_200708_phd.

MLA Handbook (7th Edition):

Wu, Jianbao. “Spherical splines for Hermite interpolation and surface design.” 2007. Web. 21 Apr 2019.

Vancouver:

Wu J. Spherical splines for Hermite interpolation and surface design. [Internet] [Doctoral dissertation]. University of Georgia; 2007. [cited 2019 Apr 21]. Available from: http://purl.galileo.usg.edu/uga_etd/wu_jianbao_200708_phd.

Council of Science Editors:

Wu J. Spherical splines for Hermite interpolation and surface design. [Doctoral Dissertation]. University of Georgia; 2007. Available from: http://purl.galileo.usg.edu/uga_etd/wu_jianbao_200708_phd


Università della Svizzera italiana

2. Weyland, Dennis. Stochastic vehicle routing: from theory to practice.

Degree: 2013, Università della Svizzera italiana

 In this thesis we discuss practical and theoretical aspects of various stochastic vehicle routing problems. These are combinatorial optimization problems related to the field of… (more)

Subjects/Keywords: Approximation

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Weyland, D. (2013). Stochastic vehicle routing: from theory to practice. (Thesis). Università della Svizzera italiana. Retrieved from http://doc.rero.ch/record/77740

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

Weyland, Dennis. “Stochastic vehicle routing: from theory to practice.” 2013. Thesis, Università della Svizzera italiana. Accessed April 21, 2019. http://doc.rero.ch/record/77740.

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

MLA Handbook (7th Edition):

Weyland, Dennis. “Stochastic vehicle routing: from theory to practice.” 2013. Web. 21 Apr 2019.

Vancouver:

Weyland D. Stochastic vehicle routing: from theory to practice. [Internet] [Thesis]. Università della Svizzera italiana; 2013. [cited 2019 Apr 21]. Available from: http://doc.rero.ch/record/77740.

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

Council of Science Editors:

Weyland D. Stochastic vehicle routing: from theory to practice. [Thesis]. Università della Svizzera italiana; 2013. Available from: http://doc.rero.ch/record/77740

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


University of Georgia

3. Zhuang, Chao. Stochastic approximation methods and applications in financial optimization problems.

Degree: PhD, Mathematics, 2008, University of Georgia

 Optimizations play an increasingly indispensable role in financial decisions and financial models. Many problems in mathematical finance, such as asset allocation, trading strategy, and derivative… (more)

Subjects/Keywords: Stochastic Approximation

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Zhuang, C. (2008). Stochastic approximation methods and applications in financial optimization problems. (Doctoral Dissertation). University of Georgia. Retrieved from http://purl.galileo.usg.edu/uga_etd/zhuang_chao_200808_phd

Chicago Manual of Style (16th Edition):

Zhuang, Chao. “Stochastic approximation methods and applications in financial optimization problems.” 2008. Doctoral Dissertation, University of Georgia. Accessed April 21, 2019. http://purl.galileo.usg.edu/uga_etd/zhuang_chao_200808_phd.

MLA Handbook (7th Edition):

Zhuang, Chao. “Stochastic approximation methods and applications in financial optimization problems.” 2008. Web. 21 Apr 2019.

Vancouver:

Zhuang C. Stochastic approximation methods and applications in financial optimization problems. [Internet] [Doctoral dissertation]. University of Georgia; 2008. [cited 2019 Apr 21]. Available from: http://purl.galileo.usg.edu/uga_etd/zhuang_chao_200808_phd.

Council of Science Editors:

Zhuang C. Stochastic approximation methods and applications in financial optimization problems. [Doctoral Dissertation]. University of Georgia; 2008. Available from: http://purl.galileo.usg.edu/uga_etd/zhuang_chao_200808_phd


Texas A&M University

4. Cheng, Yichen. Stochastic Approximation and Its Application in MCMC.

Degree: 2013, Texas A&M University

 Stochastic approximation has been widely used since first proposed by Herbert Robbins and Sutton Monro in 1951. It is an iterative stochastic method that attempts… (more)

Subjects/Keywords: stochastic approximation

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Cheng, Y. (2013). Stochastic Approximation and Its Application in MCMC. (Thesis). Texas A&M University. Retrieved from http://hdl.handle.net/1969.1/151016

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

Cheng, Yichen. “Stochastic Approximation and Its Application in MCMC.” 2013. Thesis, Texas A&M University. Accessed April 21, 2019. http://hdl.handle.net/1969.1/151016.

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

MLA Handbook (7th Edition):

Cheng, Yichen. “Stochastic Approximation and Its Application in MCMC.” 2013. Web. 21 Apr 2019.

Vancouver:

Cheng Y. Stochastic Approximation and Its Application in MCMC. [Internet] [Thesis]. Texas A&M University; 2013. [cited 2019 Apr 21]. Available from: http://hdl.handle.net/1969.1/151016.

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

Council of Science Editors:

Cheng Y. Stochastic Approximation and Its Application in MCMC. [Thesis]. Texas A&M University; 2013. Available from: http://hdl.handle.net/1969.1/151016

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


McGill University

5. Gallego-Planas, Núria. Calculations on Metal Organic Compounds Using the Self-Interaction Corrected Local Density Approximation Method.

Degree: PhD, Department of Chemistry, 1994, McGill University

Note:

Self-consistent field calculations using the Self-Interaction corrected Local Density Approximation method (SIC-LDA) were performed to study different series of organometallic compounds that present peculiar… (more)

Subjects/Keywords: Approximation

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Gallego-Planas, N. (1994). Calculations on Metal Organic Compounds Using the Self-Interaction Corrected Local Density Approximation Method. (Doctoral Dissertation). McGill University. Retrieved from http://digitool.library.mcgill.ca/thesisfile156868.pdf

Chicago Manual of Style (16th Edition):

Gallego-Planas, Núria. “Calculations on Metal Organic Compounds Using the Self-Interaction Corrected Local Density Approximation Method.” 1994. Doctoral Dissertation, McGill University. Accessed April 21, 2019. http://digitool.library.mcgill.ca/thesisfile156868.pdf.

MLA Handbook (7th Edition):

Gallego-Planas, Núria. “Calculations on Metal Organic Compounds Using the Self-Interaction Corrected Local Density Approximation Method.” 1994. Web. 21 Apr 2019.

Vancouver:

Gallego-Planas N. Calculations on Metal Organic Compounds Using the Self-Interaction Corrected Local Density Approximation Method. [Internet] [Doctoral dissertation]. McGill University; 1994. [cited 2019 Apr 21]. Available from: http://digitool.library.mcgill.ca/thesisfile156868.pdf.

Council of Science Editors:

Gallego-Planas N. Calculations on Metal Organic Compounds Using the Self-Interaction Corrected Local Density Approximation Method. [Doctoral Dissertation]. McGill University; 1994. Available from: http://digitool.library.mcgill.ca/thesisfile156868.pdf


University of Manitoba

6. Klurman, Oleksiy. On constrained Markov-Nikolskii and Bernstein type inequalities.

Degree: Mathematics, 2011, University of Manitoba

 This thesis is devoted to polynomial inequalities with constraints. We present a history of the development of this subject together with recent progress. In the… (more)

Subjects/Keywords: Approximation; Polynomials

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Klurman, O. (2011). On constrained Markov-Nikolskii and Bernstein type inequalities. (Masters Thesis). University of Manitoba. Retrieved from http://hdl.handle.net/1993/4820

Chicago Manual of Style (16th Edition):

Klurman, Oleksiy. “On constrained Markov-Nikolskii and Bernstein type inequalities.” 2011. Masters Thesis, University of Manitoba. Accessed April 21, 2019. http://hdl.handle.net/1993/4820.

MLA Handbook (7th Edition):

Klurman, Oleksiy. “On constrained Markov-Nikolskii and Bernstein type inequalities.” 2011. Web. 21 Apr 2019.

Vancouver:

Klurman O. On constrained Markov-Nikolskii and Bernstein type inequalities. [Internet] [Masters thesis]. University of Manitoba; 2011. [cited 2019 Apr 21]. Available from: http://hdl.handle.net/1993/4820.

Council of Science Editors:

Klurman O. On constrained Markov-Nikolskii and Bernstein type inequalities. [Masters Thesis]. University of Manitoba; 2011. Available from: http://hdl.handle.net/1993/4820


Rutgers University

7. Li, Jixin. Saddle point approximation:.

Degree: PhD, Statistics and Biostatistics, 2009, Rutgers University

We extend known saddlepoint tail probability approximations to multivariate cases, including multivariate conditional cases. Our first approximation applies to both continuous and lattice variables, and… (more)

Subjects/Keywords: Approximation theory

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Li, J. (2009). Saddle point approximation:. (Doctoral Dissertation). Rutgers University. Retrieved from http://hdl.rutgers.edu/1782.2/rucore10001600001.ETD.000051043

Chicago Manual of Style (16th Edition):

Li, Jixin. “Saddle point approximation:.” 2009. Doctoral Dissertation, Rutgers University. Accessed April 21, 2019. http://hdl.rutgers.edu/1782.2/rucore10001600001.ETD.000051043.

MLA Handbook (7th Edition):

Li, Jixin. “Saddle point approximation:.” 2009. Web. 21 Apr 2019.

Vancouver:

Li J. Saddle point approximation:. [Internet] [Doctoral dissertation]. Rutgers University; 2009. [cited 2019 Apr 21]. Available from: http://hdl.rutgers.edu/1782.2/rucore10001600001.ETD.000051043.

Council of Science Editors:

Li J. Saddle point approximation:. [Doctoral Dissertation]. Rutgers University; 2009. Available from: http://hdl.rutgers.edu/1782.2/rucore10001600001.ETD.000051043


McMaster University

8. Lenarcic, Adam. Rough Sets, Similarity, and Optimal Approximations.

Degree: PhD, 2017, McMaster University

Rough sets have been studied for over 30 years, and the basic concepts of lower and upper approximations have been analysed in detail, yet nowhere… (more)

Subjects/Keywords: Approximation; Rough Sets; Similarity; Optimal Approximation

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Lenarcic, A. (2017). Rough Sets, Similarity, and Optimal Approximations. (Doctoral Dissertation). McMaster University. Retrieved from http://hdl.handle.net/11375/22245

Chicago Manual of Style (16th Edition):

Lenarcic, Adam. “Rough Sets, Similarity, and Optimal Approximations.” 2017. Doctoral Dissertation, McMaster University. Accessed April 21, 2019. http://hdl.handle.net/11375/22245.

MLA Handbook (7th Edition):

Lenarcic, Adam. “Rough Sets, Similarity, and Optimal Approximations.” 2017. Web. 21 Apr 2019.

Vancouver:

Lenarcic A. Rough Sets, Similarity, and Optimal Approximations. [Internet] [Doctoral dissertation]. McMaster University; 2017. [cited 2019 Apr 21]. Available from: http://hdl.handle.net/11375/22245.

Council of Science Editors:

Lenarcic A. Rough Sets, Similarity, and Optimal Approximations. [Doctoral Dissertation]. McMaster University; 2017. Available from: http://hdl.handle.net/11375/22245


Kansas State University

9. Alrayes, Norah Mousa. Approximation of p-modulus in the plane with discrete grids.

Degree: PhD, Department of Mathematics, 2018, Kansas State University

 This thesis contains four chapters. In the first chapter, the theory of continuous p-modulus in the plane is introduced and the background p-modulus properties are… (more)

Subjects/Keywords: Mathematics; Modulus; Approximation

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Alrayes, N. M. (2018). Approximation of p-modulus in the plane with discrete grids. (Doctoral Dissertation). Kansas State University. Retrieved from http://hdl.handle.net/2097/38767

Chicago Manual of Style (16th Edition):

Alrayes, Norah Mousa. “Approximation of p-modulus in the plane with discrete grids.” 2018. Doctoral Dissertation, Kansas State University. Accessed April 21, 2019. http://hdl.handle.net/2097/38767.

MLA Handbook (7th Edition):

Alrayes, Norah Mousa. “Approximation of p-modulus in the plane with discrete grids.” 2018. Web. 21 Apr 2019.

Vancouver:

Alrayes NM. Approximation of p-modulus in the plane with discrete grids. [Internet] [Doctoral dissertation]. Kansas State University; 2018. [cited 2019 Apr 21]. Available from: http://hdl.handle.net/2097/38767.

Council of Science Editors:

Alrayes NM. Approximation of p-modulus in the plane with discrete grids. [Doctoral Dissertation]. Kansas State University; 2018. Available from: http://hdl.handle.net/2097/38767

10. Das, Aparna. Approximation Schemes for Euclidean Vehicle Routing Problems.

Degree: PhD, Computer Science, 2011, Brown University

 Vehicle routing is a class of optimization problems where the objective is to find low cost delivery routes from depots to customers using vehicles of… (more)

Subjects/Keywords: Geometric Approximation Algorithms

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Das, A. (2011). Approximation Schemes for Euclidean Vehicle Routing Problems. (Doctoral Dissertation). Brown University. Retrieved from https://repository.library.brown.edu/studio/item/bdr:11205/

Chicago Manual of Style (16th Edition):

Das, Aparna. “Approximation Schemes for Euclidean Vehicle Routing Problems.” 2011. Doctoral Dissertation, Brown University. Accessed April 21, 2019. https://repository.library.brown.edu/studio/item/bdr:11205/.

MLA Handbook (7th Edition):

Das, Aparna. “Approximation Schemes for Euclidean Vehicle Routing Problems.” 2011. Web. 21 Apr 2019.

Vancouver:

Das A. Approximation Schemes for Euclidean Vehicle Routing Problems. [Internet] [Doctoral dissertation]. Brown University; 2011. [cited 2019 Apr 21]. Available from: https://repository.library.brown.edu/studio/item/bdr:11205/.

Council of Science Editors:

Das A. Approximation Schemes for Euclidean Vehicle Routing Problems. [Doctoral Dissertation]. Brown University; 2011. Available from: https://repository.library.brown.edu/studio/item/bdr:11205/

11. Sharifi, Fatemeh. Uniform Approximation on Riemann Surfaces.

Degree: 2016, University of Western Ontario

 This thesis consists of three contributions to the theory of complex approximation on Riemann surfaces. It is known that if E is a closed subset… (more)

Subjects/Keywords: Riemann Surfaces; Holomorphic approximation; Meromorphic approximation; zero-free approximation; Analysis

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Sharifi, F. (2016). Uniform Approximation on Riemann Surfaces. (Thesis). University of Western Ontario. Retrieved from https://ir.lib.uwo.ca/etd/3954

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

Sharifi, Fatemeh. “Uniform Approximation on Riemann Surfaces.” 2016. Thesis, University of Western Ontario. Accessed April 21, 2019. https://ir.lib.uwo.ca/etd/3954.

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

MLA Handbook (7th Edition):

Sharifi, Fatemeh. “Uniform Approximation on Riemann Surfaces.” 2016. Web. 21 Apr 2019.

Vancouver:

Sharifi F. Uniform Approximation on Riemann Surfaces. [Internet] [Thesis]. University of Western Ontario; 2016. [cited 2019 Apr 21]. Available from: https://ir.lib.uwo.ca/etd/3954.

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

Council of Science Editors:

Sharifi F. Uniform Approximation on Riemann Surfaces. [Thesis]. University of Western Ontario; 2016. Available from: https://ir.lib.uwo.ca/etd/3954

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

12. Goel, Deepti. A study on the growth of entire Functions by means of Polinomil Approximation and Interpolation;.

Degree: Mathematics, 2011, Chaudhary Charan Singh University

None newline

Refrences p.160-165, Synopsis p.1-5

Advisors/Committee Members: Devendra Kumar.

Subjects/Keywords: Polinomil Approximation

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Goel, D. (2011). A study on the growth of entire Functions by means of Polinomil Approximation and Interpolation;. (Thesis). Chaudhary Charan Singh University. Retrieved from http://shodhganga.inflibnet.ac.in/handle/10603/40384

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

Goel, Deepti. “A study on the growth of entire Functions by means of Polinomil Approximation and Interpolation;.” 2011. Thesis, Chaudhary Charan Singh University. Accessed April 21, 2019. http://shodhganga.inflibnet.ac.in/handle/10603/40384.

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

MLA Handbook (7th Edition):

Goel, Deepti. “A study on the growth of entire Functions by means of Polinomil Approximation and Interpolation;.” 2011. Web. 21 Apr 2019.

Vancouver:

Goel D. A study on the growth of entire Functions by means of Polinomil Approximation and Interpolation;. [Internet] [Thesis]. Chaudhary Charan Singh University; 2011. [cited 2019 Apr 21]. Available from: http://shodhganga.inflibnet.ac.in/handle/10603/40384.

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

Council of Science Editors:

Goel D. A study on the growth of entire Functions by means of Polinomil Approximation and Interpolation;. [Thesis]. Chaudhary Charan Singh University; 2011. Available from: http://shodhganga.inflibnet.ac.in/handle/10603/40384

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

13. Singh, Parth Raj. Source localization with MIMO systems : Localisation de Source par les Systèmes MIMO.

Degree: Docteur es, Electronique, 2017, Nantes

Dans cette thèse, nous considérons la dernière génération du radar. Il s’agit d’un radar MIMO bistatique qui est composé de plusieurs antennes d’émission et de… (more)

Subjects/Keywords: DOA; DOD; Approximation de Fresnel

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Singh, P. R. (2017). Source localization with MIMO systems : Localisation de Source par les Systèmes MIMO. (Doctoral Dissertation). Nantes. Retrieved from http://www.theses.fr/2017NANT4043

Chicago Manual of Style (16th Edition):

Singh, Parth Raj. “Source localization with MIMO systems : Localisation de Source par les Systèmes MIMO.” 2017. Doctoral Dissertation, Nantes. Accessed April 21, 2019. http://www.theses.fr/2017NANT4043.

MLA Handbook (7th Edition):

Singh, Parth Raj. “Source localization with MIMO systems : Localisation de Source par les Systèmes MIMO.” 2017. Web. 21 Apr 2019.

Vancouver:

Singh PR. Source localization with MIMO systems : Localisation de Source par les Systèmes MIMO. [Internet] [Doctoral dissertation]. Nantes; 2017. [cited 2019 Apr 21]. Available from: http://www.theses.fr/2017NANT4043.

Council of Science Editors:

Singh PR. Source localization with MIMO systems : Localisation de Source par les Systèmes MIMO. [Doctoral Dissertation]. Nantes; 2017. Available from: http://www.theses.fr/2017NANT4043


Durham University

14. Jochym, Dominik Bogdan. Development of non-local density functional methods.

Degree: PhD, 2008, Durham University

 Density functional theory (DFT) is a popular approach to solving the many-electron Schrödinger equation, in order to investigate the properties of matter from first principles.… (more)

Subjects/Keywords: 530.15; Weighted density approximation

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Jochym, D. B. (2008). Development of non-local density functional methods. (Doctoral Dissertation). Durham University. Retrieved from http://etheses.dur.ac.uk/2174/ ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.492886

Chicago Manual of Style (16th Edition):

Jochym, Dominik Bogdan. “Development of non-local density functional methods.” 2008. Doctoral Dissertation, Durham University. Accessed April 21, 2019. http://etheses.dur.ac.uk/2174/ ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.492886.

MLA Handbook (7th Edition):

Jochym, Dominik Bogdan. “Development of non-local density functional methods.” 2008. Web. 21 Apr 2019.

Vancouver:

Jochym DB. Development of non-local density functional methods. [Internet] [Doctoral dissertation]. Durham University; 2008. [cited 2019 Apr 21]. Available from: http://etheses.dur.ac.uk/2174/ ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.492886.

Council of Science Editors:

Jochym DB. Development of non-local density functional methods. [Doctoral Dissertation]. Durham University; 2008. Available from: http://etheses.dur.ac.uk/2174/ ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.492886


University of Alberta

15. Khakpash, Saber. Approximation Algorithms for Multi-processor Task Scheduling Problems on Identical Parallel Processors.

Degree: MS, Department of Computing Science, 2013, University of Alberta

 In this thesis we present approximation algorithms for some multi-processor task scheduling problems. In a scheduling problem, there is a set of processors P that… (more)

Subjects/Keywords: Scheduling; Approximation; Multi-Processing

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Khakpash, S. (2013). Approximation Algorithms for Multi-processor Task Scheduling Problems on Identical Parallel Processors. (Masters Thesis). University of Alberta. Retrieved from https://era.library.ualberta.ca/files/d504rk87g

Chicago Manual of Style (16th Edition):

Khakpash, Saber. “Approximation Algorithms for Multi-processor Task Scheduling Problems on Identical Parallel Processors.” 2013. Masters Thesis, University of Alberta. Accessed April 21, 2019. https://era.library.ualberta.ca/files/d504rk87g.

MLA Handbook (7th Edition):

Khakpash, Saber. “Approximation Algorithms for Multi-processor Task Scheduling Problems on Identical Parallel Processors.” 2013. Web. 21 Apr 2019.

Vancouver:

Khakpash S. Approximation Algorithms for Multi-processor Task Scheduling Problems on Identical Parallel Processors. [Internet] [Masters thesis]. University of Alberta; 2013. [cited 2019 Apr 21]. Available from: https://era.library.ualberta.ca/files/d504rk87g.

Council of Science Editors:

Khakpash S. Approximation Algorithms for Multi-processor Task Scheduling Problems on Identical Parallel Processors. [Masters Thesis]. University of Alberta; 2013. Available from: https://era.library.ualberta.ca/files/d504rk87g


Texas A&M University

16. Li, Xiafeng. On Discrete Hyperbox Packing.

Degree: 2010, Texas A&M University

 Bin packing is a very important and popular research area in the computer science field. Past work showed many good and real-world packing algorithms. How-… (more)

Subjects/Keywords: bin packing; approximation algorithms

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Li, X. (2010). On Discrete Hyperbox Packing. (Thesis). Texas A&M University. Retrieved from http://hdl.handle.net/1969.1/ETD-TAMU-2008-12-186

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

Chicago Manual of Style (16th Edition):

Li, Xiafeng. “On Discrete Hyperbox Packing.” 2010. Thesis, Texas A&M University. Accessed April 21, 2019. http://hdl.handle.net/1969.1/ETD-TAMU-2008-12-186.

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

MLA Handbook (7th Edition):

Li, Xiafeng. “On Discrete Hyperbox Packing.” 2010. Web. 21 Apr 2019.

Vancouver:

Li X. On Discrete Hyperbox Packing. [Internet] [Thesis]. Texas A&M University; 2010. [cited 2019 Apr 21]. Available from: http://hdl.handle.net/1969.1/ETD-TAMU-2008-12-186.

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

Council of Science Editors:

Li X. On Discrete Hyperbox Packing. [Thesis]. Texas A&M University; 2010. Available from: http://hdl.handle.net/1969.1/ETD-TAMU-2008-12-186

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


Wesleyan University

17. Chatha, Prayag George Singh. Close Enough: a Dynamical Approach to the Littlewood Conjecture.

Degree: Mathematics, 2017, Wesleyan University

  Diophantine approximation is a branch of number theory that concerns the metric relationship of the rationals and irrationals. Much of the present-day research in… (more)

Subjects/Keywords: diophantine; approximation; dynamics; ergodic; homogeneous

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Chatha, P. G. S. (2017). Close Enough: a Dynamical Approach to the Littlewood Conjecture. (Masters Thesis). Wesleyan University. Retrieved from https://wesscholar.wesleyan.edu/etd_mas_theses/149

Chicago Manual of Style (16th Edition):

Chatha, Prayag George Singh. “Close Enough: a Dynamical Approach to the Littlewood Conjecture.” 2017. Masters Thesis, Wesleyan University. Accessed April 21, 2019. https://wesscholar.wesleyan.edu/etd_mas_theses/149.

MLA Handbook (7th Edition):

Chatha, Prayag George Singh. “Close Enough: a Dynamical Approach to the Littlewood Conjecture.” 2017. Web. 21 Apr 2019.

Vancouver:

Chatha PGS. Close Enough: a Dynamical Approach to the Littlewood Conjecture. [Internet] [Masters thesis]. Wesleyan University; 2017. [cited 2019 Apr 21]. Available from: https://wesscholar.wesleyan.edu/etd_mas_theses/149.

Council of Science Editors:

Chatha PGS. Close Enough: a Dynamical Approach to the Littlewood Conjecture. [Masters Thesis]. Wesleyan University; 2017. Available from: https://wesscholar.wesleyan.edu/etd_mas_theses/149


University of Hong Kong

18. 吳仕明; Ng, Shu-ming. Some theorems in approximation theory.

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

published_or_final_version

Mathematics

Master

Master of Philosophy

Subjects/Keywords: Approximation theory.

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

吳仕明; Ng, S. (1979). Some theorems in approximation theory. (Masters Thesis). University of Hong Kong. Retrieved from Ng, S. [吳仕明]. (1979). Some theorems in approximation theory. (Thesis). University of Hong Kong, Pokfulam, Hong Kong SAR. Retrieved from http://dx.doi.org/10.5353/th_b3120545 ; http://dx.doi.org/10.5353/th_b3120545 ; http://hdl.handle.net/10722/32805

Chicago Manual of Style (16th Edition):

吳仕明; Ng, Shu-ming. “Some theorems in approximation theory.” 1979. Masters Thesis, University of Hong Kong. Accessed April 21, 2019. Ng, S. [吳仕明]. (1979). Some theorems in approximation theory. (Thesis). University of Hong Kong, Pokfulam, Hong Kong SAR. Retrieved from http://dx.doi.org/10.5353/th_b3120545 ; http://dx.doi.org/10.5353/th_b3120545 ; http://hdl.handle.net/10722/32805.

MLA Handbook (7th Edition):

吳仕明; Ng, Shu-ming. “Some theorems in approximation theory.” 1979. Web. 21 Apr 2019.

Vancouver:

吳仕明; Ng S. Some theorems in approximation theory. [Internet] [Masters thesis]. University of Hong Kong; 1979. [cited 2019 Apr 21]. Available from: Ng, S. [吳仕明]. (1979). Some theorems in approximation theory. (Thesis). University of Hong Kong, Pokfulam, Hong Kong SAR. Retrieved from http://dx.doi.org/10.5353/th_b3120545 ; http://dx.doi.org/10.5353/th_b3120545 ; http://hdl.handle.net/10722/32805.

Council of Science Editors:

吳仕明; Ng S. Some theorems in approximation theory. [Masters Thesis]. University of Hong Kong; 1979. Available from: Ng, S. [吳仕明]. (1979). Some theorems in approximation theory. (Thesis). University of Hong Kong, Pokfulam, Hong Kong SAR. Retrieved from http://dx.doi.org/10.5353/th_b3120545 ; http://dx.doi.org/10.5353/th_b3120545 ; http://hdl.handle.net/10722/32805


Cornell University

19. Cheung, Maurice. Lp-Based Approximation Algorithms For Scheduling And Inventory Management Problems .

Degree: 2012, Cornell University

 There are two fundamental approaches for using linear programming in designing approximation algorithms: LP-rounding and the primal-dual method. In this thesis, we develop LP-based approximation(more)

Subjects/Keywords: Approximation Algorithms; Scheduling; Inventory Management

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Cheung, M. (2012). Lp-Based Approximation Algorithms For Scheduling And Inventory Management Problems . (Thesis). Cornell University. Retrieved from http://hdl.handle.net/1813/31470

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

Cheung, Maurice. “Lp-Based Approximation Algorithms For Scheduling And Inventory Management Problems .” 2012. Thesis, Cornell University. Accessed April 21, 2019. http://hdl.handle.net/1813/31470.

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

MLA Handbook (7th Edition):

Cheung, Maurice. “Lp-Based Approximation Algorithms For Scheduling And Inventory Management Problems .” 2012. Web. 21 Apr 2019.

Vancouver:

Cheung M. Lp-Based Approximation Algorithms For Scheduling And Inventory Management Problems . [Internet] [Thesis]. Cornell University; 2012. [cited 2019 Apr 21]. Available from: http://hdl.handle.net/1813/31470.

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

Council of Science Editors:

Cheung M. Lp-Based Approximation Algorithms For Scheduling And Inventory Management Problems . [Thesis]. Cornell University; 2012. Available from: http://hdl.handle.net/1813/31470

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


Princeton University

20. Naamad, Yonatan. Hardness from Densest Subgraph Conjectures .

Degree: PhD, 2017, Princeton University

 Karp's seminal paper on NP-Completeness provided computer scientists with a toolkit for showing computational hardness, conditioned on a complexity theoretic conjecture, for a wide variety… (more)

Subjects/Keywords: Algorithms; Approximation; Densest Subgraph; Hardness

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Naamad, Y. (2017). Hardness from Densest Subgraph Conjectures . (Doctoral Dissertation). Princeton University. Retrieved from http://arks.princeton.edu/ark:/88435/dsp01f7623g24h

Chicago Manual of Style (16th Edition):

Naamad, Yonatan. “Hardness from Densest Subgraph Conjectures .” 2017. Doctoral Dissertation, Princeton University. Accessed April 21, 2019. http://arks.princeton.edu/ark:/88435/dsp01f7623g24h.

MLA Handbook (7th Edition):

Naamad, Yonatan. “Hardness from Densest Subgraph Conjectures .” 2017. Web. 21 Apr 2019.

Vancouver:

Naamad Y. Hardness from Densest Subgraph Conjectures . [Internet] [Doctoral dissertation]. Princeton University; 2017. [cited 2019 Apr 21]. Available from: http://arks.princeton.edu/ark:/88435/dsp01f7623g24h.

Council of Science Editors:

Naamad Y. Hardness from Densest Subgraph Conjectures . [Doctoral Dissertation]. Princeton University; 2017. Available from: http://arks.princeton.edu/ark:/88435/dsp01f7623g24h


Montana State University

21. Schmidt, Darrell Patrick. Linear and nonlinear product approximation.

Degree: College of Letters & Science, 1976, Montana State University

Subjects/Keywords: Approximation theory.

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Schmidt, D. P. (1976). Linear and nonlinear product approximation. (Thesis). Montana State University. Retrieved from https://scholarworks.montana.edu/xmlui/handle/1/4607

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

Schmidt, Darrell Patrick. “Linear and nonlinear product approximation.” 1976. Thesis, Montana State University. Accessed April 21, 2019. https://scholarworks.montana.edu/xmlui/handle/1/4607.

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

MLA Handbook (7th Edition):

Schmidt, Darrell Patrick. “Linear and nonlinear product approximation.” 1976. Web. 21 Apr 2019.

Vancouver:

Schmidt DP. Linear and nonlinear product approximation. [Internet] [Thesis]. Montana State University; 1976. [cited 2019 Apr 21]. Available from: https://scholarworks.montana.edu/xmlui/handle/1/4607.

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

Council of Science Editors:

Schmidt DP. Linear and nonlinear product approximation. [Thesis]. Montana State University; 1976. Available from: https://scholarworks.montana.edu/xmlui/handle/1/4607

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


University of Victoria

22. Odense, Simon. Universal approximation theory of neural networks.

Degree: Department of Mathematics and Statistics, 2016, University of Victoria

 Historically, artificial neural networks have been loosely defined as biologically inspired computational models. When deciding what sort of network to use for a given task… (more)

Subjects/Keywords: Neural Network; RTRBM; Universal Approximation

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Odense, S. (2016). Universal approximation theory of neural networks. (Masters Thesis). University of Victoria. Retrieved from http://hdl.handle.net/1828/7040

Chicago Manual of Style (16th Edition):

Odense, Simon. “Universal approximation theory of neural networks.” 2016. Masters Thesis, University of Victoria. Accessed April 21, 2019. http://hdl.handle.net/1828/7040.

MLA Handbook (7th Edition):

Odense, Simon. “Universal approximation theory of neural networks.” 2016. Web. 21 Apr 2019.

Vancouver:

Odense S. Universal approximation theory of neural networks. [Internet] [Masters thesis]. University of Victoria; 2016. [cited 2019 Apr 21]. Available from: http://hdl.handle.net/1828/7040.

Council of Science Editors:

Odense S. Universal approximation theory of neural networks. [Masters Thesis]. University of Victoria; 2016. Available from: http://hdl.handle.net/1828/7040


University of Victoria

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

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

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

Subjects/Keywords: approximation models; computer simulation; algorithms

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

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

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

Chicago Manual of Style (16th Edition):

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

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

MLA Handbook (7th Edition):

Younis, Adel Ayad Hassouna. “Space exploration and region elimination global optimization algorithms for multidisciplinary design optimization.” 2011. Web. 21 Apr 2019.

Vancouver:

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

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

Council of Science Editors:

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

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


McGill University

24. Wolkowicz, Henry. Kantorovich's general theory of approximation methods.

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

Subjects/Keywords: Approximation theory.

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Wolkowicz, H. (1975). Kantorovich's general theory of approximation methods. (Masters Thesis). McGill University. Retrieved from http://digitool.library.mcgill.ca/thesisfile46080.pdf

Chicago Manual of Style (16th Edition):

Wolkowicz, Henry. “Kantorovich's general theory of approximation methods.” 1975. Masters Thesis, McGill University. Accessed April 21, 2019. http://digitool.library.mcgill.ca/thesisfile46080.pdf.

MLA Handbook (7th Edition):

Wolkowicz, Henry. “Kantorovich's general theory of approximation methods.” 1975. Web. 21 Apr 2019.

Vancouver:

Wolkowicz H. Kantorovich's general theory of approximation methods. [Internet] [Masters thesis]. McGill University; 1975. [cited 2019 Apr 21]. Available from: http://digitool.library.mcgill.ca/thesisfile46080.pdf.

Council of Science Editors:

Wolkowicz H. Kantorovich's general theory of approximation methods. [Masters Thesis]. McGill University; 1975. Available from: http://digitool.library.mcgill.ca/thesisfile46080.pdf


Montana Tech

25. Haight, Gordon M. The Weierstrass approximation theorem.

Degree: MA, 1967, Montana Tech

Subjects/Keywords: Approximation theory.

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Haight, G. M. (1967). The Weierstrass approximation theorem. (Masters Thesis). Montana Tech. Retrieved from https://scholarworks.umt.edu/etd/6122

Chicago Manual of Style (16th Edition):

Haight, Gordon M. “The Weierstrass approximation theorem.” 1967. Masters Thesis, Montana Tech. Accessed April 21, 2019. https://scholarworks.umt.edu/etd/6122.

MLA Handbook (7th Edition):

Haight, Gordon M. “The Weierstrass approximation theorem.” 1967. Web. 21 Apr 2019.

Vancouver:

Haight GM. The Weierstrass approximation theorem. [Internet] [Masters thesis]. Montana Tech; 1967. [cited 2019 Apr 21]. Available from: https://scholarworks.umt.edu/etd/6122.

Council of Science Editors:

Haight GM. The Weierstrass approximation theorem. [Masters Thesis]. Montana Tech; 1967. Available from: https://scholarworks.umt.edu/etd/6122


McGill University

26. Yamamoto, Peter J. Vertical and Orthogonal L1 Linear Approximation: Analysis and Algorithms.

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

Note:

This thesis presents algorithms for approximating a set of n points by a. line which minimizes the L1 norm of vertical and orthogonal distances.… (more)

Subjects/Keywords: Linear approximation

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Yamamoto, P. J. (1988). Vertical and Orthogonal L1 Linear Approximation: Analysis and Algorithms. (Masters Thesis). McGill University. Retrieved from http://digitool.library.mcgill.ca/thesisfile155921.pdf

Chicago Manual of Style (16th Edition):

Yamamoto, Peter J. “Vertical and Orthogonal L1 Linear Approximation: Analysis and Algorithms.” 1988. Masters Thesis, McGill University. Accessed April 21, 2019. http://digitool.library.mcgill.ca/thesisfile155921.pdf.

MLA Handbook (7th Edition):

Yamamoto, Peter J. “Vertical and Orthogonal L1 Linear Approximation: Analysis and Algorithms.” 1988. Web. 21 Apr 2019.

Vancouver:

Yamamoto PJ. Vertical and Orthogonal L1 Linear Approximation: Analysis and Algorithms. [Internet] [Masters thesis]. McGill University; 1988. [cited 2019 Apr 21]. Available from: http://digitool.library.mcgill.ca/thesisfile155921.pdf.

Council of Science Editors:

Yamamoto PJ. Vertical and Orthogonal L1 Linear Approximation: Analysis and Algorithms. [Masters Thesis]. McGill University; 1988. Available from: http://digitool.library.mcgill.ca/thesisfile155921.pdf


University of Manitoba

27. Maizlish, Oleksandr. Adaptive triangulations.

Degree: Mathematics, 2014, University of Manitoba

 In this dissertation, we consider the problem of piecewise polynomial approximation of functions over sets of triangulations. Recently developed adaptive methods, where the hierarchy of… (more)

Subjects/Keywords: adaptive approximation; triangulation; image compression

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Maizlish, O. (2014). Adaptive triangulations. (Thesis). University of Manitoba. Retrieved from http://hdl.handle.net/1993/23529

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

Maizlish, Oleksandr. “Adaptive triangulations.” 2014. Thesis, University of Manitoba. Accessed April 21, 2019. http://hdl.handle.net/1993/23529.

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

MLA Handbook (7th Edition):

Maizlish, Oleksandr. “Adaptive triangulations.” 2014. Web. 21 Apr 2019.

Vancouver:

Maizlish O. Adaptive triangulations. [Internet] [Thesis]. University of Manitoba; 2014. [cited 2019 Apr 21]. Available from: http://hdl.handle.net/1993/23529.

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

Council of Science Editors:

Maizlish O. Adaptive triangulations. [Thesis]. University of Manitoba; 2014. Available from: http://hdl.handle.net/1993/23529

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


Oregon State University

28. Rouff, James Elliot. On error-bound connected optimized trigonometric subroutines.

Degree: MS, Mathematics, 1971, Oregon State University

Polynomial evaluation algorithms proposed by E. Belaga and V. Ya Pan are applied here in designing some optimum trigonometric evaluation routines. Advisors/Committee Members: Goheen, Harry (advisor).

Subjects/Keywords: Chebyshey approximation

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Rouff, J. E. (1971). On error-bound connected optimized trigonometric subroutines. (Masters Thesis). Oregon State University. Retrieved from http://hdl.handle.net/1957/46151

Chicago Manual of Style (16th Edition):

Rouff, James Elliot. “On error-bound connected optimized trigonometric subroutines.” 1971. Masters Thesis, Oregon State University. Accessed April 21, 2019. http://hdl.handle.net/1957/46151.

MLA Handbook (7th Edition):

Rouff, James Elliot. “On error-bound connected optimized trigonometric subroutines.” 1971. Web. 21 Apr 2019.

Vancouver:

Rouff JE. On error-bound connected optimized trigonometric subroutines. [Internet] [Masters thesis]. Oregon State University; 1971. [cited 2019 Apr 21]. Available from: http://hdl.handle.net/1957/46151.

Council of Science Editors:

Rouff JE. On error-bound connected optimized trigonometric subroutines. [Masters Thesis]. Oregon State University; 1971. Available from: http://hdl.handle.net/1957/46151


Oregon State University

29. Ojha, Murari Prasad. Smooth approximations and quermassintegrals.

Degree: PhD, Mathematics, 1982, Oregon State University

See pdf. Advisors/Committee Members: Goheen, Harry E. (advisor).

Subjects/Keywords: Approximation theory

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Ojha, M. P. (1982). Smooth approximations and quermassintegrals. (Doctoral Dissertation). Oregon State University. Retrieved from http://hdl.handle.net/1957/17499

Chicago Manual of Style (16th Edition):

Ojha, Murari Prasad. “Smooth approximations and quermassintegrals.” 1982. Doctoral Dissertation, Oregon State University. Accessed April 21, 2019. http://hdl.handle.net/1957/17499.

MLA Handbook (7th Edition):

Ojha, Murari Prasad. “Smooth approximations and quermassintegrals.” 1982. Web. 21 Apr 2019.

Vancouver:

Ojha MP. Smooth approximations and quermassintegrals. [Internet] [Doctoral dissertation]. Oregon State University; 1982. [cited 2019 Apr 21]. Available from: http://hdl.handle.net/1957/17499.

Council of Science Editors:

Ojha MP. Smooth approximations and quermassintegrals. [Doctoral Dissertation]. Oregon State University; 1982. Available from: http://hdl.handle.net/1957/17499


Oregon State University

30. Lo, Wen-so. Spectral approximation theory for bounded linear operators.

Degree: PhD, Mathematics, 1972, Oregon State University

 In this thesis we examine the approximation theory of the eigenvalue problem of bounded linear operators defined on a Banach space, and its applications to… (more)

Subjects/Keywords: Approximation theory

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Lo, W. (1972). Spectral approximation theory for bounded linear operators. (Doctoral Dissertation). Oregon State University. Retrieved from http://hdl.handle.net/1957/17549

Chicago Manual of Style (16th Edition):

Lo, Wen-so. “Spectral approximation theory for bounded linear operators.” 1972. Doctoral Dissertation, Oregon State University. Accessed April 21, 2019. http://hdl.handle.net/1957/17549.

MLA Handbook (7th Edition):

Lo, Wen-so. “Spectral approximation theory for bounded linear operators.” 1972. Web. 21 Apr 2019.

Vancouver:

Lo W. Spectral approximation theory for bounded linear operators. [Internet] [Doctoral dissertation]. Oregon State University; 1972. [cited 2019 Apr 21]. Available from: http://hdl.handle.net/1957/17549.

Council of Science Editors:

Lo W. Spectral approximation theory for bounded linear operators. [Doctoral Dissertation]. Oregon State University; 1972. Available from: http://hdl.handle.net/1957/17549

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

.