Advanced search options

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

You searched for `subject:( Approximation Algorithm)`

.
Showing records 1 – 30 of
152 total matches.

Search Limiters

Dates

- 2015 – 2019 (69)
- 2010 – 2014 (56)
- 2005 – 2009 (20)

Degrees

- PhD (43)
- Docteur es (16)

▼ Search Limiters

University of Waterloo

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

Degree: 2018, University of Waterloo

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

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

❌

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

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

Jain, Kshitij. “Minimum Shared-Power Edge Cut.” 2018. Thesis, University of Waterloo. Accessed December 13, 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 (7^{th} Edition):

Jain, Kshitij. “Minimum Shared-Power Edge Cut.” 2018. Web. 13 Dec 2019.

Vancouver:

Jain K. Minimum Shared-Power Edge Cut. [Internet] [Thesis]. University of Waterloo; 2018. [cited 2019 Dec 13]. 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

Not specified: Masters Thesis or Doctoral Dissertation

Cornell University

2. Qian, Jiawei. Prize-Collecting Network Design .

Degree: 2012, Cornell University

URL: http://hdl.handle.net/1813/29363

► Network design is an active research area in discrete optimization that focuses on problems arising from the construction of communication networks. The prize-collecting version of…
(more)

Subjects/Keywords: Network design; Approximation algorithm; Online algorithm

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Qian, J. (2012). Prize-Collecting Network Design . (Thesis). Cornell University. Retrieved from http://hdl.handle.net/1813/29363

Not specified: Masters Thesis or Doctoral Dissertation

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

Qian, Jiawei. “Prize-Collecting Network Design .” 2012. Thesis, Cornell University. Accessed December 13, 2019. http://hdl.handle.net/1813/29363.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Qian, Jiawei. “Prize-Collecting Network Design .” 2012. Web. 13 Dec 2019.

Vancouver:

Qian J. Prize-Collecting Network Design . [Internet] [Thesis]. Cornell University; 2012. [cited 2019 Dec 13]. Available from: http://hdl.handle.net/1813/29363.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Qian J. Prize-Collecting Network Design . [Thesis]. Cornell University; 2012. Available from: http://hdl.handle.net/1813/29363

Not specified: Masters Thesis or Doctoral Dissertation

Texas A&M University

3. Sundar, Kaarthik. Motion Planning for Unmanned Aerial Vehicles with Resource Constraints.

Degree: 2012, Texas A&M University

URL: http://hdl.handle.net/1969.1/ETD-TAMU-2012-08-11694

► Small Unmanned Aerial Vehicles (UAVs) are currently used in several surveillance applications to monitor a set of targets and collect relevant data. One of the…
(more)

Subjects/Keywords: Motion planning; Resource constraints; Approximation algorithm

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Sundar, K. (2012). Motion Planning for Unmanned Aerial Vehicles with Resource Constraints. (Thesis). Texas A&M University. Retrieved from http://hdl.handle.net/1969.1/ETD-TAMU-2012-08-11694

Not specified: Masters Thesis or Doctoral Dissertation

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

Sundar, Kaarthik. “Motion Planning for Unmanned Aerial Vehicles with Resource Constraints.” 2012. Thesis, Texas A&M University. Accessed December 13, 2019. http://hdl.handle.net/1969.1/ETD-TAMU-2012-08-11694.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Sundar, Kaarthik. “Motion Planning for Unmanned Aerial Vehicles with Resource Constraints.” 2012. Web. 13 Dec 2019.

Vancouver:

Sundar K. Motion Planning for Unmanned Aerial Vehicles with Resource Constraints. [Internet] [Thesis]. Texas A&M University; 2012. [cited 2019 Dec 13]. Available from: http://hdl.handle.net/1969.1/ETD-TAMU-2012-08-11694.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Sundar K. Motion Planning for Unmanned Aerial Vehicles with Resource Constraints. [Thesis]. Texas A&M University; 2012. Available from: http://hdl.handle.net/1969.1/ETD-TAMU-2012-08-11694

Not specified: Masters Thesis or Doctoral Dissertation

Penn State University

4. Kannan, Aswin. Distributed Algorithms for Optimization and.

Degree: PhD, Industrial Engineering, 2014, Penn State University

URL: https://etda.libraries.psu.edu/catalog/24252

► This dissertation considers three sets of problems arising from optimization and game-theoretic problems complicated by the presence of uncertainty, limited information, and problem misspecification. Broadly…
(more)

Subjects/Keywords: Variational inequalities; distributed algorithm; stochastic approximation; pseudomonotone.

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Kannan, A. (2014). Distributed Algorithms for Optimization and. (Doctoral Dissertation). Penn State University. Retrieved from https://etda.libraries.psu.edu/catalog/24252

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

Kannan, Aswin. “Distributed Algorithms for Optimization and.” 2014. Doctoral Dissertation, Penn State University. Accessed December 13, 2019. https://etda.libraries.psu.edu/catalog/24252.

MLA Handbook (7^{th} Edition):

Kannan, Aswin. “Distributed Algorithms for Optimization and.” 2014. Web. 13 Dec 2019.

Vancouver:

Kannan A. Distributed Algorithms for Optimization and. [Internet] [Doctoral dissertation]. Penn State University; 2014. [cited 2019 Dec 13]. Available from: https://etda.libraries.psu.edu/catalog/24252.

Council of Science Editors:

Kannan A. Distributed Algorithms for Optimization and. [Doctoral Dissertation]. Penn State University; 2014. Available from: https://etda.libraries.psu.edu/catalog/24252

Virginia Tech

5.
Wessels, Mariette Christine.
A Grid-Based *Approximation* *Algorithm* for the Minimum Weight Triangulation Problem.

