Advanced search options

Advanced Search Options 🞨

Browse by author name (“Author name starts with…”).

Find ETDs with:

in
/  
in
/  
in
/  
in

Written in Published in Earliest date Latest date

Sorted by

Results per page:

Sorted by: relevance · author · university · dateNew search

You searched for subject:(Dynamic Programming). Showing records 1 – 30 of 919 total matches.

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

Search Limiters

Last 2 Years | English Only

Degrees

Levels

Languages

Country

▼ Search Limiters


Texas A&M University

1. Park, Myoungkuk. Performance Guarantee of a Sub-Optimal Policy for a Discrete Markov Decision Process and Its Application to a Robotic Surveillance Problem.

Degree: 2014, Texas A&M University

 This dissertation deals with the development and analysis of sub-optimal decision algorithms for a collection of robots that assist a remotely located operator in perimeter… (more)

Subjects/Keywords: Approximate Dynamic programming; Linear programming; patrol problem

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Park, M. (2014). Performance Guarantee of a Sub-Optimal Policy for a Discrete Markov Decision Process and Its Application to a Robotic Surveillance Problem. (Thesis). Texas A&M University. Retrieved from http://hdl.handle.net/1969.1/152659

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

Park, Myoungkuk. “Performance Guarantee of a Sub-Optimal Policy for a Discrete Markov Decision Process and Its Application to a Robotic Surveillance Problem.” 2014. Thesis, Texas A&M University. Accessed February 26, 2020. http://hdl.handle.net/1969.1/152659.

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

MLA Handbook (7th Edition):

Park, Myoungkuk. “Performance Guarantee of a Sub-Optimal Policy for a Discrete Markov Decision Process and Its Application to a Robotic Surveillance Problem.” 2014. Web. 26 Feb 2020.

Vancouver:

Park M. Performance Guarantee of a Sub-Optimal Policy for a Discrete Markov Decision Process and Its Application to a Robotic Surveillance Problem. [Internet] [Thesis]. Texas A&M University; 2014. [cited 2020 Feb 26]. Available from: http://hdl.handle.net/1969.1/152659.

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

Council of Science Editors:

Park M. Performance Guarantee of a Sub-Optimal Policy for a Discrete Markov Decision Process and Its Application to a Robotic Surveillance Problem. [Thesis]. Texas A&M University; 2014. Available from: http://hdl.handle.net/1969.1/152659

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


Dalhousie University

2. Comeau, Jules. A STOCHASTIC DYNAMIC PROGRAMMING APPROACH FOR OPTIMIZING MIXED-SPECIES FOREST STAND MANAGEMENT POLICIES.

Degree: PhD, Department of Industrial Engineering, 2011, Dalhousie University

 The main goal is to develop decision policies for individual forest stand management. It addresses three major areas of interest in the optimal management of… (more)

Subjects/Keywords: Dynamic Programming; Forestry; Stochastic

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Comeau, J. (2011). A STOCHASTIC DYNAMIC PROGRAMMING APPROACH FOR OPTIMIZING MIXED-SPECIES FOREST STAND MANAGEMENT POLICIES. (Doctoral Dissertation). Dalhousie University. Retrieved from http://hdl.handle.net/10222/13309

Chicago Manual of Style (16th Edition):

Comeau, Jules. “A STOCHASTIC DYNAMIC PROGRAMMING APPROACH FOR OPTIMIZING MIXED-SPECIES FOREST STAND MANAGEMENT POLICIES.” 2011. Doctoral Dissertation, Dalhousie University. Accessed February 26, 2020. http://hdl.handle.net/10222/13309.

MLA Handbook (7th Edition):

Comeau, Jules. “A STOCHASTIC DYNAMIC PROGRAMMING APPROACH FOR OPTIMIZING MIXED-SPECIES FOREST STAND MANAGEMENT POLICIES.” 2011. Web. 26 Feb 2020.

Vancouver:

Comeau J. A STOCHASTIC DYNAMIC PROGRAMMING APPROACH FOR OPTIMIZING MIXED-SPECIES FOREST STAND MANAGEMENT POLICIES. [Internet] [Doctoral dissertation]. Dalhousie University; 2011. [cited 2020 Feb 26]. Available from: http://hdl.handle.net/10222/13309.

Council of Science Editors:

Comeau J. A STOCHASTIC DYNAMIC PROGRAMMING APPROACH FOR OPTIMIZING MIXED-SPECIES FOREST STAND MANAGEMENT POLICIES. [Doctoral Dissertation]. Dalhousie University; 2011. Available from: http://hdl.handle.net/10222/13309


University of Hong Kong

3. Chen, Yong. Estimation and synthesis of reachable set for discrete systems with switching characteristics.

Degree: PhD, 2016, University of Hong Kong

This thesis is concerned with the problems of reachable set estimation and synthesis for a class of dynamic systems with switching characteristics. In terms of… (more)

Subjects/Keywords: Control theory; Dynamic programming

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Chen, Y. (2016). Estimation and synthesis of reachable set for discrete systems with switching characteristics. (Doctoral Dissertation). University of Hong Kong. Retrieved from http://hdl.handle.net/10722/227943

Chicago Manual of Style (16th Edition):

Chen, Yong. “Estimation and synthesis of reachable set for discrete systems with switching characteristics.” 2016. Doctoral Dissertation, University of Hong Kong. Accessed February 26, 2020. http://hdl.handle.net/10722/227943.

MLA Handbook (7th Edition):

Chen, Yong. “Estimation and synthesis of reachable set for discrete systems with switching characteristics.” 2016. Web. 26 Feb 2020.

Vancouver:

Chen Y. Estimation and synthesis of reachable set for discrete systems with switching characteristics. [Internet] [Doctoral dissertation]. University of Hong Kong; 2016. [cited 2020 Feb 26]. Available from: http://hdl.handle.net/10722/227943.

Council of Science Editors:

