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

Country:

You searched for subject:(Approximation). Showing records 1 – 30 of 192 total matches.

[1] [2] [3] [4] [5] [6] [7]

Search Limiters

Last 2 Years | English Only

Degrees

Levels

Languages

▼ Search Limiters


McGill University

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

2. 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 September 18, 2019. http://hdl.handle.net/1993/4820.

MLA Handbook (7th Edition):

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

Vancouver:

Klurman O. On constrained Markov-Nikolskii and Bernstein type inequalities. [Internet] [Masters thesis]. University of Manitoba; 2011. [cited 2019 Sep 18]. 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


McMaster University

3. 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 September 18, 2019. http://hdl.handle.net/11375/22245.

MLA Handbook (7th Edition):

Lenarcic, Adam. “Rough Sets, Similarity, and Optimal Approximations.” 2017. Web. 18 Sep 2019.

Vancouver:

Lenarcic A. Rough Sets, Similarity, and Optimal Approximations. [Internet] [Doctoral dissertation]. McMaster University; 2017. [cited 2019 Sep 18]. 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

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

Vancouver:

Sharifi F. Uniform Approximation on Riemann Surfaces. [Internet] [Thesis]. University of Western Ontario; 2016. [cited 2019 Sep 18]. 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


University of Alberta

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


University of Victoria

6. 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 September 18, 2019. http://hdl.handle.net/1828/7040.

MLA Handbook (7th Edition):

Odense, Simon. “Universal approximation theory of neural networks.” 2016. Web. 18 Sep 2019.

Vancouver:

Odense S. Universal approximation theory of neural networks. [Internet] [Masters thesis]. University of Victoria; 2016. [cited 2019 Sep 18]. 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

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

Vancouver:

Younis AAH. Space exploration and region elimination global optimization algorithms for multidisciplinary design optimization. [Internet] [Thesis]. University of Victoria; 2011. [cited 2019 Sep 18]. 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

8. 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 September 18, 2019. http://digitool.library.mcgill.ca/thesisfile46080.pdf.

MLA Handbook (7th Edition):

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

Vancouver:

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


McGill University

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

Vancouver:

Yamamoto PJ. Vertical and Orthogonal L1 Linear Approximation: Analysis and Algorithms. [Internet] [Masters thesis]. McGill University; 1988. [cited 2019 Sep 18]. 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 Waterloo

10. Blanco Sandoval, Marco David. LP-based Approximation Algorithms for the Capacitated Facility Location Problem.

Degree: 2012, University of Waterloo

 The capacitated facility location problem is a well known problem in combinatorial optimization and operations research. In it, we are given a set of clients… (more)

Subjects/Keywords: capacitated facility location; approximation algorithms

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Blanco Sandoval, M. D. (2012). LP-based Approximation Algorithms for the Capacitated Facility Location Problem. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/6733

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

Blanco Sandoval, Marco David. “LP-based Approximation Algorithms for the Capacitated Facility Location Problem.” 2012. Thesis, University of Waterloo. Accessed September 18, 2019. http://hdl.handle.net/10012/6733.

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

MLA Handbook (7th Edition):

Blanco Sandoval, Marco David. “LP-based Approximation Algorithms for the Capacitated Facility Location Problem.” 2012. Web. 18 Sep 2019.

Vancouver:

Blanco Sandoval MD. LP-based Approximation Algorithms for the Capacitated Facility Location Problem. [Internet] [Thesis]. University of Waterloo; 2012. [cited 2019 Sep 18]. Available from: http://hdl.handle.net/10012/6733.

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

Council of Science Editors:

Blanco Sandoval MD. LP-based Approximation Algorithms for the Capacitated Facility Location Problem. [Thesis]. University of Waterloo; 2012. Available from: http://hdl.handle.net/10012/6733

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


University of Waterloo

11. Jain, Kshitij. Minimum Shared-Power Edge Cut.

Degree: 2018, University of Waterloo

 We introduce a problem called the Minimum Shared-Power Edge Cut (MSPEC). The input to the problem is an undirected edge-weighted graph with distinguished vertices s… (more)

