Advanced search options

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

You searched for `subject:(Approximation theory)`

.
Showing records 1 – 30 of
455 total matches.

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

Search Limiters

Dates

- 2016 – 2020 (80)
- 2011 – 2015 (132)
- 2006 – 2010 (92)
- 2001 – 2005 (41)
- 1996 – 2000 (28)
- 1991 – 1995 (24)
- 1986 – 1990 (20)
- 1981 – 1985 (15)
- 1976 – 1980 (14)
- 1971 – 1975 (28)

Universities

- University of Florida (61)
- ETH Zürich (41)
- Georgia Tech (18)
- Michigan State University (13)
- Hong Kong University of Science and Technology (11)
- University of Hong Kong (11)
- Virginia Tech (10)

Department

- Mathematics (24)
- Physics (19)
- Department of Mathematics (12)
- Chemistry (10)

Degrees

- PhD (136)
- Docteur es (29)
- MS (24)

▼ Search Limiters

University of Manitoba

1.
Muliarchyk, Kyrylo.
Polynomial *approximation* in weighted spaces.

Degree: Mathematics, 2019, University of Manitoba

URL: http://hdl.handle.net/1993/34201

► One of the most important problems in *Approximation* *Theory* is to connect the rate with which a function can be approximated and the smoothness of…
(more)

Subjects/Keywords: Approximation theory

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Muliarchyk, K. (2019). Polynomial approximation in weighted spaces. (Masters Thesis). University of Manitoba. Retrieved from http://hdl.handle.net/1993/34201

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

Muliarchyk, Kyrylo. “Polynomial approximation in weighted spaces.” 2019. Masters Thesis, University of Manitoba. Accessed February 23, 2020. http://hdl.handle.net/1993/34201.

MLA Handbook (7^{th} Edition):

Muliarchyk, Kyrylo. “Polynomial approximation in weighted spaces.” 2019. Web. 23 Feb 2020.

Vancouver:

Muliarchyk K. Polynomial approximation in weighted spaces. [Internet] [Masters thesis]. University of Manitoba; 2019. [cited 2020 Feb 23]. Available from: http://hdl.handle.net/1993/34201.

Council of Science Editors:

Muliarchyk K. Polynomial approximation in weighted spaces. [Masters Thesis]. University of Manitoba; 2019. Available from: http://hdl.handle.net/1993/34201

University of Hong Kong

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

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

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

published_or_final_version

Mathematics

Master

Master of Philosophy

Subjects/Keywords: Approximation theory.

Record Details Similar Records

❌

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

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

吳仕明; Ng, Shu-ming. “Some theorems in approximation theory.” 1979. Masters Thesis, University of Hong Kong. Accessed February 23, 2020. 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 (7^{th} Edition):

吳仕明; Ng, Shu-ming. “Some theorems in approximation theory.” 1979. Web. 23 Feb 2020.

Vancouver:

吳仕明; Ng S. Some theorems in approximation theory. [Internet] [Masters thesis]. University of Hong Kong; 1979. [cited 2020 Feb 23]. 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

Montana State University

3.
Schmidt, Darrell Patrick.
Linear and nonlinear product * approximation*.

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

URL: https://scholarworks.montana.edu/xmlui/handle/1/4607

Subjects/Keywords: Approximation theory.

Record Details Similar Records

❌

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

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

Schmidt, Darrell Patrick. “Linear and nonlinear product approximation.” 1976. Thesis, Montana State University. Accessed February 23, 2020. 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 (7^{th} Edition):

Schmidt, Darrell Patrick. “Linear and nonlinear product approximation.” 1976. Web. 23 Feb 2020.

Vancouver:

Schmidt DP. Linear and nonlinear product approximation. [Internet] [Thesis]. Montana State University; 1976. [cited 2020 Feb 23]. 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

Not specified: Masters Thesis or Doctoral Dissertation

McGill University

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

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

URL: http://digitool.library.mcgill.ca/thesisfile46080.pdf

Subjects/Keywords: Approximation theory.

Record Details Similar Records

❌

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

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

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

MLA Handbook (7^{th} Edition):

Wolkowicz, Henry. “Kantorovich's general theory of approximation methods.” 1975. Web. 23 Feb 2020.

Vancouver:

Wolkowicz H. Kantorovich's general theory of approximation methods. [Internet] [Masters thesis]. McGill University; 1975. [cited 2020 Feb 23]. 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

5.
Haight, Gordon M.
The Weierstrass *approximation* theorem.

Degree: MA, 1967, Montana Tech

URL: https://scholarworks.umt.edu/etd/6122

Subjects/Keywords: Approximation theory.

Record Details Similar Records

❌

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

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

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

MLA Handbook (7^{th} Edition):

Haight, Gordon M. “The Weierstrass approximation theorem.” 1967. Web. 23 Feb 2020.

Vancouver:

Haight GM. The Weierstrass approximation theorem. [Internet] [Masters thesis]. Montana Tech; 1967. [cited 2020 Feb 23]. 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

Oregon State University

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

Degree: PhD, Mathematics, 1982, Oregon State University

URL: http://hdl.handle.net/1957/17499

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

Subjects/Keywords: Approximation theory

Record Details Similar Records

❌

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

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

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

MLA Handbook (7^{th} Edition):

Ojha, Murari Prasad. “Smooth approximations and quermassintegrals.” 1982. Web. 23 Feb 2020.

Vancouver:

Ojha MP. Smooth approximations and quermassintegrals. [Internet] [Doctoral dissertation]. Oregon State University; 1982. [cited 2020 Feb 23]. 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

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