Chen Y. Estimation and synthesis of reachable set for discrete systems with switching characteristics. [Doctoral Dissertation]. University of Hong Kong; 2016. Available from: http://hdl.handle.net/10722/227943


University of Illinois – Urbana-Champaign

4. Yu, Yingjie. A thesis on algorithmic trading.

Degree: MS, Industrial Engineering, 2015, University of Illinois – Urbana-Champaign

 Algorithmic trading is one of the most phenomenal changes in the financial industry in the past decade. While the impacts are significant, the microstructure of… (more)

Subjects/Keywords: Algorithmic trading; Dynamic programming

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Yu, Y. (2015). A thesis on algorithmic trading. (Thesis). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/78679

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

Yu, Yingjie. “A thesis on algorithmic trading.” 2015. Thesis, University of Illinois – Urbana-Champaign. Accessed February 26, 2020. http://hdl.handle.net/2142/78679.

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

MLA Handbook (7th Edition):

Yu, Yingjie. “A thesis on algorithmic trading.” 2015. Web. 26 Feb 2020.

Vancouver:

Yu Y. A thesis on algorithmic trading. [Internet] [Thesis]. University of Illinois – Urbana-Champaign; 2015. [cited 2020 Feb 26]. Available from: http://hdl.handle.net/2142/78679.

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

Council of Science Editors:

Yu Y. A thesis on algorithmic trading. [Thesis]. University of Illinois – Urbana-Champaign; 2015. Available from: http://hdl.handle.net/2142/78679

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


Penn State University

5. Zhou, Xiaolu. Industrial Organization of Online Marketplaces.

Degree: 2017, Penn State University

 The first chapter quantifies the efficiency gains of the rebate contract employed by a dominant e-commerce platform in China. On the platform, sellers receive a… (more)

Subjects/Keywords: Reputation; Contracts; Ecommerce; Dynamic Programming

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Zhou, X. (2017). Industrial Organization of Online Marketplaces. (Thesis). Penn State University. Retrieved from https://etda.libraries.psu.edu/catalog/14308xzz109

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

Zhou, Xiaolu. “Industrial Organization of Online Marketplaces.” 2017. Thesis, Penn State University. Accessed February 26, 2020. https://etda.libraries.psu.edu/catalog/14308xzz109.

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

MLA Handbook (7th Edition):

Zhou, Xiaolu. “Industrial Organization of Online Marketplaces.” 2017. Web. 26 Feb 2020.

Vancouver:

Zhou X. Industrial Organization of Online Marketplaces. [Internet] [Thesis]. Penn State University; 2017. [cited 2020 Feb 26]. Available from: https://etda.libraries.psu.edu/catalog/14308xzz109.

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

Council of Science Editors:

Zhou X. Industrial Organization of Online Marketplaces. [Thesis]. Penn State University; 2017. Available from: https://etda.libraries.psu.edu/catalog/14308xzz109

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


NSYSU

6. Dai, Hong-kwang. The cost minimization of steel material profolio using dynamic programming.

Degree: Master, Information Management, 2009, NSYSU

 In ordert to increasing the capacity of stocking and integration in the process of optimizing the internal cost in steel industry. The cost of material… (more)

Subjects/Keywords: material profolio; dynamic programming; scheduling

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Dai, H. (2009). The cost minimization of steel material profolio using dynamic programming. (Thesis). NSYSU. Retrieved from http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0818109-155333

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

Dai, Hong-kwang. “The cost minimization of steel material profolio using dynamic programming.” 2009. Thesis, NSYSU. Accessed February 26, 2020. http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0818109-155333.

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

MLA Handbook (7th Edition):

Dai, Hong-kwang. “The cost minimization of steel material profolio using dynamic programming.” 2009. Web. 26 Feb 2020.

Vancouver:

Dai H. The cost minimization of steel material profolio using dynamic programming. [Internet] [Thesis]. NSYSU; 2009. [cited 2020 Feb 26]. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0818109-155333.

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

Council of Science Editors:

Dai H. The cost minimization of steel material profolio using dynamic programming. [Thesis]. NSYSU; 2009. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0818109-155333

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


University of Southern California

7. Chen, Kai. Variants of stochastic knapsack problems.

Degree: PhD, Industrial and Systems Engineering, 2013, University of Southern California

 We consider variants of stochastic knapsack problems with different problem settings, on-line vs off-line, and with different assumptions on the objective functions. We try to… (more)

Subjects/Keywords: stochastic; knapsack; dynamic programming

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Chen, K. (2013). Variants of stochastic knapsack problems. (Doctoral Dissertation). University of Southern California. Retrieved from http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll3/id/347957/rec/7801

Chicago Manual of Style (16th Edition):

Chen, Kai. “Variants of stochastic knapsack problems.” 2013. Doctoral Dissertation, University of Southern California. Accessed February 26, 2020. http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll3/id/347957/rec/7801.

MLA Handbook (7th Edition):

Chen, Kai. “Variants of stochastic knapsack problems.” 2013. Web. 26 Feb 2020.

Vancouver:

Chen K. Variants of stochastic knapsack problems. [Internet] [Doctoral dissertation]. University of Southern California; 2013. [cited 2020 Feb 26]. Available from: http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll3/id/347957/rec/7801.

Council of Science Editors:

Chen K. Variants of stochastic knapsack problems. [Doctoral Dissertation]. University of Southern California; 2013. Available from: http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll3/id/347957/rec/7801


Cornell University

8. Ding, Chao. Multi-Dimensional Problems In Single-Resource Revenue Management .

Degree: 2012, Cornell University

 This dissertation addresses three multi-dimensional problems in single-resource revenue management. Many problems in revenue management involve managing a single resource but their dynamic programming formulation… (more)

Subjects/Keywords: revenue management; dynamic programming

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Ding, C. (2012). Multi-Dimensional Problems In Single-Resource Revenue Management . (Thesis). Cornell University. Retrieved from http://hdl.handle.net/1813/30990

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