Subjects/Keywords: Algorithms; Computational Geometry; Approximation Algorithm

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Jain, K. (2018). Minimum Shared-Power Edge Cut. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/13664

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

Jain, Kshitij. “Minimum Shared-Power Edge Cut.” 2018. Thesis, University of Waterloo. Accessed September 18, 2019. http://hdl.handle.net/10012/13664.

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

MLA Handbook (7th Edition):

Jain, Kshitij. “Minimum Shared-Power Edge Cut.” 2018. Web. 18 Sep 2019.

Vancouver:

Jain K. Minimum Shared-Power Edge Cut. [Internet] [Thesis]. University of Waterloo; 2018. [cited 2019 Sep 18]. Available from: http://hdl.handle.net/10012/13664.

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

Council of Science Editors:

Jain K. Minimum Shared-Power Edge Cut. [Thesis]. University of Waterloo; 2018. Available from: http://hdl.handle.net/10012/13664

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


University of Manitoba

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

Vancouver:

Maizlish O. Adaptive triangulations. [Internet] [Thesis]. University of Manitoba; 2014. [cited 2019 Sep 18]. 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


University of Alberta

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

 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 DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th 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 (16th 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 September 18, 2019. https://era.library.ualberta.ca/files/cbr86b369q.

MLA Handbook (7th 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. 18 Sep 2019.

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


University of Waterloo

14. Koh, Zhuan Khye. Stabilizing Weighted Graphs.

Degree: 2017, University of Waterloo

 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 DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

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

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

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

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

MLA Handbook (7th Edition):

Koh, Zhuan Khye. “Stabilizing Weighted Graphs.” 2017. Web. 18 Sep 2019.

Vancouver:

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

Note: this citation may be lacking information needed for this citation format:
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

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


University of Waterloo

15. Pritchard, David. Linear Programming Tools and Approximation Algorithms for Combinatorial Optimization.

Degree: 2010, University of Waterloo

 We study techniques, approximation algorithms, structural properties and lower bounds related to applications of linear programs in combinatorial optimization. The following "Steiner tree problem" is… (more)

Subjects/Keywords: algorithms; linear programs; graphs; optimization; approximation

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Pritchard, D. (2010). Linear Programming Tools and Approximation Algorithms for Combinatorial Optimization. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/4898

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

Pritchard, David. “Linear Programming Tools and Approximation Algorithms for Combinatorial Optimization.” 2010. Thesis, University of Waterloo. Accessed September 18, 2019. http://hdl.handle.net/10012/4898.

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

MLA Handbook (7th Edition):

Pritchard, David. “Linear Programming Tools and Approximation Algorithms for Combinatorial Optimization.” 2010. Web. 18 Sep 2019.

Vancouver:

Pritchard D. Linear Programming Tools and Approximation Algorithms for Combinatorial Optimization. [Internet] [Thesis]. University of Waterloo; 2010. [cited 2019 Sep 18]. Available from: http://hdl.handle.net/10012/4898.

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

Council of Science Editors:

Pritchard D. Linear Programming Tools and Approximation Algorithms for Combinatorial Optimization. [Thesis]. University of Waterloo; 2010. Available from: http://hdl.handle.net/10012/4898

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

16. Liu, Qing. CPT Approximation with NIN-AND Tree Causal Models .

Degree: 2014, University of Guelph

 A Bayesian network (BN) is a probabilistic graphical model widely used in artificial intelligence (AI) to support uncertain knowledge representation and uncertain reasoning. In BNs,… (more)

Subjects/Keywords: CPT approximation

…NIN-AND trees and an optimization method, the NIN-AND tree models giving good approximation… …AND tree. Moreover, the approximation accuracy comparison experiment is conducted between… …approximation accuracy with NIN-AND tree causal modeling is notably improved. 1.4 Organization of… 

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Liu, Q. (2014). CPT Approximation with NIN-AND Tree Causal Models . (Thesis). University of Guelph. Retrieved from https://atrium.lib.uoguelph.ca/xmlui/handle/10214/7841

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

Liu, Qing. “CPT Approximation with NIN-AND Tree Causal Models .” 2014. Thesis, University of Guelph. Accessed September 18, 2019. https://atrium.lib.uoguelph.ca/xmlui/handle/10214/7841.

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

MLA Handbook (7th Edition):

Liu, Qing. “CPT Approximation with NIN-AND Tree Causal Models .” 2014. Web. 18 Sep 2019.

Vancouver:

Liu Q. CPT Approximation with NIN-AND Tree Causal Models . [Internet] [Thesis]. University of Guelph; 2014. [cited 2019 Sep 18]. Available from: https://atrium.lib.uoguelph.ca/xmlui/handle/10214/7841.

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

Council of Science Editors:

Liu Q. CPT Approximation with NIN-AND Tree Causal Models . [Thesis]. University of Guelph; 2014. Available from: https://atrium.lib.uoguelph.ca/xmlui/handle/10214/7841

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

17. Day, C. L. Nicole. Tight-Binding Approximations in 1D and 2D Coupled-Cavity Photonic Crystal Structures .

Degree: Physics, Engineering Physics and Astronomy, 2016, Queens University

 Light confinement and controlling an optical field has numerous applications in the field of telecommunications for optical signals processing. When the wavelength of the electromagnetic… (more)

Subjects/Keywords: Photonic Crystals; Tight-Binding Approximation; Coupled-Cavity

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Day, C. L. N. (2016). Tight-Binding Approximations in 1D and 2D Coupled-Cavity Photonic Crystal Structures . (Thesis). Queens University. Retrieved from http://hdl.handle.net/1974/14526

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

Day, C L Nicole. “Tight-Binding Approximations in 1D and 2D Coupled-Cavity Photonic Crystal Structures .” 2016. Thesis, Queens University. Accessed September 18, 2019. http://hdl.handle.net/1974/14526.

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

MLA Handbook (7th Edition):

Day, C L Nicole. “Tight-Binding Approximations in 1D and 2D Coupled-Cavity Photonic Crystal Structures .” 2016. Web. 18 Sep 2019.

Vancouver:

Day CLN. Tight-Binding Approximations in 1D and 2D Coupled-Cavity Photonic Crystal Structures . [Internet] [Thesis]. Queens University; 2016. [cited 2019 Sep 18]. Available from: http://hdl.handle.net/1974/14526.

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

Council of Science Editors:

Day CLN. Tight-Binding Approximations in 1D and 2D Coupled-Cavity Photonic Crystal Structures . [Thesis]. Queens University; 2016. Available from: http://hdl.handle.net/1974/14526

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


University of Waterloo

18. Alexander, Matthew. A Polar Decomposition for Quantum Channels: Theory and Applications.

Degree: 2019, University of Waterloo

 Every potential benefit of quantum computers would be lost without methods to protect the computations from error. Quantum channels provide a framework for understanding error… (more)

Subjects/Keywords: quantum information; quantum channels; leading Kraus approximation

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Alexander, M. (2019). A Polar Decomposition for Quantum Channels: Theory and Applications. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/14931

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

Alexander, Matthew. “A Polar Decomposition for Quantum Channels: Theory and Applications.” 2019. Thesis, University of Waterloo. Accessed September 18, 2019. http://hdl.handle.net/10012/14931.

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

MLA Handbook (7th Edition):

Alexander, Matthew. “A Polar Decomposition for Quantum Channels: Theory and Applications.” 2019. Web. 18 Sep 2019.

Vancouver:

Alexander M. A Polar Decomposition for Quantum Channels: Theory and Applications. [Internet] [Thesis]. University of Waterloo; 2019. [cited 2019 Sep 18]. Available from: http://hdl.handle.net/10012/14931.

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

Council of Science Editors:

Alexander M. A Polar Decomposition for Quantum Channels: Theory and Applications. [Thesis]. University of Waterloo; 2019. Available from: http://hdl.handle.net/10012/14931

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


University of Alberta

19. Li, Zhuangzhi. Chance Constrained Optimization with Robust and Sampling Approximation.

Degree: MS, Department of Chemical and Materials Engineering, 2015, University of Alberta

 Uncertainty is pervasive in various process operations problems. Its appearance spans from the detailed process description of multi-site manufacturing. In practical applications, there is a… (more)

Subjects/Keywords: Linear programming based scenario reduction method; Chance constrained optimization; Optimal robust counterpart optimization approximation; Sample average approximation with scenario reduction

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Li, Z. (2015). Chance Constrained Optimization with Robust and Sampling Approximation. (Masters Thesis). University of Alberta. Retrieved from https://era.library.ualberta.ca/files/rn301424z

Chicago Manual of Style (16th Edition):

Li, Zhuangzhi. “Chance Constrained Optimization with Robust and Sampling Approximation.” 2015. Masters Thesis, University of Alberta. Accessed September 18, 2019. https://era.library.ualberta.ca/files/rn301424z.

MLA Handbook (7th Edition):

Li, Zhuangzhi. “Chance Constrained Optimization with Robust and Sampling Approximation.” 2015. Web. 18 Sep 2019.

Vancouver:

Li Z. Chance Constrained Optimization with Robust and Sampling Approximation. [Internet] [Masters thesis]. University of Alberta; 2015. [cited 2019 Sep 18]. Available from: https://era.library.ualberta.ca/files/rn301424z.

Council of Science Editors:

Li Z. Chance Constrained Optimization with Robust and Sampling Approximation. [Masters Thesis]. University of Alberta; 2015. Available from: https://era.library.ualberta.ca/files/rn301424z


University of Ottawa

20. Rivard-Cooke, Martin. Parametric Geometry of Numbers .

Degree: 2019, University of Ottawa

 This thesis is primarily concerned in studying the relationship between different exponents of Diophantine approximation, which are quantities arising naturally in the study of rational… (more)

Subjects/Keywords: parametric geometry of numbers; Diophantine approximation; transcendence theory; geometry of numbers; exponents of Diophantine approximation; spectrum; semialgebraic set

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Rivard-Cooke, M. (2019). Parametric Geometry of Numbers . (Thesis). University of Ottawa. Retrieved from http://hdl.handle.net/10393/38871

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

Rivard-Cooke, Martin. “Parametric Geometry of Numbers .” 2019. Thesis, University of Ottawa. Accessed September 18, 2019. http://hdl.handle.net/10393/38871.

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

MLA Handbook (7th Edition):

Rivard-Cooke, Martin. “Parametric Geometry of Numbers .” 2019. Web. 18 Sep 2019.

Vancouver:

Rivard-Cooke M. Parametric Geometry of Numbers . [Internet] [Thesis]. University of Ottawa; 2019. [cited 2019 Sep 18]. Available from: http://hdl.handle.net/10393/38871.

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

Council of Science Editors:

Rivard-Cooke M. Parametric Geometry of Numbers . [Thesis]. University of Ottawa; 2019. Available from: http://hdl.handle.net/10393/38871

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


University of Alberta

21. Anagaw, Amsalu Y. Total variation and adjoint state methods for seismic wavefield imaging.

Degree: MS, Department of Physics, 2009, University of Alberta

 Many geophysical inverse problems are ill-posed and have to be regularized. The most often used solution methods for solving ill-posed problems are based on the… (more)

Subjects/Keywords: migration,inversion, total variation, edge-preserving, adjoint state, Born approximation

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Anagaw, A. Y. (2009). Total variation and adjoint state methods for seismic wavefield imaging. (Masters Thesis). University of Alberta. Retrieved from https://era.library.ualberta.ca/files/k0698903h

Chicago Manual of Style (16th Edition):

Anagaw, Amsalu Y. “Total variation and adjoint state methods for seismic wavefield imaging.” 2009. Masters Thesis, University of Alberta. Accessed September 18, 2019. https://era.library.ualberta.ca/files/k0698903h.

MLA Handbook (7th Edition):

Anagaw, Amsalu Y. “Total variation and adjoint state methods for seismic wavefield imaging.” 2009. Web. 18 Sep 2019.

Vancouver:

Anagaw AY. Total variation and adjoint state methods for seismic wavefield imaging. [Internet] [Masters thesis]. University of Alberta; 2009. [cited 2019 Sep 18]. Available from: https://era.library.ualberta.ca/files/k0698903h.

Council of Science Editors:

Anagaw AY. Total variation and adjoint state methods for seismic wavefield imaging. [Masters Thesis]. University of Alberta; 2009. Available from: https://era.library.ualberta.ca/files/k0698903h


University of Alberta

22. Jorati, Amin. Approximation Algorithms for some Min-max Vehicle Routing Problems.

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

 In this thesis, we consider min-max vehicle routing problems, specifically min-max tour cover and star cover problems. Given a metric (V,c) and a number k,… (more)

Subjects/Keywords: Star Cover; Vehicle Routing; Approximation Algorithms; Tour Cover

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Jorati, A. (2013). Approximation Algorithms for some Min-max Vehicle Routing Problems. (Masters Thesis). University of Alberta. Retrieved from https://era.library.ualberta.ca/files/1v53jz385

Chicago Manual of Style (16th Edition):

Jorati, Amin. “Approximation Algorithms for some Min-max Vehicle Routing Problems.” 2013. Masters Thesis, University of Alberta. Accessed September 18, 2019. https://era.library.ualberta.ca/files/1v53jz385.

MLA Handbook (7th Edition):

Jorati, Amin. “Approximation Algorithms for some Min-max Vehicle Routing Problems.” 2013. Web. 18 Sep 2019.

Vancouver:

Jorati A. Approximation Algorithms for some Min-max Vehicle Routing Problems. [Internet] [Masters thesis]. University of Alberta; 2013. [cited 2019 Sep 18]. Available from: https://era.library.ualberta.ca/files/1v53jz385.

Council of Science Editors:

Jorati A. Approximation Algorithms for some Min-max Vehicle Routing Problems. [Masters Thesis]. University of Alberta; 2013. Available from: https://era.library.ualberta.ca/files/1v53jz385


University of Alberta

23. Martin, Christopher S. Approximation Algorithms for Group Coverage and Vehicle Routing Problems.

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

 In this thesis, we present approximation algorithms for various NP-hard vehicle routing problems, as well as for a related maximum group coverage problem. Our main… (more)

Subjects/Keywords: Approximation; Algorithm; Vehicle; Routing; Group; Coverage; Problem; Deadline; Orienteering; Capacitated; Latency

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Martin, C. S. (2016). Approximation Algorithms for Group Coverage and Vehicle Routing Problems. (Masters Thesis). University of Alberta. Retrieved from https://era.library.ualberta.ca/files/cbr86b386b

Chicago Manual of Style (16th Edition):

Martin, Christopher S. “Approximation Algorithms for Group Coverage and Vehicle Routing Problems.” 2016. Masters Thesis, University of Alberta. Accessed September 18, 2019. https://era.library.ualberta.ca/files/cbr86b386b.

MLA Handbook (7th Edition):

Martin, Christopher S. “Approximation Algorithms for Group Coverage and Vehicle Routing Problems.” 2016. Web. 18 Sep 2019.

Vancouver:

Martin CS. Approximation Algorithms for Group Coverage and Vehicle Routing Problems. [Internet] [Masters thesis]. University of Alberta; 2016. [cited 2019 Sep 18]. Available from: https://era.library.ualberta.ca/files/cbr86b386b.

Council of Science Editors:

Martin CS. Approximation Algorithms for Group Coverage and Vehicle Routing Problems. [Masters Thesis]. University of Alberta; 2016. Available from: https://era.library.ualberta.ca/files/cbr86b386b

24. Sivakumar, Rohit. Approximation Algorithms for Min Sum k-Clustering and Balanced k-Median.

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

 In this thesis, we consider two closely related clustering problems, Min Sum k-Clustering (MSkC) and Balanced k-Median (BkM). In Min Sum k-clustering, one is given… (more)

Subjects/Keywords: Clustering; Optimization; Approximation; Algorithms

…vi , vj ∈ V and i < j. 1.3 Approximation Algorithms Given a set of feasible solutions F… …mathematically for every instance of the problem are called Approximation Algorithms. An approximation… …algorithm A with a polynomial running time for a problem P has an approximation ratio of α ≥ 1 if… …I A randomized polynomial time algorithm R for a problem P has an approximation ratio of… …x28;I) )] ≤ α. A constant factor I approximation algorithm is an… 

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Sivakumar, R. (2015). Approximation Algorithms for Min Sum k-Clustering and Balanced k-Median. (Masters Thesis). University of Alberta. Retrieved from https://era.library.ualberta.ca/files/rj430724q