Degree: MS, Mathematics, 2017, Virginia Tech

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

► Given a set of n points on a plane, in the Minimum Weight Triangulation problem, we wish to find a triangulation that minimizes the sum…
(more)

Subjects/Keywords: Minimum Weight Triangulation; Approximation Algorithm; Geometric Optimization

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Wessels, M. C. (2017). A Grid-Based Approximation Algorithm for the Minimum Weight Triangulation Problem. (Masters Thesis). Virginia Tech. Retrieved from http://hdl.handle.net/10919/77933

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

Wessels, Mariette Christine. “A Grid-Based Approximation Algorithm for the Minimum Weight Triangulation Problem.” 2017. Masters Thesis, Virginia Tech. Accessed December 13, 2019. http://hdl.handle.net/10919/77933.

MLA Handbook (7^{th} Edition):

Wessels, Mariette Christine. “A Grid-Based Approximation Algorithm for the Minimum Weight Triangulation Problem.” 2017. Web. 13 Dec 2019.

Vancouver:

Wessels MC. A Grid-Based Approximation Algorithm for the Minimum Weight Triangulation Problem. [Internet] [Masters thesis]. Virginia Tech; 2017. [cited 2019 Dec 13]. Available from: http://hdl.handle.net/10919/77933.

Council of Science Editors:

Wessels MC. A Grid-Based Approximation Algorithm for the Minimum Weight Triangulation Problem. [Masters Thesis]. Virginia Tech; 2017. Available from: http://hdl.handle.net/10919/77933

Cornell University

6. Tong, Chaoxu. Some Resource Allocation Problems .

Degree: 2016, Cornell University

URL: http://hdl.handle.net/1813/43582

► We include three works on resource allocation in this thesis. Proper pricing helps the system to allocate resource efficiently. However, the computational efforts to obtain…
(more)

Subjects/Keywords: Revenue Management; Approximation Algorithm; Resource Sharing

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Tong, C. (2016). Some Resource Allocation Problems . (Thesis). Cornell University. Retrieved from http://hdl.handle.net/1813/43582

Not specified: Masters Thesis or Doctoral Dissertation

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

Tong, Chaoxu. “Some Resource Allocation Problems .” 2016. Thesis, Cornell University. Accessed December 13, 2019. http://hdl.handle.net/1813/43582.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Tong, Chaoxu. “Some Resource Allocation Problems .” 2016. Web. 13 Dec 2019.

Vancouver:

Tong C. Some Resource Allocation Problems . [Internet] [Thesis]. Cornell University; 2016. [cited 2019 Dec 13]. Available from: http://hdl.handle.net/1813/43582.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Tong C. Some Resource Allocation Problems . [Thesis]. Cornell University; 2016. Available from: http://hdl.handle.net/1813/43582

Not specified: Masters Thesis or Doctoral Dissertation

University of Illinois – Urbana-Champaign

7.
Gupta, Shalmoli.
* Approximation* algorithms for clustering and facility location problems.

Degree: PhD, Computer Science, 2018, University of Illinois – Urbana-Champaign

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

► In this thesis we design and analyze algorithms for various facility location and clustering problems. The problems we study are NP-Hard and therefore, assuming P…
(more)

Subjects/Keywords: Approximation Algorithm; Clustering; Facility Location; Submodular function

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Gupta, S. (2018). Approximation algorithms for clustering and facility location problems. (Doctoral Dissertation). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/102419

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

Gupta, Shalmoli. “Approximation algorithms for clustering and facility location problems.” 2018. Doctoral Dissertation, University of Illinois – Urbana-Champaign. Accessed December 13, 2019. http://hdl.handle.net/2142/102419.

MLA Handbook (7^{th} Edition):

Gupta, Shalmoli. “Approximation algorithms for clustering and facility location problems.” 2018. Web. 13 Dec 2019.

Vancouver:

Gupta S. Approximation algorithms for clustering and facility location problems. [Internet] [Doctoral dissertation]. University of Illinois – Urbana-Champaign; 2018. [cited 2019 Dec 13]. Available from: http://hdl.handle.net/2142/102419.

Council of Science Editors:

Gupta S. Approximation algorithms for clustering and facility location problems. [Doctoral Dissertation]. University of Illinois – Urbana-Champaign; 2018. Available from: http://hdl.handle.net/2142/102419

University of Waterloo

8. 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 December 13, 2019. 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. 13 Dec 2019.

Vancouver:

Koh ZK. Stabilizing Weighted Graphs. [Internet] [Thesis]. University of Waterloo; 2017. [cited 2019 Dec 13]. 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

9.
Pontoizeau, Thomas.
Community detection : computational complexity and *approximation* : Détection de communautés : complexité computationnelle et * approximation*.

Degree: Docteur es, Informatique, 2018, Paris Sciences et Lettres

URL: http://www.theses.fr/2018PSLED007

►

Cette thèse étudie la détection de communautés dans le contexte des réseaux sociaux. Un réseau social peut être modélisé par un graphe dans lequel les… (more)

Subjects/Keywords: Complexité; Algorithme; Graphes; Approximation; Complexity; Algorithm; Graphs; Approximation; 003

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Pontoizeau, T. (2018). Community detection : computational complexity and approximation : Détection de communautés : complexité computationnelle et approximation. (Doctoral Dissertation). Paris Sciences et Lettres. Retrieved from http://www.theses.fr/2018PSLED007

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

Pontoizeau, Thomas. “Community detection : computational complexity and approximation : Détection de communautés : complexité computationnelle et approximation.” 2018. Doctoral Dissertation, Paris Sciences et Lettres. Accessed December 13, 2019. http://www.theses.fr/2018PSLED007.