Ding, Chao. “Multi-Dimensional Problems In Single-Resource Revenue Management .” 2012. Thesis, Cornell University. Accessed February 26, 2020. http://hdl.handle.net/1813/30990.

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

MLA Handbook (7th Edition):

Ding, Chao. “Multi-Dimensional Problems In Single-Resource Revenue Management .” 2012. Web. 26 Feb 2020.

Vancouver:

Ding C. Multi-Dimensional Problems In Single-Resource Revenue Management . [Internet] [Thesis]. Cornell University; 2012. [cited 2020 Feb 26]. Available from: http://hdl.handle.net/1813/30990.

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

Council of Science Editors:

Ding C. Multi-Dimensional Problems In Single-Resource Revenue Management . [Thesis]. Cornell University; 2012. Available from: http://hdl.handle.net/1813/30990

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


University of Texas – Austin

9. Fayvisovich, Roman. Martingale-generated control structures and a framework for the dynamic programming principle.

Degree: PhD, Mathematics, 2017, University of Texas – Austin

 This thesis constructs an abstract framework in which the dynamic programming principle (DPP) can be proven for a broad range of stochastic control problems. Using… (more)

Subjects/Keywords: Stochastic control; Dynamic programming

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Fayvisovich, R. (2017). Martingale-generated control structures and a framework for the dynamic programming principle. (Doctoral Dissertation). University of Texas – Austin. Retrieved from http://hdl.handle.net/2152/62105

Chicago Manual of Style (16th Edition):

Fayvisovich, Roman. “Martingale-generated control structures and a framework for the dynamic programming principle.” 2017. Doctoral Dissertation, University of Texas – Austin. Accessed February 26, 2020. http://hdl.handle.net/2152/62105.

MLA Handbook (7th Edition):

Fayvisovich, Roman. “Martingale-generated control structures and a framework for the dynamic programming principle.” 2017. Web. 26 Feb 2020.

Vancouver:

Fayvisovich R. Martingale-generated control structures and a framework for the dynamic programming principle. [Internet] [Doctoral dissertation]. University of Texas – Austin; 2017. [cited 2020 Feb 26]. Available from: http://hdl.handle.net/2152/62105.

Council of Science Editors:

Fayvisovich R. Martingale-generated control structures and a framework for the dynamic programming principle. [Doctoral Dissertation]. University of Texas – Austin; 2017. Available from: http://hdl.handle.net/2152/62105


Hong Kong University of Science and Technology

10. Zhang, Yan. Dynamic programming speedups.

Degree: 2007, Hong Kong University of Science and Technology

Dynamic programming is a standard technique used in optimization. It is well known that if a dynamic program possesses what is known as a 'Monge… (more)

Subjects/Keywords: Dynamic programming

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Zhang, Y. (2007). Dynamic programming speedups. (Thesis). Hong Kong University of Science and Technology. Retrieved from http://repository.ust.hk/ir/Record/1783.1-3082 ; https://doi.org/10.14711/thesis-b987544 ; http://repository.ust.hk/ir/bitstream/1783.1-3082/1/th_redirect.html

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

Zhang, Yan. “Dynamic programming speedups.” 2007. Thesis, Hong Kong University of Science and Technology. Accessed February 26, 2020. http://repository.ust.hk/ir/Record/1783.1-3082 ; https://doi.org/10.14711/thesis-b987544 ; http://repository.ust.hk/ir/bitstream/1783.1-3082/1/th_redirect.html.

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

MLA Handbook (7th Edition):

Zhang, Yan. “Dynamic programming speedups.” 2007. Web. 26 Feb 2020.

Vancouver:

Zhang Y. Dynamic programming speedups. [Internet] [Thesis]. Hong Kong University of Science and Technology; 2007. [cited 2020 Feb 26]. Available from: http://repository.ust.hk/ir/Record/1783.1-3082 ; https://doi.org/10.14711/thesis-b987544 ; http://repository.ust.hk/ir/bitstream/1783.1-3082/1/th_redirect.html.

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

Council of Science Editors:

Zhang Y. Dynamic programming speedups. [Thesis]. Hong Kong University of Science and Technology; 2007. Available from: http://repository.ust.hk/ir/Record/1783.1-3082 ; https://doi.org/10.14711/thesis-b987544 ; http://repository.ust.hk/ir/bitstream/1783.1-3082/1/th_redirect.html

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


Penn State University

11. Guo, Yuecheng. Unit Commitment with Electrochemical Storage: an Investigation of Dynamic Programming Schemes.

Degree: MS, Industrial Engineering, 2015, Penn State University

 This thesis considers the solution of a unit commitment problem with electrochemical storage, a consequence of using lithium-ion batteries. Traditional approaches of mixed-integer linear programming(more)

Subjects/Keywords: Unit Commitment; Electrochemical Storage; Dynamic Programming; Approximate Dynamic Programming

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Guo, Y. (2015). Unit Commitment with Electrochemical Storage: an Investigation of Dynamic Programming Schemes. (Masters Thesis). Penn State University. Retrieved from https://etda.libraries.psu.edu/catalog/26597

Chicago Manual of Style (16th Edition):

Guo, Yuecheng. “Unit Commitment with Electrochemical Storage: an Investigation of Dynamic Programming Schemes.” 2015. Masters Thesis, Penn State University. Accessed February 26, 2020. https://etda.libraries.psu.edu/catalog/26597.

MLA Handbook (7th Edition):

Guo, Yuecheng. “Unit Commitment with Electrochemical Storage: an Investigation of Dynamic Programming Schemes.” 2015. Web. 26 Feb 2020.

Vancouver:

Guo Y. Unit Commitment with Electrochemical Storage: an Investigation of Dynamic Programming Schemes. [Internet] [Masters thesis]. Penn State University; 2015. [cited 2020 Feb 26]. Available from: https://etda.libraries.psu.edu/catalog/26597.

Council of Science Editors:

Guo Y. Unit Commitment with Electrochemical Storage: an Investigation of Dynamic Programming Schemes. [Masters Thesis]. Penn State University; 2015. Available from: https://etda.libraries.psu.edu/catalog/26597


Georgia Tech

12. Angulo Olivares, Gustavo, I. Integer programming approaches for semicontinuous and stochastic optimization.

Degree: PhD, Industrial and Systems Engineering, 2014, Georgia Tech

 This thesis concerns the application of mixed-integer programming techniques to solve special classes of network flow problems and stochastic integer programs. We draw tools from… (more)

Subjects/Keywords: Integer programming; Stochastic programming; Forbidden vertices; Mathematical optimization; Dynamic programming; Integer programming

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Angulo Olivares, Gustavo, I. (2014). Integer programming approaches for semicontinuous and stochastic optimization. (Doctoral Dissertation). Georgia Tech. Retrieved from http://hdl.handle.net/1853/51862

Chicago Manual of Style (16th Edition):

Angulo Olivares, Gustavo, I. “Integer programming approaches for semicontinuous and stochastic optimization.” 2014. Doctoral Dissertation, Georgia Tech. Accessed February 26, 2020. http://hdl.handle.net/1853/51862.

MLA Handbook (7th Edition):

Angulo Olivares, Gustavo, I. “Integer programming approaches for semicontinuous and stochastic optimization.” 2014. Web. 26 Feb 2020.

Vancouver:

Angulo Olivares, Gustavo I. Integer programming approaches for semicontinuous and stochastic optimization. [Internet] [Doctoral dissertation]. Georgia Tech; 2014. [cited 2020 Feb 26]. Available from: http://hdl.handle.net/1853/51862.

Council of Science Editors:

Angulo Olivares, Gustavo I. Integer programming approaches for semicontinuous and stochastic optimization. [Doctoral Dissertation]. Georgia Tech; 2014. Available from: http://hdl.handle.net/1853/51862


University of Alberta

13. Arefi, Afshin. On the Optimal Set of Channels to Sense in Cognitive Radio Networks.

Degree: MS, Department of Electrical and Computer Engineering, 2015, University of Alberta

 We study a channel selection problem in cognitive radio with imperfect spectrum sensing. In this problem, a secondary (unlicensed) user must select a subset of… (more)

Subjects/Keywords: Cognitive Radio Networks; Imperfect Sensing; Dynamic Programming

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Arefi, A. (2015). On the Optimal Set of Channels to Sense in Cognitive Radio Networks. (Masters Thesis). University of Alberta. Retrieved from https://era.library.ualberta.ca/files/td96k5371

Chicago Manual of Style (16th Edition):

Arefi, Afshin. “On the Optimal Set of Channels to Sense in Cognitive Radio Networks.” 2015. Masters Thesis, University of Alberta. Accessed February 26, 2020. https://era.library.ualberta.ca/files/td96k5371.

MLA Handbook (7th Edition):

Arefi, Afshin. “On the Optimal Set of Channels to Sense in Cognitive Radio Networks.” 2015. Web. 26 Feb 2020.

Vancouver:

Arefi A. On the Optimal Set of Channels to Sense in Cognitive Radio Networks. [Internet] [Masters thesis]. University of Alberta; 2015. [cited 2020 Feb 26]. Available from: https://era.library.ualberta.ca/files/td96k5371.

Council of Science Editors:

Arefi A. On the Optimal Set of Channels to Sense in Cognitive Radio Networks. [Masters Thesis]. University of Alberta; 2015. Available from: https://era.library.ualberta.ca/files/td96k5371


University of Alberta

14. Zeng, Linghang. Trading Large VWAP Orders in Discrete Time.

Degree: MS, Department of Mathematical and Statistical Sciences, 2013, University of Alberta

 This thesis focuses on characterizing an optimal trading strategy for a large trader, who has to buy (or sell) a fixed large volume over a… (more)

Subjects/Keywords: algorithmic trading, VWAP, discrete time, dynamic programming

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Zeng, L. (2013). Trading Large VWAP Orders in Discrete Time. (Masters Thesis). University of Alberta. Retrieved from https://era.library.ualberta.ca/files/12579t58k

Chicago Manual of Style (16th Edition):

Zeng, Linghang. “Trading Large VWAP Orders in Discrete Time.” 2013. Masters Thesis, University of Alberta. Accessed February 26, 2020. https://era.library.ualberta.ca/files/12579t58k.

MLA Handbook (7th Edition):

Zeng, Linghang. “Trading Large VWAP Orders in Discrete Time.” 2013. Web. 26 Feb 2020.

Vancouver:

Zeng L. Trading Large VWAP Orders in Discrete Time. [Internet] [Masters thesis]. University of Alberta; 2013. [cited 2020 Feb 26]. Available from: https://era.library.ualberta.ca/files/12579t58k.

Council of Science Editors:

Zeng L. Trading Large VWAP Orders in Discrete Time. [Masters Thesis]. University of Alberta; 2013. Available from: https://era.library.ualberta.ca/files/12579t58k


University of Alberta

15. Karimipour, Hadis. Parallel Dynamic State Estimation of Large-scale Cyber-physical Power Systems.

Degree: PhD, Department of Electrical and Computer Engineering, 2016, University of Alberta

 Growing system size and complexity along with the large amount of data provided by phasor measurement units (PMUs) are the drivers for accurate state estimation… (more)

Subjects/Keywords: Parallel Programming; GPU; Dynamic State Estimation

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Karimipour, H. (2016). Parallel Dynamic State Estimation of Large-scale Cyber-physical Power Systems. (Doctoral Dissertation). University of Alberta. Retrieved from https://era.library.ualberta.ca/files/crv042t14w

Chicago Manual of Style (16th Edition):

Karimipour, Hadis. “Parallel Dynamic State Estimation of Large-scale Cyber-physical Power Systems.” 2016. Doctoral Dissertation, University of Alberta. Accessed February 26, 2020. https://era.library.ualberta.ca/files/crv042t14w.