Chicago Manual of Style (16th Edition):

Sivakumar, Rohit. “Approximation Algorithms for Min Sum k-Clustering and Balanced k-Median.” 2015. Masters Thesis, University of Alberta. Accessed September 18, 2019. https://era.library.ualberta.ca/files/rj430724q.

MLA Handbook (7th Edition):

Sivakumar, Rohit. “Approximation Algorithms for Min Sum k-Clustering and Balanced k-Median.” 2015. Web. 18 Sep 2019.

Vancouver:

Sivakumar R. Approximation Algorithms for Min Sum k-Clustering and Balanced k-Median. [Internet] [Masters thesis]. University of Alberta; 2015. [cited 2019 Sep 18]. Available from: https://era.library.ualberta.ca/files/rj430724q.

Council of Science Editors:

Sivakumar R. Approximation Algorithms for Min Sum k-Clustering and Balanced k-Median. [Masters Thesis]. University of Alberta; 2015. Available from: https://era.library.ualberta.ca/files/rj430724q


Laurentian University

25. Almaatani, Dalia Essa. New computational approaches for the transportation models .

Degree: 2014, Laurentian University

 The Transportation model (TP) is one of the oldest practical problems in mathematical programing. This model and its relevant extensions play important roles in Operations… (more)

Subjects/Keywords: Linear Transportation problem; Unbalanced Transportation problem; Transshipment problem; Vogel Approximation Method

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Almaatani, D. E. (2014). New computational approaches for the transportation models . (Thesis). Laurentian University. Retrieved from https://zone.biblio.laurentian.ca/dspace/handle/10219/2250

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