Degree: PhD, Mathematics, 1972, Oregon State University

URL: http://hdl.handle.net/1957/17549

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

❌

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

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

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

MLA Handbook (7^{th} Edition):

Lo, Wen-so. “Spectral approximation theory for bounded linear operators.” 1972. Web. 23 Feb 2020.

Vancouver:

Lo W. Spectral approximation theory for bounded linear operators. [Internet] [Doctoral dissertation]. Oregon State University; 1972. [cited 2020 Feb 23]. 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

Oregon State University

8. Shoji, Fumihiro Frank. Simplification of large linear systems using two-step iterative method.

Degree: E.E., 1979, Oregon State University

URL: http://hdl.handle.net/1957/42605

► The order of the practical system (e.g. nuclear power plants, electrical power network and chemical plant) is quite large. However, there are many limitations in…
(more)

Subjects/Keywords: Approximation theory

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Shoji, F. F. (1979). Simplification of large linear systems using two-step iterative method. (Thesis). Oregon State University. Retrieved from http://hdl.handle.net/1957/42605

Not specified: Masters Thesis or Doctoral Dissertation

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

Shoji, Fumihiro Frank. “Simplification of large linear systems using two-step iterative method.” 1979. Thesis, Oregon State University. Accessed February 23, 2020. http://hdl.handle.net/1957/42605.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Shoji, Fumihiro Frank. “Simplification of large linear systems using two-step iterative method.” 1979. Web. 23 Feb 2020.

Vancouver:

Shoji FF. Simplification of large linear systems using two-step iterative method. [Internet] [Thesis]. Oregon State University; 1979. [cited 2020 Feb 23]. Available from: http://hdl.handle.net/1957/42605.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Shoji FF. Simplification of large linear systems using two-step iterative method. [Thesis]. Oregon State University; 1979. Available from: http://hdl.handle.net/1957/42605

Not specified: Masters Thesis or Doctoral Dissertation

9.
Allbee, Matthew.
An *approximation* algorithm with additive error for extensive-form, pure Stackelberg games with a chance player.

Degree: 2018, University of Wisconsin – Whitewater

URL: http://digital.library.wisc.edu/1793/78968

►

This file was last viewed in Microsoft Edge.

Substantial work has gone into ﬁnding techniques for solving real-world sized Nash games. Stackelberg Equilibria is another… (more)

Subjects/Keywords: Game theory; Approximation algorithms

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Allbee, M. (2018). An approximation algorithm with additive error for extensive-form, pure Stackelberg games with a chance player. (Thesis). University of Wisconsin – Whitewater. Retrieved from http://digital.library.wisc.edu/1793/78968

Not specified: Masters Thesis or Doctoral Dissertation

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

Allbee, Matthew. “An approximation algorithm with additive error for extensive-form, pure Stackelberg games with a chance player.” 2018. Thesis, University of Wisconsin – Whitewater. Accessed February 23, 2020. http://digital.library.wisc.edu/1793/78968.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Allbee, Matthew. “An approximation algorithm with additive error for extensive-form, pure Stackelberg games with a chance player.” 2018. Web. 23 Feb 2020.

Vancouver:

Allbee M. An approximation algorithm with additive error for extensive-form, pure Stackelberg games with a chance player. [Internet] [Thesis]. University of Wisconsin – Whitewater; 2018. [cited 2020 Feb 23]. Available from: http://digital.library.wisc.edu/1793/78968.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Allbee M. An approximation algorithm with additive error for extensive-form, pure Stackelberg games with a chance player. [Thesis]. University of Wisconsin – Whitewater; 2018. Available from: http://digital.library.wisc.edu/1793/78968

Not specified: Masters Thesis or Doctoral Dissertation

University of Arizona

10.
Smith, J. B., 1938-.
SOME PROBLEMS IN THE *THEORY* OF * APPROXIMATION*
.

Degree: 1968, University of Arizona

URL: http://hdl.handle.net/10150/284953

Subjects/Keywords: Approximation theory.

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Smith, J. B., 1. (1968). SOME PROBLEMS IN THE THEORY OF APPROXIMATION . (Doctoral Dissertation). University of Arizona. Retrieved from http://hdl.handle.net/10150/284953

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

Smith, J. B., 1938-. “SOME PROBLEMS IN THE THEORY OF APPROXIMATION .” 1968. Doctoral Dissertation, University of Arizona. Accessed February 23, 2020. http://hdl.handle.net/10150/284953.

MLA Handbook (7^{th} Edition):

Smith, J. B., 1938-. “SOME PROBLEMS IN THE THEORY OF APPROXIMATION .” 1968. Web. 23 Feb 2020.

Vancouver:

Smith, J. B. 1. SOME PROBLEMS IN THE THEORY OF APPROXIMATION . [Internet] [Doctoral dissertation]. University of Arizona; 1968. [cited 2020 Feb 23]. Available from: http://hdl.handle.net/10150/284953.

Council of Science Editors:

Smith, J. B. 1. SOME PROBLEMS IN THE THEORY OF APPROXIMATION . [Doctoral Dissertation]. University of Arizona; 1968. Available from: http://hdl.handle.net/10150/284953

Michigan State University

11.
Tornga, J. Edward, 1942-.
* Approximation* from varisolvent and unisolvent families whose members have restricted ranges.

Degree: PhD, Department of Mathematics, 1971, Michigan State University

URL: http://etd.lib.msu.edu/islandora/object/etd:35189

Subjects/Keywords: Approximation theory

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Tornga, J. Edward, 1. (1971). Approximation from varisolvent and unisolvent families whose members have restricted ranges. (Doctoral Dissertation). Michigan State University. Retrieved from http://etd.lib.msu.edu/islandora/object/etd:35189

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