MLA Handbook (7th Edition):

Karimipour, Hadis. “Parallel Dynamic State Estimation of Large-scale Cyber-physical Power Systems.” 2016. Web. 26 Feb 2020.

Vancouver:

Karimipour H. Parallel Dynamic State Estimation of Large-scale Cyber-physical Power Systems. [Internet] [Doctoral dissertation]. University of Alberta; 2016. [cited 2020 Feb 26]. Available from: https://era.library.ualberta.ca/files/crv042t14w.

Council of Science Editors:

Karimipour H. Parallel Dynamic State Estimation of Large-scale Cyber-physical Power Systems. [Doctoral Dissertation]. University of Alberta; 2016. Available from: https://era.library.ualberta.ca/files/crv042t14w


Texas A&M University

16. Walton, Zachary. Optimal Control of Perimeter Patrol Using Reinforcement Learning.

Degree: 2011, Texas A&M University

 Unmanned Aerial Vehicles (UAVs) are being used more frequently in surveillance scenarios for both civilian and military applications. One such application addresses a UAV patrolling… (more)

Subjects/Keywords: Unmanned Aerial Vehicles; Dynamic Programming; Reinforcement Learning

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Walton, Z. (2011). Optimal Control of Perimeter Patrol Using Reinforcement Learning. (Thesis). Texas A&M University. Retrieved from http://hdl.handle.net/1969.1/ETD-TAMU-2011-05-9520

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

Walton, Zachary. “Optimal Control of Perimeter Patrol Using Reinforcement Learning.” 2011. Thesis, Texas A&M University. Accessed February 26, 2020. http://hdl.handle.net/1969.1/ETD-TAMU-2011-05-9520.

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

MLA Handbook (7th Edition):

Walton, Zachary. “Optimal Control of Perimeter Patrol Using Reinforcement Learning.” 2011. Web. 26 Feb 2020.

Vancouver:

Walton Z. Optimal Control of Perimeter Patrol Using Reinforcement Learning. [Internet] [Thesis]. Texas A&M University; 2011. [cited 2020 Feb 26]. Available from: http://hdl.handle.net/1969.1/ETD-TAMU-2011-05-9520.

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

Council of Science Editors:

Walton Z. Optimal Control of Perimeter Patrol Using Reinforcement Learning. [Thesis]. Texas A&M University; 2011. Available from: http://hdl.handle.net/1969.1/ETD-TAMU-2011-05-9520

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


Texas A&M University

17. Lai, Lin. A Development of Design and Control Methodology for Next Generation Parallel Hybrid Electric Vehicle.

Degree: 2013, Texas A&M University

 Commercially available Hybrid Electric Vehicles (HEVs) have been around for more than ten years. However, their market share remains small. Focusing only on the improvement… (more)

Subjects/Keywords: Control strategy; Dynamic programming; Hybrid electric vehicle

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Lai, L. (2013). A Development of Design and Control Methodology for Next Generation Parallel Hybrid Electric Vehicle. (Thesis). Texas A&M University. Retrieved from http://hdl.handle.net/1969.1/149289

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

Lai, Lin. “A Development of Design and Control Methodology for Next Generation Parallel Hybrid Electric Vehicle.” 2013. Thesis, Texas A&M University. Accessed February 26, 2020. http://hdl.handle.net/1969.1/149289.

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

MLA Handbook (7th Edition):

Lai, Lin. “A Development of Design and Control Methodology for Next Generation Parallel Hybrid Electric Vehicle.” 2013. Web. 26 Feb 2020.

Vancouver:

Lai L. A Development of Design and Control Methodology for Next Generation Parallel Hybrid Electric Vehicle. [Internet] [Thesis]. Texas A&M University; 2013. [cited 2020 Feb 26]. Available from: http://hdl.handle.net/1969.1/149289.

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

Council of Science Editors:

Lai L. A Development of Design and Control Methodology for Next Generation Parallel Hybrid Electric Vehicle. [Thesis]. Texas A&M University; 2013. Available from: http://hdl.handle.net/1969.1/149289

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


Texas A&M University

18. Zhang, Liqing. Stochastic Dynamic Demand Inventory Models with Explicit Transportation Costs and Decisions.

Degree: 2011, Texas A&M University

 Recent supply chain literature and practice recognize that significant cost savings can be achieved by coordinating inventory and transportation decisions. Although the existing literature on… (more)

Subjects/Keywords: Stochastic dynamic programming; Shipment consolidation; Inventory/production

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Zhang, L. (2011). Stochastic Dynamic Demand Inventory Models with Explicit Transportation Costs and Decisions. (Thesis). Texas A&M University. Retrieved from http://hdl.handle.net/1969.1/150943

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

Zhang, Liqing. “Stochastic Dynamic Demand Inventory Models with Explicit Transportation Costs and Decisions.” 2011. Thesis, Texas A&M University. Accessed February 26, 2020. http://hdl.handle.net/1969.1/150943.

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

MLA Handbook (7th Edition):

Zhang, Liqing. “Stochastic Dynamic Demand Inventory Models with Explicit Transportation Costs and Decisions.” 2011. Web. 26 Feb 2020.

Vancouver:

Zhang L. Stochastic Dynamic Demand Inventory Models with Explicit Transportation Costs and Decisions. [Internet] [Thesis]. Texas A&M University; 2011. [cited 2020 Feb 26]. Available from: http://hdl.handle.net/1969.1/150943.

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

Council of Science Editors:

Zhang L. Stochastic Dynamic Demand Inventory Models with Explicit Transportation Costs and Decisions. [Thesis]. Texas A&M University; 2011. Available from: http://hdl.handle.net/1969.1/150943

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


University of Louisville

19. Muezzinoglu, Mehmet K. Approximate dynamic programming for anemia management.