Almaatani, Dalia Essa. “New computational approaches for the transportation models .” 2014. Thesis, Laurentian University. Accessed September 18, 2019. https://zone.biblio.laurentian.ca/dspace/handle/10219/2250.

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

MLA Handbook (7th Edition):

Almaatani, Dalia Essa. “New computational approaches for the transportation models .” 2014. Web. 18 Sep 2019.

Vancouver:

Almaatani DE. New computational approaches for the transportation models . [Internet] [Thesis]. Laurentian University; 2014. [cited 2019 Sep 18]. Available from: https://zone.biblio.laurentian.ca/dspace/handle/10219/2250.

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

Council of Science Editors:

Almaatani DE. New computational approaches for the transportation models . [Thesis]. Laurentian University; 2014. Available from: https://zone.biblio.laurentian.ca/dspace/handle/10219/2250

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


University of Western Ontario

26. Price, Devin. High Multiplicity Strip Packing.

Degree: 2014, University of Western Ontario

 An instance of the two-dimensional strip packing problem is specified by n rectangular items, each having a width, 0 < wn ≤ 1, and height,… (more)

Subjects/Keywords: strip packing; approximation algorithm; optimization; Theory and Algorithms

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Price, D. (2014). High Multiplicity Strip Packing. (Thesis). University of Western Ontario. Retrieved from https://ir.lib.uwo.ca/etd/1915

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