Tornga, J. Edward, 1942-. “Approximation from varisolvent and unisolvent families whose members have restricted ranges.” 1971. Doctoral Dissertation, Michigan State University. Accessed February 23, 2020. http://etd.lib.msu.edu/islandora/object/etd:35189.

MLA Handbook (7^{th} Edition):

Tornga, J. Edward, 1942-. “Approximation from varisolvent and unisolvent families whose members have restricted ranges.” 1971. Web. 23 Feb 2020.

Vancouver:

Tornga, J. Edward 1. Approximation from varisolvent and unisolvent families whose members have restricted ranges. [Internet] [Doctoral dissertation]. Michigan State University; 1971. [cited 2020 Feb 23]. Available from: http://etd.lib.msu.edu/islandora/object/etd:35189.

Council of Science Editors:

Tornga, J. Edward 1. Approximation from varisolvent and unisolvent families whose members have restricted ranges. [Doctoral Dissertation]. Michigan State University; 1971. Available from: http://etd.lib.msu.edu/islandora/object/etd:35189

University of Adelaide

12.
Howlett, Philip George.
* Approximation* to summable functions.

Degree: 1970, University of Adelaide

URL: http://hdl.handle.net/2440/20879

Subjects/Keywords: Approximation theory.

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Howlett, P. G. (1970). Approximation to summable functions. (Thesis). University of Adelaide. Retrieved from http://hdl.handle.net/2440/20879

Not specified: Masters Thesis or Doctoral Dissertation

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

Howlett, Philip George. “Approximation to summable functions.” 1970. Thesis, University of Adelaide. Accessed February 23, 2020. http://hdl.handle.net/2440/20879.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Howlett, Philip George. “Approximation to summable functions.” 1970. Web. 23 Feb 2020.

Vancouver:

Howlett PG. Approximation to summable functions. [Internet] [Thesis]. University of Adelaide; 1970. [cited 2020 Feb 23]. Available from: http://hdl.handle.net/2440/20879.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Howlett PG. Approximation to summable functions. [Thesis]. University of Adelaide; 1970. Available from: http://hdl.handle.net/2440/20879

Not specified: Masters Thesis or Doctoral Dissertation

Rutgers University

13.
Li, Jixin.
Saddle point *approximation*:.

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

URL: http://hdl.rutgers.edu/1782.2/rucore10001600001.ETD.000051043

►

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

❌

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

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

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

MLA Handbook (7^{th} Edition):

Li, Jixin. “Saddle point approximation:.” 2009. Web. 23 Feb 2020.

Vancouver:

Li J. Saddle point approximation:. [Internet] [Doctoral dissertation]. Rutgers University; 2009. [cited 2020 Feb 23]. 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

Rutgers University

14. Xu, Lu, 1979-. Small sample inference for collections of Bernoulli trials:.

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

URL: http://hdl.rutgers.edu/1782.2/rucore10001600001.ETD.000052166

► This dissertation discusses two applied problems solved by saddlepoint *approximation* methods. The first part of this thesis concerns continuity corrected saddlepoint approximations for testing and…
(more)

Subjects/Keywords: Approximation theory; Bernoulli numbers

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Xu, Lu, 1. (2010). Small sample inference for collections of Bernoulli trials:. (Doctoral Dissertation). Rutgers University. Retrieved from http://hdl.rutgers.edu/1782.2/rucore10001600001.ETD.000052166

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

Xu, Lu, 1979-. “Small sample inference for collections of Bernoulli trials:.” 2010. Doctoral Dissertation, Rutgers University. Accessed February 23, 2020. http://hdl.rutgers.edu/1782.2/rucore10001600001.ETD.000052166.

MLA Handbook (7^{th} Edition):

Xu, Lu, 1979-. “Small sample inference for collections of Bernoulli trials:.” 2010. Web. 23 Feb 2020.

Vancouver:

Xu, Lu 1. Small sample inference for collections of Bernoulli trials:. [Internet] [Doctoral dissertation]. Rutgers University; 2010. [cited 2020 Feb 23]. Available from: http://hdl.rutgers.edu/1782.2/rucore10001600001.ETD.000052166.

Council of Science Editors:

Xu, Lu 1. Small sample inference for collections of Bernoulli trials:. [Doctoral Dissertation]. Rutgers University; 2010. Available from: http://hdl.rutgers.edu/1782.2/rucore10001600001.ETD.000052166

Rutgers University

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

Degree: PhD, Mathematics, 2016, Rutgers University

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

►

This thesis deals with the question of approximating distance to monotonicity in the streaming setting as well as the task of approximating the ulam distance… (more)

Subjects/Keywords: Computer algorithms; Approximation theory

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Naumovitz, T. R. (2016). Very efficient approximation algorithms to edit distance problems. (Doctoral Dissertation). Rutgers University. Retrieved from https://rucore.libraries.rutgers.edu/rutgers-lib/51382/

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

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

MLA Handbook (7^{th} Edition):

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

Vancouver:

Naumovitz TR. Very efficient approximation algorithms to edit distance problems. [Internet] [Doctoral dissertation]. Rutgers University; 2016. [cited 2020 Feb 23]. Available from: https://rucore.libraries.rutgers.edu/rutgers-lib/51382/.

Council of Science Editors:

Naumovitz TR. Very efficient approximation algorithms to edit distance problems. [Doctoral Dissertation]. Rutgers University; 2016. Available from: https://rucore.libraries.rutgers.edu/rutgers-lib/51382/