Degree: PhD, 2006, University of Louisville

 The focus of this dissertation work is the formulation and improvement of anemia management process involving trial-and-error. A two-stage method is adopted toward this objective.… (more)

Subjects/Keywords: Dynamic programming; Anemia

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Muezzinoglu, M. K. (2006). Approximate dynamic programming for anemia management. (Doctoral Dissertation). University of Louisville. Retrieved from 10.18297/etd/1024 ; https://ir.library.louisville.edu/etd/1024

Chicago Manual of Style (16th Edition):

Muezzinoglu, Mehmet K. “Approximate dynamic programming for anemia management.” 2006. Doctoral Dissertation, University of Louisville. Accessed February 26, 2020. 10.18297/etd/1024 ; https://ir.library.louisville.edu/etd/1024.

MLA Handbook (7th Edition):

Muezzinoglu, Mehmet K. “Approximate dynamic programming for anemia management.” 2006. Web. 26 Feb 2020.

Vancouver:

Muezzinoglu MK. Approximate dynamic programming for anemia management. [Internet] [Doctoral dissertation]. University of Louisville; 2006. [cited 2020 Feb 26]. Available from: 10.18297/etd/1024 ; https://ir.library.louisville.edu/etd/1024.

Council of Science Editors:

Muezzinoglu MK. Approximate dynamic programming for anemia management. [Doctoral Dissertation]. University of Louisville; 2006. Available from: 10.18297/etd/1024 ; https://ir.library.louisville.edu/etd/1024


Texas Tech University

20. Middleton, Marty. Uncertainty effects on Ogallala aquifer withdrawal: Is regulation needed?.

Degree: PhD, Agricultural and Applied Economics, 2018, Texas Tech University

 The regional and local economies of the Texas High Plains rely on economic activity resulting from irrigated crop production, variously conditioned by the local decline… (more)

Subjects/Keywords: Ogallala aquifer; groundwater policy; dynamic programming

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Middleton, M. (2018). Uncertainty effects on Ogallala aquifer withdrawal: Is regulation needed?. (Doctoral Dissertation). Texas Tech University. Retrieved from http://hdl.handle.net/2346/74397

Chicago Manual of Style (16th Edition):

Middleton, Marty. “Uncertainty effects on Ogallala aquifer withdrawal: Is regulation needed?.” 2018. Doctoral Dissertation, Texas Tech University. Accessed February 26, 2020. http://hdl.handle.net/2346/74397.

MLA Handbook (7th Edition):

Middleton, Marty. “Uncertainty effects on Ogallala aquifer withdrawal: Is regulation needed?.” 2018. Web. 26 Feb 2020.

Vancouver:

Middleton M. Uncertainty effects on Ogallala aquifer withdrawal: Is regulation needed?. [Internet] [Doctoral dissertation]. Texas Tech University; 2018. [cited 2020 Feb 26]. Available from: http://hdl.handle.net/2346/74397.

Council of Science Editors:

Middleton M. Uncertainty effects on Ogallala aquifer withdrawal: Is regulation needed?. [Doctoral Dissertation]. Texas Tech University; 2018. Available from: http://hdl.handle.net/2346/74397


University of Southern California

21. Maisch, Melissa. Optimal debt allocation using a dynamic programming approach.

Degree: PhD, Applied Mathematics, 2011, University of Southern California

 In this dissertation the optimal maturity structure of debt is determined. According to the 2007 Financial Report of the U.S. Government, the public debt is… (more)

Subjects/Keywords: debt management; dynamic programming; bond maturity structure

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Maisch, M. (2011). Optimal debt allocation using a dynamic programming approach. (Doctoral Dissertation). University of Southern California. Retrieved from http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll127/id/405175/rec/4592

Chicago Manual of Style (16th Edition):

Maisch, Melissa. “Optimal debt allocation using a dynamic programming approach.” 2011. Doctoral Dissertation, University of Southern California. Accessed February 26, 2020. http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll127/id/405175/rec/4592.

MLA Handbook (7th Edition):

Maisch, Melissa. “Optimal debt allocation using a dynamic programming approach.” 2011. Web. 26 Feb 2020.

Vancouver:

Maisch M. Optimal debt allocation using a dynamic programming approach. [Internet] [Doctoral dissertation]. University of Southern California; 2011. [cited 2020 Feb 26]. Available from: http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll127/id/405175/rec/4592.

Council of Science Editors:

Maisch M. Optimal debt allocation using a dynamic programming approach. [Doctoral Dissertation]. University of Southern California; 2011. Available from: http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll127/id/405175/rec/4592


University of Southern California

22. Lee, Yen-Ming. Bayesian optimal stopping problems with partial information.

Degree: PhD, Industrial & Systems Engineering, 2010, University of Southern California

 This dissertation focuses on an application of stochastic dynamic programming called the optimal stopping problem. The decision maker has to choose a time to take… (more)

Subjects/Keywords: dynamic programming; optimal stopping; Bayesian updating

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Lee, Y. (2010). Bayesian optimal stopping problems with partial information. (Doctoral Dissertation). University of Southern California. Retrieved from http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll127/id/411188/rec/1044

Chicago Manual of Style (16th Edition):

Lee, Yen-Ming. “Bayesian optimal stopping problems with partial information.” 2010. Doctoral Dissertation, University of Southern California. Accessed February 26, 2020. http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll127/id/411188/rec/1044.

MLA Handbook (7th Edition):

Lee, Yen-Ming. “Bayesian optimal stopping problems with partial information.” 2010. Web. 26 Feb 2020.

Vancouver:

Lee Y. Bayesian optimal stopping problems with partial information. [Internet] [Doctoral dissertation]. University of Southern California; 2010. [cited 2020 Feb 26]. Available from: http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll127/id/411188/rec/1044.

Council of Science Editors:

Lee Y. Bayesian optimal stopping problems with partial information. [Doctoral Dissertation]. University of Southern California; 2010. Available from: http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll127/id/411188/rec/1044