Price, Devin. “High Multiplicity Strip Packing.” 2014. Thesis, University of Western Ontario. Accessed September 18, 2019. https://ir.lib.uwo.ca/etd/1915.

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

MLA Handbook (7th Edition):

Price, Devin. “High Multiplicity Strip Packing.” 2014. Web. 18 Sep 2019.

Vancouver:

Price D. High Multiplicity Strip Packing. [Internet] [Thesis]. University of Western Ontario; 2014. [cited 2019 Sep 18]. Available from: https://ir.lib.uwo.ca/etd/1915.

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

Council of Science Editors:

Price D. High Multiplicity Strip Packing. [Thesis]. University of Western Ontario; 2014. Available from: https://ir.lib.uwo.ca/etd/1915

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


University of Western Ontario

27. Askaripour, Nadya. Holomorphic k-differentials and holomorphic approximation on open Riemann surfaces.

Degree: 2010, University of Western Ontario

 This thesis is of two parts: At the first part (Chapters 1 and 2) we study some spaces of holomorphic k-differentials on open Riemann surfaces,… (more)

Subjects/Keywords: Riemann surface; k-differential; Poincare series; holomorphic approximation; Extension Theorem; Analysis

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Askaripour, N. (2010). Holomorphic k-differentials and holomorphic approximation on open Riemann surfaces. (Thesis). University of Western Ontario. Retrieved from https://ir.lib.uwo.ca/etd/9

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