Michigan State University

16.
Platte, Donald Marvin, 1942-.
* Approximation* with Hermite-Birkhoff interpolatory constraints and related H-set

Degree: PhD, Department of Mathematics, 1972, Michigan State University

URL: http://etd.lib.msu.edu/islandora/object/etd:37217

Subjects/Keywords: Approximation theory

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Platte, Donald Marvin, 1. (1972). Approximation with Hermite-Birkhoff interpolatory constraints and related H-set theory. (Doctoral Dissertation). Michigan State University. Retrieved from http://etd.lib.msu.edu/islandora/object/etd:37217

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

Platte, Donald Marvin, 1942-. “Approximation with Hermite-Birkhoff interpolatory constraints and related H-set theory.” 1972. Doctoral Dissertation, Michigan State University. Accessed February 23, 2020. http://etd.lib.msu.edu/islandora/object/etd:37217.

MLA Handbook (7^{th} Edition):

Platte, Donald Marvin, 1942-. “Approximation with Hermite-Birkhoff interpolatory constraints and related H-set theory.” 1972. Web. 23 Feb 2020.

Vancouver:

Platte, Donald Marvin 1. Approximation with Hermite-Birkhoff interpolatory constraints and related H-set theory. [Internet] [Doctoral dissertation]. Michigan State University; 1972. [cited 2020 Feb 23]. Available from: http://etd.lib.msu.edu/islandora/object/etd:37217.

Council of Science Editors:

Platte, Donald Marvin 1. Approximation with Hermite-Birkhoff interpolatory constraints and related H-set theory. [Doctoral Dissertation]. Michigan State University; 1972. Available from: http://etd.lib.msu.edu/islandora/object/etd:37217

Michigan State University

17.
Brink, Daryl Myron, 1944-.
Tchebycheff *approximation* by reciprocals of polynomials on [0, [infinity]).

Degree: PhD, Department of Mathematics, 1972, Michigan State University

URL: http://etd.lib.msu.edu/islandora/object/etd:34615

Subjects/Keywords: Approximation theory

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Brink, Daryl Myron, 1. (1972). Tchebycheff approximation by reciprocals of polynomials on [0, [infinity]). (Doctoral Dissertation). Michigan State University. Retrieved from http://etd.lib.msu.edu/islandora/object/etd:34615

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

Brink, Daryl Myron, 1944-. “Tchebycheff approximation by reciprocals of polynomials on [0, [infinity]).” 1972. Doctoral Dissertation, Michigan State University. Accessed February 23, 2020. http://etd.lib.msu.edu/islandora/object/etd:34615.

MLA Handbook (7^{th} Edition):

Brink, Daryl Myron, 1944-. “Tchebycheff approximation by reciprocals of polynomials on [0, [infinity]).” 1972. Web. 23 Feb 2020.

Vancouver:

Brink, Daryl Myron 1. Tchebycheff approximation by reciprocals of polynomials on [0, [infinity]). [Internet] [Doctoral dissertation]. Michigan State University; 1972. [cited 2020 Feb 23]. Available from: http://etd.lib.msu.edu/islandora/object/etd:34615.

Council of Science Editors:

Brink, Daryl Myron 1. Tchebycheff approximation by reciprocals of polynomials on [0, [infinity]). [Doctoral Dissertation]. Michigan State University; 1972. Available from: http://etd.lib.msu.edu/islandora/object/etd:34615

Hong Kong University of Science and Technology

18. Zhang, Kan. Berry-Esseen bounds for studentized statistics by Stein's method.

Degree: 2012, Hong Kong University of Science and Technology

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

► The Stein's method, originally introduced by Stein (1972), gives us a novel wayto investigate normal *approximation*. This method has since been developed in different areas…
(more)

Subjects/Keywords: Mathematical statistics ; Approximation theory ; Distribution (Probability theory)

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Zhang, K. (2012). Berry-Esseen bounds for studentized statistics by Stein's method. (Thesis). Hong Kong University of Science and Technology. Retrieved from http://repository.ust.hk/ir/Record/1783.1-8125 ; https://doi.org/10.14711/thesis-b1199036 ; http://repository.ust.hk/ir/bitstream/1783.1-8125/1/th_redirect.html

Not specified: Masters Thesis or Doctoral Dissertation

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

Zhang, Kan. “Berry-Esseen bounds for studentized statistics by Stein's method.” 2012. Thesis, Hong Kong University of Science and Technology. Accessed February 23, 2020. http://repository.ust.hk/ir/Record/1783.1-8125 ; https://doi.org/10.14711/thesis-b1199036 ; http://repository.ust.hk/ir/bitstream/1783.1-8125/1/th_redirect.html.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Zhang, Kan. “Berry-Esseen bounds for studentized statistics by Stein's method.” 2012. Web. 23 Feb 2020.

Vancouver:

Zhang K. Berry-Esseen bounds for studentized statistics by Stein's method. [Internet] [Thesis]. Hong Kong University of Science and Technology; 2012. [cited 2020 Feb 23]. Available from: http://repository.ust.hk/ir/Record/1783.1-8125 ; https://doi.org/10.14711/thesis-b1199036 ; http://repository.ust.hk/ir/bitstream/1783.1-8125/1/th_redirect.html.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Zhang K. Berry-Esseen bounds for studentized statistics by Stein's method. [Thesis]. Hong Kong University of Science and Technology; 2012. Available from: http://repository.ust.hk/ir/Record/1783.1-8125 ; https://doi.org/10.14711/thesis-b1199036 ; http://repository.ust.hk/ir/bitstream/1783.1-8125/1/th_redirect.html