Addis Ababa University

23. Jalele, Geletu. Optimization of Hydropower Plant Expansion .

Degree: 2008, Addis Ababa University

 This research is of a sequencing expansion problem in which capacity can be added only at discrete points in time. There is a forecast of… (more)

Subjects/Keywords: Capacity expansion; dynamic programming; sensitivity analysis

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Jalele, G. (2008). Optimization of Hydropower Plant Expansion . (Thesis). Addis Ababa University. Retrieved from http://etd.aau.edu.et/dspace/handle/123456789/4246

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

Jalele, Geletu. “Optimization of Hydropower Plant Expansion .” 2008. Thesis, Addis Ababa University. Accessed February 26, 2020. http://etd.aau.edu.et/dspace/handle/123456789/4246.

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

MLA Handbook (7th Edition):

Jalele, Geletu. “Optimization of Hydropower Plant Expansion .” 2008. Web. 26 Feb 2020.

Vancouver:

Jalele G. Optimization of Hydropower Plant Expansion . [Internet] [Thesis]. Addis Ababa University; 2008. [cited 2020 Feb 26]. Available from: http://etd.aau.edu.et/dspace/handle/123456789/4246.

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

Council of Science Editors:

Jalele G. Optimization of Hydropower Plant Expansion . [Thesis]. Addis Ababa University; 2008. Available from: http://etd.aau.edu.et/dspace/handle/123456789/4246

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


University of Edinburgh

24. Yang, Xinan. Top-percentile traffic routing problem.

Degree: 2012, University of Edinburgh

 Multi-homing is a technology used by Internet Service Provider (ISP) to connect to the Internet via multiple networks. This connectivity enhances the network reliability and… (more)

Subjects/Keywords: 621.382; top-percentile; stochastic; approximate dynamic programming

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Yang, X. (2012). Top-percentile traffic routing problem. (Doctoral Dissertation). University of Edinburgh. Retrieved from http://hdl.handle.net/1842/5883

Chicago Manual of Style (16th Edition):

Yang, Xinan. “Top-percentile traffic routing problem.” 2012. Doctoral Dissertation, University of Edinburgh. Accessed February 26, 2020. http://hdl.handle.net/1842/5883.

MLA Handbook (7th Edition):

Yang, Xinan. “Top-percentile traffic routing problem.” 2012. Web. 26 Feb 2020.

Vancouver:

Yang X. Top-percentile traffic routing problem. [Internet] [Doctoral dissertation]. University of Edinburgh; 2012. [cited 2020 Feb 26]. Available from: http://hdl.handle.net/1842/5883.

Council of Science Editors:

Yang X. Top-percentile traffic routing problem. [Doctoral Dissertation]. University of Edinburgh; 2012. Available from: http://hdl.handle.net/1842/5883


The Ohio State University

25. Davidson, Erick. Market and professional decision-making under risk and uncertainty.

Degree: PhD, Agricultural, Environmental and Development Economics, 2007, The Ohio State University

 This dissertation explores decision making under risk and uncertainty by professionals and markets composed of professionals. Both essays use empirical data from some of the… (more)

Subjects/Keywords: Economics; Econometrics; Risk; Uncertainty; Dynamic Programming

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Davidson, E. (2007). Market and professional decision-making under risk and uncertainty. (Doctoral Dissertation). The Ohio State University. Retrieved from http://rave.ohiolink.edu/etdc/view?acc_num=osu1196261774

Chicago Manual of Style (16th Edition):

Davidson, Erick. “Market and professional decision-making under risk and uncertainty.” 2007. Doctoral Dissertation, The Ohio State University. Accessed February 26, 2020. http://rave.ohiolink.edu/etdc/view?acc_num=osu1196261774.

MLA Handbook (7th Edition):

Davidson, Erick. “Market and professional decision-making under risk and uncertainty.” 2007. Web. 26 Feb 2020.

Vancouver:

Davidson E. Market and professional decision-making under risk and uncertainty. [Internet] [Doctoral dissertation]. The Ohio State University; 2007. [cited 2020 Feb 26]. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=osu1196261774.

Council of Science Editors:

Davidson E. Market and professional decision-making under risk and uncertainty. [Doctoral Dissertation]. The Ohio State University; 2007. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=osu1196261774


NSYSU

26. Cheng, Kai-Yuan. The Longest Common Subsequence Problem with a Gapped Constraint.

Degree: Master, Computer Science and Engineering, 2012, NSYSU

 This thesis considers a variant of the classical problem for finding the longest common subsequence (LCS) called longest common subsequence problem with a gapped constraint… (more)

Subjects/Keywords: DP; Dynamic Programming; constraint; CLCS; LCS; Gap

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Cheng, K. (2012). The Longest Common Subsequence Problem with a Gapped Constraint. (Thesis). NSYSU. Retrieved from http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0912112-090312

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

Chicago Manual of Style (16th Edition):

Cheng, Kai-Yuan. “The Longest Common Subsequence Problem with a Gapped Constraint.” 2012. Thesis, NSYSU. Accessed February 26, 2020. http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0912112-090312.

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

MLA Handbook (7th Edition):

Cheng, Kai-Yuan. “The Longest Common Subsequence Problem with a Gapped Constraint.” 2012. Web. 26 Feb 2020.

Vancouver:

Cheng K. The Longest Common Subsequence Problem with a Gapped Constraint. [Internet] [Thesis]. NSYSU; 2012. [cited 2020 Feb 26]. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0912112-090312.

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

Council of Science Editors:

Cheng K. The Longest Common Subsequence Problem with a Gapped Constraint. [Thesis]. NSYSU; 2012. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0912112-090312

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


NSYSU

27. Ho, Wen-chuan. A Fast Algorithm for the Constrained Longest Common Subsequence Problem with Small Alphabet.

Degree: Master, Computer Science and Engineering, 2017, NSYSU

 Given three sequences A, B and C with lengths of m, n and r, respectively, the constrained longest common subsequence (CLCS) problem is to find… (more)