Askaripour, Nadya. “Holomorphic k-differentials and holomorphic approximation on open Riemann surfaces.” 2010. Thesis, University of Western Ontario. Accessed September 18, 2019. https://ir.lib.uwo.ca/etd/9.

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

MLA Handbook (7th Edition):

Askaripour, Nadya. “Holomorphic k-differentials and holomorphic approximation on open Riemann surfaces.” 2010. Web. 18 Sep 2019.

Vancouver:

Askaripour N. Holomorphic k-differentials and holomorphic approximation on open Riemann surfaces. [Internet] [Thesis]. University of Western Ontario; 2010. [cited 2019 Sep 18]. Available from: https://ir.lib.uwo.ca/etd/9.

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

Council of Science Editors:

Askaripour N. Holomorphic k-differentials and holomorphic approximation on open Riemann surfaces. [Thesis]. University of Western Ontario; 2010. Available from: https://ir.lib.uwo.ca/etd/9

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


University of Western Ontario

28. Wu, Zhenfei. Solving Capacitated Data Storage Placement Problems in Sensor Networks.

Degree: 2017, University of Western Ontario

 Data storage is an important issue in sensor networks as the large amount of data collected by the sensors in such networks needs to be… (more)

Subjects/Keywords: data storage; capacited k-median problem; approximation algorithm; Theory and Algorithms

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Wu, Z. (2017). Solving Capacitated Data Storage Placement Problems in Sensor Networks. (Thesis). University of Western Ontario. Retrieved from https://ir.lib.uwo.ca/etd/4540

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