Not specified: Masters Thesis or Doctoral Dissertation

Hong Kong University of Science and Technology

19. Zhang, Mengchen. Berry-Esseen bounds for Curie-Weiss model and associated random variables by Stein's method.

Degree: 2017, Hong Kong University of Science and Technology

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

► In this thesis, first we develop a result of Stein's method for non-normal *approximation* via exchangeable pair approach. By this result, we derive Berry-Esseen bounds…
(more)

Subjects/Keywords: Mathematical statistics ; Approximation theory ; Distribution (Probability theory)

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Zhang, M. (2017). Berry-Esseen bounds for Curie-Weiss model and associated random variables by Stein's method. (Thesis). Hong Kong University of Science and Technology. Retrieved from http://repository.ust.hk/ir/Record/1783.1-89180 ; https://doi.org/10.14711/thesis-991012530268303412 ; http://repository.ust.hk/ir/bitstream/1783.1-89180/1/th_redirect.html

Not specified: Masters Thesis or Doctoral Dissertation

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

Zhang, Mengchen. “Berry-Esseen bounds for Curie-Weiss model and associated random variables by Stein's method.” 2017. Thesis, Hong Kong University of Science and Technology. Accessed February 23, 2020. http://repository.ust.hk/ir/Record/1783.1-89180 ; https://doi.org/10.14711/thesis-991012530268303412 ; http://repository.ust.hk/ir/bitstream/1783.1-89180/1/th_redirect.html.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Zhang, Mengchen. “Berry-Esseen bounds for Curie-Weiss model and associated random variables by Stein's method.” 2017. Web. 23 Feb 2020.

Vancouver:

Zhang M. Berry-Esseen bounds for Curie-Weiss model and associated random variables by Stein's method. [Internet] [Thesis]. Hong Kong University of Science and Technology; 2017. [cited 2020 Feb 23]. Available from: http://repository.ust.hk/ir/Record/1783.1-89180 ; https://doi.org/10.14711/thesis-991012530268303412 ; http://repository.ust.hk/ir/bitstream/1783.1-89180/1/th_redirect.html.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Zhang M. Berry-Esseen bounds for Curie-Weiss model and associated random variables by Stein's method. [Thesis]. Hong Kong University of Science and Technology; 2017. Available from: http://repository.ust.hk/ir/Record/1783.1-89180 ; https://doi.org/10.14711/thesis-991012530268303412 ; http://repository.ust.hk/ir/bitstream/1783.1-89180/1/th_redirect.html

Not specified: Masters Thesis or Doctoral Dissertation

University of Alberta

20.
Khani, Mohammad Reza.
Improved *approximation* algorithms for Min-Max Tree Cover,
Bounded Tree Cover, Shallow-Light and Buy-at-Bulk k-Steiner Tree,
and (k, 2)-Subgraph.

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

URL: https://era.library.ualberta.ca/files/cbr86b369q

► In this thesis we provide improved *approximation* algorithms for the Min-Max k-Tree Cover, Bounded Tree Cover and Shallow-Light k-Steiner Tree, (k, 2)-subgraph problems. In Chapter…
(more)

Subjects/Keywords: Theory of Computation; Approximation Algorithms; CombinatorialOptimization; Hardness of Approximation

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Khani, M. R. (2011). Improved approximation algorithms for Min-Max Tree Cover, Bounded Tree Cover, Shallow-Light and Buy-at-Bulk k-Steiner Tree, and (k, 2)-Subgraph. (Masters Thesis). University of Alberta. Retrieved from https://era.library.ualberta.ca/files/cbr86b369q

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

Khani, Mohammad Reza. “Improved approximation algorithms for Min-Max Tree Cover, Bounded Tree Cover, Shallow-Light and Buy-at-Bulk k-Steiner Tree, and (k, 2)-Subgraph.” 2011. Masters Thesis, University of Alberta. Accessed February 23, 2020. https://era.library.ualberta.ca/files/cbr86b369q.

MLA Handbook (7^{th} Edition):

Khani, Mohammad Reza. “Improved approximation algorithms for Min-Max Tree Cover, Bounded Tree Cover, Shallow-Light and Buy-at-Bulk k-Steiner Tree, and (k, 2)-Subgraph.” 2011. Web. 23 Feb 2020.

Vancouver:

Khani MR. Improved approximation algorithms for Min-Max Tree Cover, Bounded Tree Cover, Shallow-Light and Buy-at-Bulk k-Steiner Tree, and (k, 2)-Subgraph. [Internet] [Masters thesis]. University of Alberta; 2011. [cited 2020 Feb 23]. Available from: https://era.library.ualberta.ca/files/cbr86b369q.

Council of Science Editors:

Khani MR. Improved approximation algorithms for Min-Max Tree Cover, Bounded Tree Cover, Shallow-Light and Buy-at-Bulk k-Steiner Tree, and (k, 2)-Subgraph. [Masters Thesis]. University of Alberta; 2011. Available from: https://era.library.ualberta.ca/files/cbr86b369q

21. Briest, Patrick. Computational aspects of combinatorial pricing problems.

Degree: 2007, Technische Universität Dortmund

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

► Combinatorial pricing encompasses a wide range of natural optimization problems that arise in the computation of revenue maximizing pricing schemes for a given set of…
(more)

Subjects/Keywords: algorithmic game theory; approximation algorithms; hardness of approximation; pricing; 004

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Briest, P. (2007). Computational aspects of combinatorial pricing problems. (Thesis). Technische Universität Dortmund. Retrieved from http://hdl.handle.net/2003/24877