MLA Handbook (7^{th} Edition):

Pontoizeau, Thomas. “Community detection : computational complexity and approximation : Détection de communautés : complexité computationnelle et approximation.” 2018. Web. 13 Dec 2019.

Vancouver:

Pontoizeau T. Community detection : computational complexity and approximation : Détection de communautés : complexité computationnelle et approximation. [Internet] [Doctoral dissertation]. Paris Sciences et Lettres; 2018. [cited 2019 Dec 13]. Available from: http://www.theses.fr/2018PSLED007.

Council of Science Editors:

Pontoizeau T. Community detection : computational complexity and approximation : Détection de communautés : complexité computationnelle et approximation. [Doctoral Dissertation]. Paris Sciences et Lettres; 2018. Available from: http://www.theses.fr/2018PSLED007

Carnegie Mellon University

10. Wu, Yi. The Approximability of Learning and Constraint Satisfaction Problems.

Degree: 2010, Carnegie Mellon University

URL: http://repository.cmu.edu/dissertations/24

► An α-*approximation* *algorithm* is an *algorithm* guaranteed to output a solutionthat is within an α ratio of the optimal solution. We are interested in thefollowing…
(more)

Subjects/Keywords: Complexity Theory; Approximation Algorithm; Computational Learning; Constraint Satisfaction Problem; Hardness of Approximation; Semidefinite Programming

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Wu, Y. (2010). The Approximability of Learning and Constraint Satisfaction Problems. (Thesis). Carnegie Mellon University. Retrieved from http://repository.cmu.edu/dissertations/24

Not specified: Masters Thesis or Doctoral Dissertation

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

Wu, Yi. “The Approximability of Learning and Constraint Satisfaction Problems.” 2010. Thesis, Carnegie Mellon University. Accessed December 13, 2019. http://repository.cmu.edu/dissertations/24.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Wu, Yi. “The Approximability of Learning and Constraint Satisfaction Problems.” 2010. Web. 13 Dec 2019.

Vancouver:

Wu Y. The Approximability of Learning and Constraint Satisfaction Problems. [Internet] [Thesis]. Carnegie Mellon University; 2010. [cited 2019 Dec 13]. Available from: http://repository.cmu.edu/dissertations/24.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Wu Y. The Approximability of Learning and Constraint Satisfaction Problems. [Thesis]. Carnegie Mellon University; 2010. Available from: http://repository.cmu.edu/dissertations/24

Not specified: Masters Thesis or Doctoral Dissertation

University of Michigan

11. Shen, Xiangkun. Linear and Convex Programming Based Algorithms for Network Design.

Degree: PhD, Industrial & Operations Engineering, 2019, University of Michigan

URL: http://hdl.handle.net/2027.42/151498

► This thesis presents linear and convex programming based algorithms for NP-hard discrete optimization problems, mainly with applications in network design. Network design problems aim to…
(more)

Subjects/Keywords: Approximation algorithm; Linear programming; Stochastic optimization; Online algorithm; Network design; Industrial and Operations Engineering; Engineering

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Shen, X. (2019). Linear and Convex Programming Based Algorithms for Network Design. (Doctoral Dissertation). University of Michigan. Retrieved from http://hdl.handle.net/2027.42/151498

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

Shen, Xiangkun. “Linear and Convex Programming Based Algorithms for Network Design.” 2019. Doctoral Dissertation, University of Michigan. Accessed December 13, 2019. http://hdl.handle.net/2027.42/151498.

MLA Handbook (7^{th} Edition):

Shen, Xiangkun. “Linear and Convex Programming Based Algorithms for Network Design.” 2019. Web. 13 Dec 2019.

Vancouver:

Shen X. Linear and Convex Programming Based Algorithms for Network Design. [Internet] [Doctoral dissertation]. University of Michigan; 2019. [cited 2019 Dec 13]. Available from: http://hdl.handle.net/2027.42/151498.

Council of Science Editors:

Shen X. Linear and Convex Programming Based Algorithms for Network Design. [Doctoral Dissertation]. University of Michigan; 2019. Available from: http://hdl.handle.net/2027.42/151498

University of Alberta

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

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

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

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

❌

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

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

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

MLA Handbook (7^{th} Edition):

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

Vancouver:

Martin CS. Approximation Algorithms for Group Coverage and Vehicle Routing Problems. [Internet] [Masters thesis]. University of Alberta; 2016. [cited 2019 Dec 13]. 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

Texas A&M University

13.
Doshi, Riddhi Rajeev.
* Approximation* Algorithms and Heuristics for a 2-depot, Heterogeneous Hamiltonian Path Problem.

Degree: 2011, Texas A&M University

URL: http://hdl.handle.net/1969.1/ETD-TAMU-2010-08-7736

► Various civil and military applications of UAVs, or ground robots, require a set of vehicles to monitor a group of targets. Routing problems naturally arise…
(more)

Subjects/Keywords: Hamiltonian Path Problem; Heterogeneous Vehicles; Routing; Approximation Algorithm

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Doshi, R. R. (2011). Approximation Algorithms and Heuristics for a 2-depot, Heterogeneous Hamiltonian Path Problem. (Thesis). Texas A&M University. Retrieved from http://hdl.handle.net/1969.1/ETD-TAMU-2010-08-7736

Not specified: Masters Thesis or Doctoral Dissertation

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