Wu, Zhenfei. “Solving Capacitated Data Storage Placement Problems in Sensor Networks.” 2017. Thesis, University of Western Ontario. Accessed September 18, 2019. https://ir.lib.uwo.ca/etd/4540.

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

MLA Handbook (7th Edition):

Wu, Zhenfei. “Solving Capacitated Data Storage Placement Problems in Sensor Networks.” 2017. Web. 18 Sep 2019.

Vancouver:

Wu Z. Solving Capacitated Data Storage Placement Problems in Sensor Networks. [Internet] [Thesis]. University of Western Ontario; 2017. [cited 2019 Sep 18]. Available from: https://ir.lib.uwo.ca/etd/4540.

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

Council of Science Editors:

Wu Z. Solving Capacitated Data Storage Placement Problems in Sensor Networks. [Thesis]. University of Western Ontario; 2017. Available from: https://ir.lib.uwo.ca/etd/4540

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


University of Victoria

29. Mukherjee, Ishita. Hybrid photonic crystal nanobeam cavities: design, fabrication and analysis.

Degree: Dept. of Electrical and Computer Engineering, 2012, University of Victoria

 Photonic cavities are able to confine light to a volume of the order of wavelength of light and this ability can be described in terms… (more)

Subjects/Keywords: Plasmonics; Nanophotonics and photonic crystals; Nanostructure fabrication; Numerical approximation and analysis

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Mukherjee, I. (2012). Hybrid photonic crystal nanobeam cavities: design, fabrication and analysis. (Masters Thesis). University of Victoria. Retrieved from http://hdl.handle.net/1828/4313