Not specified: Masters Thesis or Doctoral Dissertation

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

Briest, Patrick. “Computational aspects of combinatorial pricing problems.” 2007. Thesis, Technische Universität Dortmund. Accessed February 23, 2020. http://hdl.handle.net/2003/24877.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Briest, Patrick. “Computational aspects of combinatorial pricing problems.” 2007. Web. 23 Feb 2020.

Vancouver:

Briest P. Computational aspects of combinatorial pricing problems. [Internet] [Thesis]. Technische Universität Dortmund; 2007. [cited 2020 Feb 23]. Available from: http://hdl.handle.net/2003/24877.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Briest P. Computational aspects of combinatorial pricing problems. [Thesis]. Technische Universität Dortmund; 2007. Available from: http://hdl.handle.net/2003/24877

Not specified: Masters Thesis or Doctoral Dissertation

Michigan State University

22.
Ruppert, David, 1948-.
A new dynamic stochastic *approximation* procedure.

Degree: PhD, 1977, Michigan State University

URL: http://etd.lib.msu.edu/islandora/object/etd:43624

Subjects/Keywords: Stochastic approximation; Approximation theory

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Ruppert, David, 1. (1977). A new dynamic stochastic approximation procedure. (Doctoral Dissertation). Michigan State University. Retrieved from http://etd.lib.msu.edu/islandora/object/etd:43624

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

Ruppert, David, 1948-. “A new dynamic stochastic approximation procedure.” 1977. Doctoral Dissertation, Michigan State University. Accessed February 23, 2020. http://etd.lib.msu.edu/islandora/object/etd:43624.

MLA Handbook (7^{th} Edition):

Ruppert, David, 1948-. “A new dynamic stochastic approximation procedure.” 1977. Web. 23 Feb 2020.

Vancouver:

Ruppert, David 1. A new dynamic stochastic approximation procedure. [Internet] [Doctoral dissertation]. Michigan State University; 1977. [cited 2020 Feb 23]. Available from: http://etd.lib.msu.edu/islandora/object/etd:43624.

Council of Science Editors:

Ruppert, David 1. A new dynamic stochastic approximation procedure. [Doctoral Dissertation]. Michigan State University; 1977. Available from: http://etd.lib.msu.edu/islandora/object/etd:43624

University of Hong Kong

23.
廖明哲; Liu, Ming-chit.
Some applications of asymptotic * approximation*.

Degree: MS, 1969, University of Hong Kong

URL: Liu, M. [廖明哲]. (1969). Some applications of asymptotic approximation. (Thesis). University of Hong Kong, Pokfulam, Hong Kong SAR. Retrieved from http://dx.doi.org/10.5353/th_b3126185 ; http://dx.doi.org/10.5353/th_b3126185 ; http://hdl.handle.net/10722/37823

published_or_final_version

Mathematics

Master

Master of Science

Subjects/Keywords: Approximation theory.; Asymptotes.

Record Details Similar Records

❌

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

APA (6^{th} Edition):

廖明哲; Liu, M. (1969). Some applications of asymptotic approximation. (Masters Thesis). University of Hong Kong. Retrieved from Liu, M. [廖明哲]. (1969). Some applications of asymptotic approximation. (Thesis). University of Hong Kong, Pokfulam, Hong Kong SAR. Retrieved from http://dx.doi.org/10.5353/th_b3126185 ; http://dx.doi.org/10.5353/th_b3126185 ; http://hdl.handle.net/10722/37823

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

廖明哲; Liu, Ming-chit. “Some applications of asymptotic approximation.” 1969. Masters Thesis, University of Hong Kong. Accessed February 23, 2020. Liu, M. [廖明哲]. (1969). Some applications of asymptotic approximation. (Thesis). University of Hong Kong, Pokfulam, Hong Kong SAR. Retrieved from http://dx.doi.org/10.5353/th_b3126185 ; http://dx.doi.org/10.5353/th_b3126185 ; http://hdl.handle.net/10722/37823.

MLA Handbook (7^{th} Edition):

廖明哲; Liu, Ming-chit. “Some applications of asymptotic approximation.” 1969. Web. 23 Feb 2020.

Vancouver:

廖明哲; Liu M. Some applications of asymptotic approximation. [Internet] [Masters thesis]. University of Hong Kong; 1969. [cited 2020 Feb 23]. Available from: Liu, M. [廖明哲]. (1969). Some applications of asymptotic approximation. (Thesis). University of Hong Kong, Pokfulam, Hong Kong SAR. Retrieved from http://dx.doi.org/10.5353/th_b3126185 ; http://dx.doi.org/10.5353/th_b3126185 ; http://hdl.handle.net/10722/37823.

Council of Science Editors:

廖明哲; Liu M. Some applications of asymptotic approximation. [Masters Thesis]. University of Hong Kong; 1969. Available from: Liu, M. [廖明哲]. (1969). Some applications of asymptotic approximation. (Thesis). University of Hong Kong, Pokfulam, Hong Kong SAR. Retrieved from http://dx.doi.org/10.5353/th_b3126185 ; http://dx.doi.org/10.5353/th_b3126185 ; http://hdl.handle.net/10722/37823

24.
Bobade, Parag Suhas.
Modeling, *Approximation*, and Control for a Class of Nonlinear Systems.

Degree: PhD, Engineering Science and Mechanics, 2017, Virginia Tech

URL: http://hdl.handle.net/10919/80978

► This work investigates modeling, *approximation*, estimation, and control for classes of nonlinear systems whose state evolves in space ℝ^{n} times H, where ℝ^{n} is a…
(more)