Doshi, Riddhi Rajeev. “Approximation Algorithms and Heuristics for a 2-depot, Heterogeneous Hamiltonian Path Problem.” 2011. Thesis, Texas A&M University. Accessed December 13, 2019. http://hdl.handle.net/1969.1/ETD-TAMU-2010-08-7736.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Doshi, Riddhi Rajeev. “Approximation Algorithms and Heuristics for a 2-depot, Heterogeneous Hamiltonian Path Problem.” 2011. Web. 13 Dec 2019.

Vancouver:

Doshi RR. Approximation Algorithms and Heuristics for a 2-depot, Heterogeneous Hamiltonian Path Problem. [Internet] [Thesis]. Texas A&M University; 2011. [cited 2019 Dec 13]. Available from: http://hdl.handle.net/1969.1/ETD-TAMU-2010-08-7736.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Doshi RR. Approximation Algorithms and Heuristics for a 2-depot, Heterogeneous Hamiltonian Path Problem. [Thesis]. Texas A&M University; 2011. Available from: http://hdl.handle.net/1969.1/ETD-TAMU-2010-08-7736

Not specified: Masters Thesis or Doctoral Dissertation

University of Cincinnati

14. Anderson, Thomas. Built-In Self Training of Hardware-Based Neural Networks.

Degree: MS, Engineering and Applied Science: Computer Engineering, 2017, University of Cincinnati

URL: http://rave.ohiolink.edu/etdc/view?acc_num=ucin1512039036199393

► Articial neural networks and deep learning are a topic of increasing interest in computing. This has spurred investigation into dedicated hardware like accelerators to speed…
(more)

Subjects/Keywords: Computer Engineering; neural networks; backpropagation algorithm; training; accelerator; hardware; function approximation

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Anderson, T. (2017). Built-In Self Training of Hardware-Based Neural Networks. (Masters Thesis). University of Cincinnati. Retrieved from http://rave.ohiolink.edu/etdc/view?acc_num=ucin1512039036199393

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

Anderson, Thomas. “Built-In Self Training of Hardware-Based Neural Networks.” 2017. Masters Thesis, University of Cincinnati. Accessed December 13, 2019. http://rave.ohiolink.edu/etdc/view?acc_num=ucin1512039036199393.

MLA Handbook (7^{th} Edition):

Anderson, Thomas. “Built-In Self Training of Hardware-Based Neural Networks.” 2017. Web. 13 Dec 2019.

Vancouver:

Anderson T. Built-In Self Training of Hardware-Based Neural Networks. [Internet] [Masters thesis]. University of Cincinnati; 2017. [cited 2019 Dec 13]. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=ucin1512039036199393.

Council of Science Editors:

Anderson T. Built-In Self Training of Hardware-Based Neural Networks. [Masters Thesis]. University of Cincinnati; 2017. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=ucin1512039036199393

Penn State University

15. Liu, Changlei. Supporting Multi-Missions In Wireless Sensor Networks.

Degree: PhD, Computer Science and Engineering, 2010, Penn State University

URL: https://etda.libraries.psu.edu/catalog/10920

► The recent advances in sensing devices, embedded computing and wireless communication technology has sparked the emergence of the wireless sensor networks. However, most of the…
(more)

Subjects/Keywords: sensor network; multi-mission; wireless; approximation algorithm; coverage; landmine; monitoring

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Liu, C. (2010). Supporting Multi-Missions In Wireless Sensor Networks. (Doctoral Dissertation). Penn State University. Retrieved from https://etda.libraries.psu.edu/catalog/10920

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

Liu, Changlei. “Supporting Multi-Missions In Wireless Sensor Networks.” 2010. Doctoral Dissertation, Penn State University. Accessed December 13, 2019. https://etda.libraries.psu.edu/catalog/10920.

MLA Handbook (7^{th} Edition):

Liu, Changlei. “Supporting Multi-Missions In Wireless Sensor Networks.” 2010. Web. 13 Dec 2019.

Vancouver:

Liu C. Supporting Multi-Missions In Wireless Sensor Networks. [Internet] [Doctoral dissertation]. Penn State University; 2010. [cited 2019 Dec 13]. Available from: https://etda.libraries.psu.edu/catalog/10920.

Council of Science Editors:

Liu C. Supporting Multi-Missions In Wireless Sensor Networks. [Doctoral Dissertation]. Penn State University; 2010. Available from: https://etda.libraries.psu.edu/catalog/10920

University of Western Ontario

16. Price, Devin. High Multiplicity Strip Packing.

Degree: 2014, University of Western Ontario

URL: https://ir.lib.uwo.ca/etd/1915

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

❌

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

APA (6^{th} Edition):

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

Not specified: Masters Thesis or Doctoral Dissertation

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

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

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Price, Devin. “High Multiplicity Strip Packing.” 2014. Web. 13 Dec 2019.

Vancouver:

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

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

Not specified: Masters Thesis or Doctoral Dissertation

University of Western Ontario

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

Degree: 2017, University of Western Ontario

URL: https://ir.lib.uwo.ca/etd/4540

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

❌

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