Chicago Manual of Style (16th Edition):

Mukherjee, Ishita. “Hybrid photonic crystal nanobeam cavities: design, fabrication and analysis.” 2012. Masters Thesis, University of Victoria. Accessed September 18, 2019. http://hdl.handle.net/1828/4313.

MLA Handbook (7th Edition):

Mukherjee, Ishita. “Hybrid photonic crystal nanobeam cavities: design, fabrication and analysis.” 2012. Web. 18 Sep 2019.

Vancouver:

Mukherjee I. Hybrid photonic crystal nanobeam cavities: design, fabrication and analysis. [Internet] [Masters thesis]. University of Victoria; 2012. [cited 2019 Sep 18]. Available from: http://hdl.handle.net/1828/4313.

Council of Science Editors:

Mukherjee I. Hybrid photonic crystal nanobeam cavities: design, fabrication and analysis. [Masters Thesis]. University of Victoria; 2012. Available from: http://hdl.handle.net/1828/4313

30. Mir, Youness. Modélisation mathématique et courbes de croissance.

Degree: PhD, Mathématiques, 2015, Université de Sherbrooke

 La modélisation mathématique est un outil largement employé dans plusieurs disciplines des sciences appliquées. En hydrologie, en biologie, en économie ainsi que d'autres domaines des… (more)

Subjects/Keywords: Mathématiques appliquées; Modélisation; Équations différentielles; Analyse; Approximation et interpolation; Analyse numérique

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Mir, Y. (2015). Modélisation mathématique et courbes de croissance. (Doctoral Dissertation). Université de Sherbrooke. Retrieved from http://www.collectionscanada.gc.ca/obj/thesescanada/vol2/QSHERU/TC-QSHERU-11143_6026.pdf ; http://savoirs.usherbrooke.ca/bitstream/11143/6026/9/Mir_Youness_PhD_2015.pdf

Chicago Manual of Style (16th Edition):

Mir, Youness. “Modélisation mathématique et courbes de croissance.” 2015. Doctoral Dissertation, Université de Sherbrooke. Accessed September 18, 2019. http://www.collectionscanada.gc.ca/obj/thesescanada/vol2/QSHERU/TC-QSHERU-11143_6026.pdf ; http://savoirs.usherbrooke.ca/bitstream/11143/6026/9/Mir_Youness_PhD_2015.pdf.

MLA Handbook (7th Edition):

Mir, Youness. “Modélisation mathématique et courbes de croissance.” 2015. Web. 18 Sep 2019.

Vancouver:

Mir Y. Modélisation mathématique et courbes de croissance. [Internet] [Doctoral dissertation]. Université de Sherbrooke; 2015. [cited 2019 Sep 18]. Available from: http://www.collectionscanada.gc.ca/obj/thesescanada/vol2/QSHERU/TC-QSHERU-11143_6026.pdf ; http://savoirs.usherbrooke.ca/bitstream/11143/6026/9/Mir_Youness_PhD_2015.pdf.

Council of Science Editors:

Mir Y. Modélisation mathématique et courbes de croissance. [Doctoral Dissertation]. Université de Sherbrooke; 2015. Available from: http://www.collectionscanada.gc.ca/obj/thesescanada/vol2/QSHERU/TC-QSHERU-11143_6026.pdf ; http://savoirs.usherbrooke.ca/bitstream/11143/6026/9/Mir_Youness_PhD_2015.pdf

[1] [2] [3] [4] [5] [6] [7]

.