Subjects/Keywords: Adaptive Estimation; Approximation Theory; Functional Differential Equations

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Bobade, P. S. (2017). Modeling, Approximation, and Control for a Class of Nonlinear Systems. (Doctoral Dissertation). Virginia Tech. Retrieved from http://hdl.handle.net/10919/80978

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

Bobade, Parag Suhas. “Modeling, Approximation, and Control for a Class of Nonlinear Systems.” 2017. Doctoral Dissertation, Virginia Tech. Accessed February 23, 2020. http://hdl.handle.net/10919/80978.

MLA Handbook (7^{th} Edition):

Bobade, Parag Suhas. “Modeling, Approximation, and Control for a Class of Nonlinear Systems.” 2017. Web. 23 Feb 2020.

Vancouver:

Bobade PS. Modeling, Approximation, and Control for a Class of Nonlinear Systems. [Internet] [Doctoral dissertation]. Virginia Tech; 2017. [cited 2020 Feb 23]. Available from: http://hdl.handle.net/10919/80978.

Council of Science Editors:

Bobade PS. Modeling, Approximation, and Control for a Class of Nonlinear Systems. [Doctoral Dissertation]. Virginia Tech; 2017. Available from: http://hdl.handle.net/10919/80978

University of Melbourne

25.
Jegaraj, Terence.
Polynomial birth-death *approximation* of pattern occurrences in an independent, identically distributed sequence.

Degree: 2003, University of Melbourne

URL: http://hdl.handle.net/11343/39506

The distribution of occurrences of a non–overlapping pattern in an independent,identically distributed sequence can be approximated well by some two–parameterpolynomial birth–death distributions, at least when the pattern probability is small.The total variation distance error can be shown to approach zero as the length ofthe sequence being considered increases.

Subjects/Keywords: polynomials; approximation theory

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Jegaraj, T. (2003). Polynomial birth-death approximation of pattern occurrences in an independent, identically distributed sequence. (Masters Thesis). University of Melbourne. Retrieved from http://hdl.handle.net/11343/39506

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

Jegaraj, Terence. “Polynomial birth-death approximation of pattern occurrences in an independent, identically distributed sequence.” 2003. Masters Thesis, University of Melbourne. Accessed February 23, 2020. http://hdl.handle.net/11343/39506.

MLA Handbook (7^{th} Edition):

Jegaraj, Terence. “Polynomial birth-death approximation of pattern occurrences in an independent, identically distributed sequence.” 2003. Web. 23 Feb 2020.

Vancouver:

Jegaraj T. Polynomial birth-death approximation of pattern occurrences in an independent, identically distributed sequence. [Internet] [Masters thesis]. University of Melbourne; 2003. [cited 2020 Feb 23]. Available from: http://hdl.handle.net/11343/39506.

Council of Science Editors:

Jegaraj T. Polynomial birth-death approximation of pattern occurrences in an independent, identically distributed sequence. [Masters Thesis]. University of Melbourne; 2003. Available from: http://hdl.handle.net/11343/39506

University of Oklahoma

26.
Howland, John Elton.
Contributions to the *theory* of Tchebycheff * approximation*.

Degree: PhD, 1971, University of Oklahoma

URL: http://hdl.handle.net/11244/2928

Subjects/Keywords: Mathematics.; Approximation theory.

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Howland, J. E. (1971). Contributions to the theory of Tchebycheff approximation. (Doctoral Dissertation). University of Oklahoma. Retrieved from http://hdl.handle.net/11244/2928

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

Howland, John Elton. “Contributions to the theory of Tchebycheff approximation.” 1971. Doctoral Dissertation, University of Oklahoma. Accessed February 23, 2020. http://hdl.handle.net/11244/2928.

MLA Handbook (7^{th} Edition):

Howland, John Elton. “Contributions to the theory of Tchebycheff approximation.” 1971. Web. 23 Feb 2020.

Vancouver:

Howland JE. Contributions to the theory of Tchebycheff approximation. [Internet] [Doctoral dissertation]. University of Oklahoma; 1971. [cited 2020 Feb 23]. Available from: http://hdl.handle.net/11244/2928.

Council of Science Editors:

Howland JE. Contributions to the theory of Tchebycheff approximation. [Doctoral Dissertation]. University of Oklahoma; 1971. Available from: http://hdl.handle.net/11244/2928

University of North Carolina – Greensboro

27.
Payne, Catherine Ann.
* Approximation* of neutral delay-differential
equations.

Degree: 2017, University of North Carolina – Greensboro

URL: http://libres.uncg.edu/ir/listing.aspx?styp=ti&id=22077

► [Mathematical notation cannot be correctly represented here; please see PDF below for full equations.] We study questions related to stability and *approximation* of the system…
(more)

Subjects/Keywords: Delay differential equations; Semigroups; Approximation theory

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Payne, C. A. (2017). Approximation of neutral delay-differential equations. (Doctoral Dissertation). University of North Carolina – Greensboro. Retrieved from http://libres.uncg.edu/ir/listing.aspx?styp=ti&id=22077

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

Payne, Catherine Ann. “Approximation of neutral delay-differential equations.” 2017. Doctoral Dissertation, University of North Carolina – Greensboro. Accessed February 23, 2020. http://libres.uncg.edu/ir/listing.aspx?styp=ti&id=22077.

MLA Handbook (7^{th} Edition):

Payne, Catherine Ann. “Approximation of neutral delay-differential equations.” 2017. Web. 23 Feb 2020.

Vancouver:

Payne CA. Approximation of neutral delay-differential equations. [Internet] [Doctoral dissertation]. University of North Carolina – Greensboro; 2017. [cited 2020 Feb 23]. Available from: http://libres.uncg.edu/ir/listing.aspx?styp=ti&id=22077.

Council of Science Editors:

Payne CA. Approximation of neutral delay-differential equations. [Doctoral Dissertation]. University of North Carolina – Greensboro; 2017. Available from: http://libres.uncg.edu/ir/listing.aspx?styp=ti&id=22077

University of Waterloo

28. Koh, Zhuan Khye. Stabilizing Weighted Graphs.

Degree: 2017, University of Waterloo

URL: http://hdl.handle.net/10012/12246

► An edge-weighted graph G = (V,E) is called stable if the value of a maximum-weight matching equals the value of a maximum-weight fractional matching. Stable…
(more)

Subjects/Keywords: Matching; Game Theory; Network Bargaining; Approximation Algorithm

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Koh, Z. K. (2017). Stabilizing Weighted Graphs. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/12246

Not specified: Masters Thesis or Doctoral Dissertation

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

Koh, Zhuan Khye. “Stabilizing Weighted Graphs.” 2017. Thesis, University of Waterloo. Accessed February 23, 2020. http://hdl.handle.net/10012/12246.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Koh, Zhuan Khye. “Stabilizing Weighted Graphs.” 2017. Web. 23 Feb 2020.

Vancouver:

Koh ZK. Stabilizing Weighted Graphs. [Internet] [Thesis]. University of Waterloo; 2017. [cited 2020 Feb 23]. Available from: http://hdl.handle.net/10012/12246.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Koh ZK. Stabilizing Weighted Graphs. [Thesis]. University of Waterloo; 2017. Available from: http://hdl.handle.net/10012/12246

Not specified: Masters Thesis or Doctoral Dissertation

University of Illinois – Urbana-Champaign

29. Fieldsteel, Nathan Mulvey. Some problems in polynomial interpolation and topological complexity.

Degree: PhD, Mathematics, 2017, University of Illinois – Urbana-Champaign

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

► This thesis is comprised of two projects in applied computational mathematics. In Chapter 1, we discuss the geometry and combinatorics of geometrically characterized sets. These…
(more)

Subjects/Keywords: Approximation theory; Polynomial interpolation; Motion planning

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Fieldsteel, N. M. (2017). Some problems in polynomial interpolation and topological complexity. (Doctoral Dissertation). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/97758

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

Fieldsteel, Nathan Mulvey. “Some problems in polynomial interpolation and topological complexity.” 2017. Doctoral Dissertation, University of Illinois – Urbana-Champaign. Accessed February 23, 2020. http://hdl.handle.net/2142/97758.

MLA Handbook (7^{th} Edition):

Fieldsteel, Nathan Mulvey. “Some problems in polynomial interpolation and topological complexity.” 2017. Web. 23 Feb 2020.

Vancouver:

Fieldsteel NM. Some problems in polynomial interpolation and topological complexity. [Internet] [Doctoral dissertation]. University of Illinois – Urbana-Champaign; 2017. [cited 2020 Feb 23]. Available from: http://hdl.handle.net/2142/97758.

Council of Science Editors:

Fieldsteel NM. Some problems in polynomial interpolation and topological complexity. [Doctoral Dissertation]. University of Illinois – Urbana-Champaign; 2017. Available from: http://hdl.handle.net/2142/97758

Hong Kong University of Science and Technology

30. Tsang, Ho Tak. Vehicle routing problem with heterogeneous vehicles.

Degree: 2011, Hong Kong University of Science and Technology

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

► The thesis presents a novel two-phase approach for heterogeneous fleet in Vehicle Routing Problem (VRP). In view of considerable difficulty to solve the class of…
(more)

Subjects/Keywords: Vehicle routing problem – Mathematical models ; Approximation theory

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Tsang, H. T. (2011). Vehicle routing problem with heterogeneous vehicles. (Thesis). Hong Kong University of Science and Technology. Retrieved from http://repository.ust.hk/ir/Record/1783.1-7412 ; https://doi.org/10.14711/thesis-b1155741 ; http://repository.ust.hk/ir/bitstream/1783.1-7412/1/th_redirect.html

Not specified: Masters Thesis or Doctoral Dissertation

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

Tsang, Ho Tak. “Vehicle routing problem with heterogeneous vehicles.” 2011. Thesis, Hong Kong University of Science and Technology. Accessed February 23, 2020. http://repository.ust.hk/ir/Record/1783.1-7412 ; https://doi.org/10.14711/thesis-b1155741 ; http://repository.ust.hk/ir/bitstream/1783.1-7412/1/th_redirect.html.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Tsang, Ho Tak. “Vehicle routing problem with heterogeneous vehicles.” 2011. Web. 23 Feb 2020.

Vancouver:

Tsang HT. Vehicle routing problem with heterogeneous vehicles. [Internet] [Thesis]. Hong Kong University of Science and Technology; 2011. [cited 2020 Feb 23]. Available from: http://repository.ust.hk/ir/Record/1783.1-7412 ; https://doi.org/10.14711/thesis-b1155741 ; http://repository.ust.hk/ir/bitstream/1783.1-7412/1/th_redirect.html.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Tsang HT. Vehicle routing problem with heterogeneous vehicles. [Thesis]. Hong Kong University of Science and Technology; 2011. Available from: http://repository.ust.hk/ir/Record/1783.1-7412 ; https://doi.org/10.14711/thesis-b1155741 ; http://repository.ust.hk/ir/bitstream/1783.1-7412/1/th_redirect.html

Not specified: Masters Thesis or Doctoral Dissertation