Subjects/Keywords: Small alphabet; Dynamic Programming; Similar; CLCS; LCS

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Ho, W. (2017). A Fast Algorithm for the Constrained Longest Common Subsequence Problem with Small Alphabet. (Thesis). NSYSU. Retrieved from http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0023117-160730

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

Ho, Wen-chuan. “A Fast Algorithm for the Constrained Longest Common Subsequence Problem with Small Alphabet.” 2017. Thesis, NSYSU. Accessed February 26, 2020. http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0023117-160730.

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

MLA Handbook (7th Edition):

Ho, Wen-chuan. “A Fast Algorithm for the Constrained Longest Common Subsequence Problem with Small Alphabet.” 2017. Web. 26 Feb 2020.

Vancouver:

Ho W. A Fast Algorithm for the Constrained Longest Common Subsequence Problem with Small Alphabet. [Internet] [Thesis]. NSYSU; 2017. [cited 2020 Feb 26]. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0023117-160730.

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

Council of Science Editors:

Ho W. A Fast Algorithm for the Constrained Longest Common Subsequence Problem with Small Alphabet. [Thesis]. NSYSU; 2017. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0023117-160730

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


Universiteit Utrecht

28. Graaff, L.W. van der. Dynamic programming on Nice Tree Decompositions.

Degree: 2015, Universiteit Utrecht

 Connectivity problems such as the Steiner Tree Problem are NP-hard problems that are fixed parameter tractable in the treewidth of the input graph. In this… (more)

Subjects/Keywords: treewidth; Steiner tree problem; dynamic programming

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Graaff, L. W. v. d. (2015). Dynamic programming on Nice Tree Decompositions. (Masters Thesis). Universiteit Utrecht. Retrieved from http://dspace.library.uu.nl:8080/handle/1874/309652

Chicago Manual of Style (16th Edition):

Graaff, L W van der. “Dynamic programming on Nice Tree Decompositions.” 2015. Masters Thesis, Universiteit Utrecht. Accessed February 26, 2020. http://dspace.library.uu.nl:8080/handle/1874/309652.

MLA Handbook (7th Edition):

Graaff, L W van der. “Dynamic programming on Nice Tree Decompositions.” 2015. Web. 26 Feb 2020.

Vancouver:

Graaff LWvd. Dynamic programming on Nice Tree Decompositions. [Internet] [Masters thesis]. Universiteit Utrecht; 2015. [cited 2020 Feb 26]. Available from: http://dspace.library.uu.nl:8080/handle/1874/309652.

Council of Science Editors:

Graaff LWvd. Dynamic programming on Nice Tree Decompositions. [Masters Thesis]. Universiteit Utrecht; 2015. Available from: http://dspace.library.uu.nl:8080/handle/1874/309652


Cornell University

29. Finseth, Ryan. Cost-Effective Recovery Of An Endangered Species: The Red-Cockaded Woodpecker .

Degree: 2012, Cornell University

 A model for the cost-effective recovery for an endangered species is developed and applied to the red-cockaded woodpecker (Picoides borealis), an endangered species once abundant… (more)

Subjects/Keywords: Endangered Species Recovery; Dynamic Programming; Adaptive Management

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Finseth, R. (2012). Cost-Effective Recovery Of An Endangered Species: The Red-Cockaded Woodpecker . (Thesis). Cornell University. Retrieved from http://hdl.handle.net/1813/29472

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

Finseth, Ryan. “Cost-Effective Recovery Of An Endangered Species: The Red-Cockaded Woodpecker .” 2012. Thesis, Cornell University. Accessed February 26, 2020. http://hdl.handle.net/1813/29472.

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

MLA Handbook (7th Edition):

Finseth, Ryan. “Cost-Effective Recovery Of An Endangered Species: The Red-Cockaded Woodpecker .” 2012. Web. 26 Feb 2020.

Vancouver:

Finseth R. Cost-Effective Recovery Of An Endangered Species: The Red-Cockaded Woodpecker . [Internet] [Thesis]. Cornell University; 2012. [cited 2020 Feb 26]. Available from: http://hdl.handle.net/1813/29472.

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

Council of Science Editors:

Finseth R. Cost-Effective Recovery Of An Endangered Species: The Red-Cockaded Woodpecker . [Thesis]. Cornell University; 2012. Available from: http://hdl.handle.net/1813/29472

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

30. Lamontagne, Jonathan. Representation Of Uncertainty And Corridor Dp For Hydropower Optimization .

Degree: 2015, Cornell University

 This thesis focuses on optimization techniques for multi-reservoir hydropower systems operation, with a particular concern with the representation and impact of uncertainty. The thesis reports… (more)

Subjects/Keywords: Dynamic Programming; Stochastic Optimization; Uncertainty Analysis

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Lamontagne, J. (2015). Representation Of Uncertainty And Corridor Dp For Hydropower Optimization . (Thesis). Cornell University. Retrieved from http://hdl.handle.net/1813/39482

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

Lamontagne, Jonathan. “Representation Of Uncertainty And Corridor Dp For Hydropower Optimization .” 2015. Thesis, Cornell University. Accessed February 26, 2020. http://hdl.handle.net/1813/39482.

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

MLA Handbook (7th Edition):

Lamontagne, Jonathan. “Representation Of Uncertainty And Corridor Dp For Hydropower Optimization .” 2015. Web. 26 Feb 2020.

Vancouver:

Lamontagne J. Representation Of Uncertainty And Corridor Dp For Hydropower Optimization . [Internet] [Thesis]. Cornell University; 2015. [cited 2020 Feb 26]. Available from: http://hdl.handle.net/1813/39482.

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

Council of Science Editors:

Lamontagne J. Representation Of Uncertainty And Corridor Dp For Hydropower Optimization . [Thesis]. Cornell University; 2015. Available from: http://hdl.handle.net/1813/39482

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

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

.