APA (6^{th} 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

Not specified: Masters Thesis or Doctoral Dissertation

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

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

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

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

Vancouver:

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

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

Not specified: Masters Thesis or Doctoral Dissertation

McMaster University

18.
Griscik, Michael Paul.
A New *Algorithm* for Stochastic * Approximation*.

Degree: MEngr, 1970, McMaster University

URL: http://hdl.handle.net/11375/17894

►

A review of Stochastic *Approximation* and the major contributions to the area is made. A proof of convergence for the *algorithm* is developed. An…
(more)

Subjects/Keywords: stochastic; algorithm; approximation; convergence; optimization

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Griscik, M. P. (1970). A New Algorithm for Stochastic Approximation. (Masters Thesis). McMaster University. Retrieved from http://hdl.handle.net/11375/17894

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

Griscik, Michael Paul. “A New Algorithm for Stochastic Approximation.” 1970. Masters Thesis, McMaster University. Accessed December 13, 2019. http://hdl.handle.net/11375/17894.

MLA Handbook (7^{th} Edition):

Griscik, Michael Paul. “A New Algorithm for Stochastic Approximation.” 1970. Web. 13 Dec 2019.

Vancouver:

Griscik MP. A New Algorithm for Stochastic Approximation. [Internet] [Masters thesis]. McMaster University; 1970. [cited 2019 Dec 13]. Available from: http://hdl.handle.net/11375/17894.

Council of Science Editors:

Griscik MP. A New Algorithm for Stochastic Approximation. [Masters Thesis]. McMaster University; 1970. Available from: http://hdl.handle.net/11375/17894

University of Waterloo

19.
Dippel, Jack.
The Matching Augmentation Problem: A 7/4-*Approximation* * Algorithm*.

Degree: 2019, University of Waterloo

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

► We present a 7/4 *approximation* *algorithm* for the matching augmentation problem (MAP): given a multi-graph with edges of cost either zero or one such that…
(more)

Subjects/Keywords: map; matching augmentation problem; approximation algorithm; 7/4

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Dippel, J. (2019). The Matching Augmentation Problem: A 7/4-Approximation Algorithm. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/14700

Not specified: Masters Thesis or Doctoral Dissertation

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

Dippel, Jack. “The Matching Augmentation Problem: A 7/4-Approximation Algorithm.” 2019. Thesis, University of Waterloo. Accessed December 13, 2019. http://hdl.handle.net/10012/14700.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Dippel, Jack. “The Matching Augmentation Problem: A 7/4-Approximation Algorithm.” 2019. Web. 13 Dec 2019.

Vancouver:

Dippel J. The Matching Augmentation Problem: A 7/4-Approximation Algorithm. [Internet] [Thesis]. University of Waterloo; 2019. [cited 2019 Dec 13]. Available from: http://hdl.handle.net/10012/14700.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Dippel J. The Matching Augmentation Problem: A 7/4-Approximation Algorithm. [Thesis]. University of Waterloo; 2019. Available from: http://hdl.handle.net/10012/14700

Not specified: Masters Thesis or Doctoral Dissertation

University of Newcastle

20. Kapoor, Reena. Scheduling problems arising in coal export supply chains: algorithms and complexity.

Degree: non-terminal) node equals the total capacity of arcs leaving the node; and identical capacities on all arcs. Another factor that has a great impact on the throughput of the coal supply chain is the management of the stockyard, which is the interface between the land portion of the coal supply chain and the ocean portion of the coal supply chain, and where the cargoes get assembled. Given a number of vessels arriving at the port, stockyard management decisions include: assigning a location to each cargo (stockpile, 2015, University of Newcastle

URL: http://hdl.handle.net/1959.13/1310323

►

Research Doctorate - Doctor of Philosophy

A coal supply chain is a highly complex logistics system, comprising of several parties and components, focused on transporting… (more)

Subjects/Keywords: mixed integer programming; computational complexity; approximation algorithm; network optimization; scheduling; routing

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Kapoor, R. (2015). Scheduling problems arising in coal export supply chains: algorithms and complexity. (Doctoral Dissertation). University of Newcastle. Retrieved from http://hdl.handle.net/1959.13/1310323

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

Kapoor, Reena. “Scheduling problems arising in coal export supply chains: algorithms and complexity.” 2015. Doctoral Dissertation, University of Newcastle. Accessed December 13, 2019. http://hdl.handle.net/1959.13/1310323.

MLA Handbook (7^{th} Edition):

Kapoor, Reena. “Scheduling problems arising in coal export supply chains: algorithms and complexity.” 2015. Web. 13 Dec 2019.

Vancouver:

Kapoor R. Scheduling problems arising in coal export supply chains: algorithms and complexity. [Internet] [Doctoral dissertation]. University of Newcastle; 2015. [cited 2019 Dec 13]. Available from: http://hdl.handle.net/1959.13/1310323.

Council of Science Editors:

Kapoor R. Scheduling problems arising in coal export supply chains: algorithms and complexity. [Doctoral Dissertation]. University of Newcastle; 2015. Available from: http://hdl.handle.net/1959.13/1310323

The Ohio State University

21. Carpenter, Timothy E. Algorithms For Low-Distortion Embeddings Into Geometrically Restricted Spaces.

Degree: PhD, Computer Science and Engineering, 2019, The Ohio State University

URL: http://rave.ohiolink.edu/etdc/view?acc_num=osu1555337435997622

► We study the problem of finding a minimum-distortion embedding of the shortest path metric of a weighted or unweighted graph into a "simpler" metric…
(more)

Subjects/Keywords: Computer Science; Mathematics; embedding; distortion; approximation; fixed parameter tractable; algorithm

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Carpenter, T. E. (2019). Algorithms For Low-Distortion Embeddings Into Geometrically Restricted Spaces. (Doctoral Dissertation). The Ohio State University. Retrieved from http://rave.ohiolink.edu/etdc/view?acc_num=osu1555337435997622

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

Carpenter, Timothy E. “Algorithms For Low-Distortion Embeddings Into Geometrically Restricted Spaces.” 2019. Doctoral Dissertation, The Ohio State University. Accessed December 13, 2019. http://rave.ohiolink.edu/etdc/view?acc_num=osu1555337435997622.

MLA Handbook (7^{th} Edition):

Carpenter, Timothy E. “Algorithms For Low-Distortion Embeddings Into Geometrically Restricted Spaces.” 2019. Web. 13 Dec 2019.

Vancouver:

Carpenter TE. Algorithms For Low-Distortion Embeddings Into Geometrically Restricted Spaces. [Internet] [Doctoral dissertation]. The Ohio State University; 2019. [cited 2019 Dec 13]. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=osu1555337435997622.

Council of Science Editors:

Carpenter TE. Algorithms For Low-Distortion Embeddings Into Geometrically Restricted Spaces. [Doctoral Dissertation]. The Ohio State University; 2019. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=osu1555337435997622

Kansas State University

22.
Ofori, Francis Ohene.
The impact of
weather change on nitrous oxide emission with spatial pattern
detection and large data * approximation*.

Degree: PhD, Department of Statistics, 2019, Kansas State University

URL: http://hdl.handle.net/2097/39641

► The correlations between agriculture, climate change, and greenhouse gas concentration are multiplex and manifold. Agriculture has been a focus due to its vital connection with…
(more)

Subjects/Keywords: Spatial pattern detection; Geographical algorithm machine; Large Data Approximation

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Ofori, F. O. (2019). The impact of weather change on nitrous oxide emission with spatial pattern detection and large data approximation. (Doctoral Dissertation). Kansas State University. Retrieved from http://hdl.handle.net/2097/39641

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

Ofori, Francis Ohene. “The impact of weather change on nitrous oxide emission with spatial pattern detection and large data approximation.” 2019. Doctoral Dissertation, Kansas State University. Accessed December 13, 2019. http://hdl.handle.net/2097/39641.

MLA Handbook (7^{th} Edition):

Ofori, Francis Ohene. “The impact of weather change on nitrous oxide emission with spatial pattern detection and large data approximation.” 2019. Web. 13 Dec 2019.

Vancouver:

Ofori FO. The impact of weather change on nitrous oxide emission with spatial pattern detection and large data approximation. [Internet] [Doctoral dissertation]. Kansas State University; 2019. [cited 2019 Dec 13]. Available from: http://hdl.handle.net/2097/39641.

Council of Science Editors:

Ofori FO. The impact of weather change on nitrous oxide emission with spatial pattern detection and large data approximation. [Doctoral Dissertation]. Kansas State University; 2019. Available from: http://hdl.handle.net/2097/39641

Virginia Tech

23. Zhang, Jie. Stochastic Programming Approaches to Multi-product Inventory Management Problems with Substitution.

Degree: PhD, Industrial and Systems Engineering, 2019, Virginia Tech

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

► In a multi-product supply chain, the substitution of products arises if a customer's first-choice product is out-of-stock, and she/he have to turn to buy another…
(more)

Subjects/Keywords: Newsvendor Problem; Demand Substitution; Approximation Algorithm; Stochastic Integer Program

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Zhang, J. (2019). Stochastic Programming Approaches to Multi-product Inventory Management Problems with Substitution. (Doctoral Dissertation). Virginia Tech. Retrieved from http://hdl.handle.net/10919/95209

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

Zhang, Jie. “Stochastic Programming Approaches to Multi-product Inventory Management Problems with Substitution.” 2019. Doctoral Dissertation, Virginia Tech. Accessed December 13, 2019. http://hdl.handle.net/10919/95209.

MLA Handbook (7^{th} Edition):

Zhang, Jie. “Stochastic Programming Approaches to Multi-product Inventory Management Problems with Substitution.” 2019. Web. 13 Dec 2019.

Vancouver:

Zhang J. Stochastic Programming Approaches to Multi-product Inventory Management Problems with Substitution. [Internet] [Doctoral dissertation]. Virginia Tech; 2019. [cited 2019 Dec 13]. Available from: http://hdl.handle.net/10919/95209.

Council of Science Editors:

Zhang J. Stochastic Programming Approaches to Multi-product Inventory Management Problems with Substitution. [Doctoral Dissertation]. Virginia Tech; 2019. Available from: http://hdl.handle.net/10919/95209

Indian Institute of Science

24. Lakshmanan, K. Online Learning and Simulation Based Algorithms for Stochastic Optimization.

Degree: 2012, Indian Institute of Science

URL: http://hdl.handle.net/2005/3245

► In many optimization problems, the relationship between the objective and parameters is not known. The objective function itself may be stochastic such as a long-run…
(more)

Subjects/Keywords: Stochastic Approximation Algorithms; Stochastic Optimization; Markov Decision Process; Reinforcement Learning Algorithm; Queueing Networks; Queuing Theory; Quasi-Newton Stochastic Approximation Algorithm; Online Q-Learning Algorithm; Online Actor-Critic Algorithm; Markov Decision Processes; Q-learning Algorithm; Linear Function Approximation; Quasi-Newton Smoothed Functional Algorithms; Computer Science

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Lakshmanan, K. (2012). Online Learning and Simulation Based Algorithms for Stochastic Optimization. (Thesis). Indian Institute of Science. Retrieved from http://hdl.handle.net/2005/3245

Not specified: Masters Thesis or Doctoral Dissertation

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

Lakshmanan, K. “Online Learning and Simulation Based Algorithms for Stochastic Optimization.” 2012. Thesis, Indian Institute of Science. Accessed December 13, 2019. http://hdl.handle.net/2005/3245.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Lakshmanan, K. “Online Learning and Simulation Based Algorithms for Stochastic Optimization.” 2012. Web. 13 Dec 2019.

Vancouver:

Lakshmanan K. Online Learning and Simulation Based Algorithms for Stochastic Optimization. [Internet] [Thesis]. Indian Institute of Science; 2012. [cited 2019 Dec 13]. Available from: http://hdl.handle.net/2005/3245.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Lakshmanan K. Online Learning and Simulation Based Algorithms for Stochastic Optimization. [Thesis]. Indian Institute of Science; 2012. Available from: http://hdl.handle.net/2005/3245

Not specified: Masters Thesis or Doctoral Dissertation

Texas A&M University

25. Fan, Jia-Hao. Cuts and Partitions in Graphs/Trees with Applications.

Degree: 2013, Texas A&M University

URL: http://hdl.handle.net/1969.1/151050

► Both the maximum agreement forest problem and the multicut on trees problem are NP-hard, thus cannot be solved efficiently if P /=NP. The maximum agreement…
(more)

Subjects/Keywords: parameterized algorithm; approximation algorithm; polynomial kernel; bioinformatics; maximum agreement forest; multicut on trees; protein complex prediction

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Fan, J. (2013). Cuts and Partitions in Graphs/Trees with Applications. (Thesis). Texas A&M University. Retrieved from http://hdl.handle.net/1969.1/151050

Not specified: Masters Thesis or Doctoral Dissertation

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

Fan, Jia-Hao. “Cuts and Partitions in Graphs/Trees with Applications.” 2013. Thesis, Texas A&M University. Accessed December 13, 2019. http://hdl.handle.net/1969.1/151050.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Fan, Jia-Hao. “Cuts and Partitions in Graphs/Trees with Applications.” 2013. Web. 13 Dec 2019.

Vancouver:

Fan J. Cuts and Partitions in Graphs/Trees with Applications. [Internet] [Thesis]. Texas A&M University; 2013. [cited 2019 Dec 13]. Available from: http://hdl.handle.net/1969.1/151050.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Fan J. Cuts and Partitions in Graphs/Trees with Applications. [Thesis]. Texas A&M University; 2013. Available from: http://hdl.handle.net/1969.1/151050

Not specified: Masters Thesis or Doctoral Dissertation

University of Pretoria

26. Motsamai, O.S. (Oboetswe Seraga). Optimisation techniques for combustor design.

Degree: Mechanical and Aeronautical Engineering, 2009, University of Pretoria

URL: http://hdl.handle.net/2263/23827

► For gas turbines, the demand for high-performance, more efficient and longer-life turbine blades is increasing. This is especially so, now that there is a need…
(more)

Subjects/Keywords: Successive approximation algorithm; Mathematical optimisation; Computational fluid dynamics; Gradient-based optimisation algorithm; Combustor exit temperature profile; Temperature profile; Design methodology; UCTD

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Motsamai, O. S. (. (2009). Optimisation techniques for combustor design. (Doctoral Dissertation). University of Pretoria. Retrieved from http://hdl.handle.net/2263/23827

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

Motsamai, O S (Oboetswe. “Optimisation techniques for combustor design.” 2009. Doctoral Dissertation, University of Pretoria. Accessed December 13, 2019. http://hdl.handle.net/2263/23827.

MLA Handbook (7^{th} Edition):

Motsamai, O S (Oboetswe. “Optimisation techniques for combustor design.” 2009. Web. 13 Dec 2019.

Vancouver:

Motsamai OS(. Optimisation techniques for combustor design. [Internet] [Doctoral dissertation]. University of Pretoria; 2009. [cited 2019 Dec 13]. Available from: http://hdl.handle.net/2263/23827.

Council of Science Editors:

Motsamai OS(. Optimisation techniques for combustor design. [Doctoral Dissertation]. University of Pretoria; 2009. Available from: http://hdl.handle.net/2263/23827

University of Pretoria

27. [No author]. Optimisation techniques for combustor design .

Degree: 2009, University of Pretoria

URL: http://upetd.up.ac.za/thesis/available/etd-04072009-222336/

► For gas turbines, the demand for high-performance, more efficient and longer-life turbine blades is increasing. This is especially so, now that there is a need…
(more)

Subjects/Keywords: Successive approximation algorithm; Mathematical optimisation; Computational fluid dynamics; Gradient-based optimisation algorithm; Combustor exit temperature profile; Temperature profile; Design methodology; UCTD

Record Details Similar Records

❌

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

APA (6^{th} Edition):

author], [. (2009). Optimisation techniques for combustor design . (Doctoral Dissertation). University of Pretoria. Retrieved from http://upetd.up.ac.za/thesis/available/etd-04072009-222336/

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

author], [No. “Optimisation techniques for combustor design .” 2009. Doctoral Dissertation, University of Pretoria. Accessed December 13, 2019. http://upetd.up.ac.za/thesis/available/etd-04072009-222336/.

MLA Handbook (7^{th} Edition):

author], [No. “Optimisation techniques for combustor design .” 2009. Web. 13 Dec 2019.

Vancouver:

author] [. Optimisation techniques for combustor design . [Internet] [Doctoral dissertation]. University of Pretoria; 2009. [cited 2019 Dec 13]. Available from: http://upetd.up.ac.za/thesis/available/etd-04072009-222336/.

Council of Science Editors:

author] [. Optimisation techniques for combustor design . [Doctoral Dissertation]. University of Pretoria; 2009. Available from: http://upetd.up.ac.za/thesis/available/etd-04072009-222336/

Mississippi State University

28. Quddus, Md Abdul. Models and algorithms to solve electric vehicle charging stations designing and managing problem under uncertainty.

Degree: PhD, Industrial and Systems Engineering, 2018, Mississippi State University

URL: http://sun.library.msstate.edu/ETD-db/theses/available/etd-10032018-135623/ ;

► This dissertation studies a framework in support electric vehicle (EV) charging station expansion and management decisions. In the ﬁrst part of the dissertation, we present…
(more)

Subjects/Keywords: charging stations; electric vehicles; Vehicle-to-grid; renewable energy; constraint- generation algorithm; sample average approximation; scenario decomposition algorithm; rolling horizon heuristics

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Quddus, M. A. (2018). Models and algorithms to solve electric vehicle charging stations designing and managing problem under uncertainty. (Doctoral Dissertation). Mississippi State University. Retrieved from http://sun.library.msstate.edu/ETD-db/theses/available/etd-10032018-135623/ ;

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

Quddus, Md Abdul. “Models and algorithms to solve electric vehicle charging stations designing and managing problem under uncertainty.” 2018. Doctoral Dissertation, Mississippi State University. Accessed December 13, 2019. http://sun.library.msstate.edu/ETD-db/theses/available/etd-10032018-135623/ ;.

MLA Handbook (7^{th} Edition):

Quddus, Md Abdul. “Models and algorithms to solve electric vehicle charging stations designing and managing problem under uncertainty.” 2018. Web. 13 Dec 2019.

Vancouver:

Quddus MA. Models and algorithms to solve electric vehicle charging stations designing and managing problem under uncertainty. [Internet] [Doctoral dissertation]. Mississippi State University; 2018. [cited 2019 Dec 13]. Available from: http://sun.library.msstate.edu/ETD-db/theses/available/etd-10032018-135623/ ;.

Council of Science Editors:

Quddus MA. Models and algorithms to solve electric vehicle charging stations designing and managing problem under uncertainty. [Doctoral Dissertation]. Mississippi State University; 2018. Available from: http://sun.library.msstate.edu/ETD-db/theses/available/etd-10032018-135623/ ;

29.
Laekhanukit, Bundit.
* Approximation* Algorithms for (S,T)-Connectivity Problems.

Degree: 2010, University of Waterloo

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

► We study a directed network design problem called the k-(S,T)-connectivity problem; we design and analyze *approximation* algorithms and give hardness results. For each positive integer…
(more)

Subjects/Keywords: algorithm; approximation algorithm; connectivity; directed graph

…2.5
The illustration of the working of our 2-*approximation* *algorithm* for the standard
(… …2.6
The illustration of the working of our *approximation* *algorithm* for the relaxed
(S… …*approximation* *algorithm* for the edge-connectivity
problem in both directed and undirected graphs. The… …O(log k)-*approximation* *algorithm* was
claimed by Ravi and Williamson [66, 67… …*algorithm* with an *approximation* guarantee of O(log k) for the special case where n < 6k…

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Laekhanukit, B. (2010). Approximation Algorithms for (S,T)-Connectivity Problems. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/5321

Not specified: Masters Thesis or Doctoral Dissertation

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

Laekhanukit, Bundit. “Approximation Algorithms for (S,T)-Connectivity Problems.” 2010. Thesis, University of Waterloo. Accessed December 13, 2019. http://hdl.handle.net/10012/5321.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Laekhanukit, Bundit. “Approximation Algorithms for (S,T)-Connectivity Problems.” 2010. Web. 13 Dec 2019.

Vancouver:

Laekhanukit B. Approximation Algorithms for (S,T)-Connectivity Problems. [Internet] [Thesis]. University of Waterloo; 2010. [cited 2019 Dec 13]. Available from: http://hdl.handle.net/10012/5321.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Laekhanukit B. Approximation Algorithms for (S,T)-Connectivity Problems. [Thesis]. University of Waterloo; 2010. Available from: http://hdl.handle.net/10012/5321

Not specified: Masters Thesis or Doctoral Dissertation

30.
Dutta, Himanshu Shekhar.
Survey of *Approximation* Algorithms for Set Cover Problem.

Degree: 2009, University of North Texas

URL: https://digital.library.unt.edu/ark:/67531/metadc12118/

► In this thesis, I survey 11 *approximation* algorithms for unweighted set cover problem. I have also implemented the three algorithms and created a software library…
(more)

Subjects/Keywords: Set cover; approximation algorithm; greedy algorithm; Approximation algorithms.; Set theory.

…optimal solution in polynomial time [3,4,5,6].
*Approximation* *algorithm* is an *algorithm*… …Greedy *Algorithm* for Set Cover [8]
Greedy *approximation* of SC was originally… …too,
form the hitting set of cardinality 2.
2.3 f-*Approximation* Greedy *Algorithm* for Set… …Cover [16]
f-*approximation* greedy *algorithm* provides a solution which is bounded by… …j : ui
i
S j }| .
2.3.1 Greedy *Algorithm* for f-*Approximation* [16]…

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Dutta, H. S. (2009). Survey of Approximation Algorithms for Set Cover Problem. (Thesis). University of North Texas. Retrieved from https://digital.library.unt.edu/ark:/67531/metadc12118/

Not specified: Masters Thesis or Doctoral Dissertation

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

Dutta, Himanshu Shekhar. “Survey of Approximation Algorithms for Set Cover Problem.” 2009. Thesis, University of North Texas. Accessed December 13, 2019. https://digital.library.unt.edu/ark:/67531/metadc12118/.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Dutta, Himanshu Shekhar. “Survey of Approximation Algorithms for Set Cover Problem.” 2009. Web. 13 Dec 2019.

Vancouver:

Dutta HS. Survey of Approximation Algorithms for Set Cover Problem. [Internet] [Thesis]. University of North Texas; 2009. [cited 2019 Dec 13]. Available from: https://digital.library.unt.edu/ark:/67531/metadc12118/.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Dutta HS. Survey of Approximation Algorithms for Set Cover Problem. [Thesis]. University of North Texas; 2009. Available from: https://digital.library.unt.edu/ark:/67531/metadc12118/

Not specified: Masters Thesis or Doctoral Dissertation