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 1125 total matches.

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

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: PhD, Mechanical Engineering, 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. (Doctoral Dissertation). Texas A&M University. Retrieved from http://hdl.handle.net/1969.1/152659

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. Doctoral Dissertation, Texas A&M University. Accessed April 18, 2021. http://hdl.handle.net/1969.1/152659.

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. 18 Apr 2021.

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] [Doctoral dissertation]. Texas A&M University; 2014. [cited 2021 Apr 18]. Available from: http://hdl.handle.net/1969.1/152659.

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. [Doctoral Dissertation]. Texas A&M University; 2014. Available from: http://hdl.handle.net/1969.1/152659


NSYSU

2. 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 April 18, 2021. 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. 18 Apr 2021.

Vancouver:

Dai H. The cost minimization of steel material profolio using dynamic programming. [Internet] [Thesis]. NSYSU; 2009. [cited 2021 Apr 18]. 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


Dalhousie University

3. 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 April 18, 2021. 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. 18 Apr 2021.

Vancouver:

Comeau J. A STOCHASTIC DYNAMIC PROGRAMMING APPROACH FOR OPTIMIZING MIXED-SPECIES FOREST STAND MANAGEMENT POLICIES. [Internet] [Doctoral dissertation]. Dalhousie University; 2011. [cited 2021 Apr 18]. 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


Cornell University

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

Degree: PhD, Operations Research, 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. (Doctoral Dissertation). Cornell University. Retrieved from http://hdl.handle.net/1813/30990

Chicago Manual of Style (16th Edition):

Ding, Chao. “Multi-Dimensional Problems In Single-Resource Revenue Management.” 2012. Doctoral Dissertation, Cornell University. Accessed April 18, 2021. http://hdl.handle.net/1813/30990.

MLA Handbook (7th Edition):

Ding, Chao. “Multi-Dimensional Problems In Single-Resource Revenue Management.” 2012. Web. 18 Apr 2021.

Vancouver:

Ding C. Multi-Dimensional Problems In Single-Resource Revenue Management. [Internet] [Doctoral dissertation]. Cornell University; 2012. [cited 2021 Apr 18]. Available from: http://hdl.handle.net/1813/30990.

Council of Science Editors:

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


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://submit-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 April 18, 2021. https://submit-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. 18 Apr 2021.

Vancouver:

Zhou X. Industrial Organization of Online Marketplaces. [Internet] [Thesis]. Penn State University; 2017. [cited 2021 Apr 18]. Available from: https://submit-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://submit-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


Hong Kong University of Science and Technology

6. 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 April 18, 2021. 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. 18 Apr 2021.

Vancouver:

Zhang Y. Dynamic programming speedups. [Internet] [Thesis]. Hong Kong University of Science and Technology; 2007. [cited 2021 Apr 18]. 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


University of Illinois – Urbana-Champaign

7. 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 April 18, 2021. 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. 18 Apr 2021.

Vancouver:

Yu Y. A thesis on algorithmic trading. [Internet] [Thesis]. University of Illinois – Urbana-Champaign; 2015. [cited 2021 Apr 18]. 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


University of Illinois – Urbana-Champaign

8. Buccafusca, Lucas D. Modeling and maximizing power in wind turbine arrays.

Degree: MS, Electrical & Computer Engr, 2017, University of Illinois – Urbana-Champaign

 This work considers a specific application domain, that of wind turbine arrays, and explores algorithms for determining individual axial induction factors that optimize overall energy… (more)

Subjects/Keywords: Optimization; Wind energy; Dynamic programming

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Buccafusca, L. D. (2017). Modeling and maximizing power in wind turbine arrays. (Thesis). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/99123

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

Buccafusca, Lucas D. “Modeling and maximizing power in wind turbine arrays.” 2017. Thesis, University of Illinois – Urbana-Champaign. Accessed April 18, 2021. http://hdl.handle.net/2142/99123.

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

MLA Handbook (7th Edition):

Buccafusca, Lucas D. “Modeling and maximizing power in wind turbine arrays.” 2017. Web. 18 Apr 2021.

Vancouver:

Buccafusca LD. Modeling and maximizing power in wind turbine arrays. [Internet] [Thesis]. University of Illinois – Urbana-Champaign; 2017. [cited 2021 Apr 18]. Available from: http://hdl.handle.net/2142/99123.

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

Council of Science Editors:

Buccafusca LD. Modeling and maximizing power in wind turbine arrays. [Thesis]. University of Illinois – Urbana-Champaign; 2017. Available from: http://hdl.handle.net/2142/99123

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


University of Southern California

9. 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/7812

Chicago Manual of Style (16th Edition):

Chen, Kai. “Variants of stochastic knapsack problems.” 2013. Doctoral Dissertation, University of Southern California. Accessed April 18, 2021. http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll3/id/347957/rec/7812.

MLA Handbook (7th Edition):

Chen, Kai. “Variants of stochastic knapsack problems.” 2013. Web. 18 Apr 2021.

Vancouver:

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

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/7812


Addis Ababa University

10. Abibual, Abate. Optimal Controller Design for Wind Turbine System Using Dynamic Programming .

Degree: 2019, Addis Ababa University

 Now a days, many researchers are focusing on renewable energy sources due to the fact that the cost of fuel is growing up in day… (more)

Subjects/Keywords: Optimal control; dynamic programming; optimization

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Abibual, A. (2019). Optimal Controller Design for Wind Turbine System Using Dynamic Programming . (Thesis). Addis Ababa University. Retrieved from http://etd.aau.edu.et/handle/123456789/20962

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

Abibual, Abate. “Optimal Controller Design for Wind Turbine System Using Dynamic Programming .” 2019. Thesis, Addis Ababa University. Accessed April 18, 2021. http://etd.aau.edu.et/handle/123456789/20962.

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

MLA Handbook (7th Edition):

Abibual, Abate. “Optimal Controller Design for Wind Turbine System Using Dynamic Programming .” 2019. Web. 18 Apr 2021.

Vancouver:

Abibual A. Optimal Controller Design for Wind Turbine System Using Dynamic Programming . [Internet] [Thesis]. Addis Ababa University; 2019. [cited 2021 Apr 18]. Available from: http://etd.aau.edu.et/handle/123456789/20962.

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

Council of Science Editors:

Abibual A. Optimal Controller Design for Wind Turbine System Using Dynamic Programming . [Thesis]. Addis Ababa University; 2019. Available from: http://etd.aau.edu.et/handle/123456789/20962

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


University of Texas – Austin

11. 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 April 18, 2021. 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. 18 Apr 2021.

Vancouver:

Fayvisovich R. Martingale-generated control structures and a framework for the dynamic programming principle. [Internet] [Doctoral dissertation]. University of Texas – Austin; 2017. [cited 2021 Apr 18]. 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


Penn State University

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

Degree: 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. (Thesis). Penn State University. Retrieved from https://submit-etda.libraries.psu.edu/catalog/26597

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

Guo, Yuecheng. “Unit Commitment with Electrochemical Storage: an Investigation of Dynamic Programming Schemes.” 2015. Thesis, Penn State University. Accessed April 18, 2021. https://submit-etda.libraries.psu.edu/catalog/26597.

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

MLA Handbook (7th Edition):

Guo, Yuecheng. “Unit Commitment with Electrochemical Storage: an Investigation of Dynamic Programming Schemes.” 2015. Web. 18 Apr 2021.

Vancouver:

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

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

Council of Science Editors:

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

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


University of KwaZulu-Natal

13. Ragalo, Anisa Waganda. Evolving dynamic fitness measures for genetic programming.

Degree: 2018, University of KwaZulu-Natal

 This research proposes dynamic fitness measure genetic programming (DFMGP). DFMGP modifies the conventional genetic programming (GP) approach: rather than applying a single fitness measure individually… (more)

Subjects/Keywords: Genetic programming.; Programming.; Dynamic fitness measure genetic programming.

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Ragalo, A. W. (2018). Evolving dynamic fitness measures for genetic programming. (Thesis). University of KwaZulu-Natal. Retrieved from https://researchspace.ukzn.ac.za/handle/10413/18092

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

Ragalo, Anisa Waganda. “Evolving dynamic fitness measures for genetic programming.” 2018. Thesis, University of KwaZulu-Natal. Accessed April 18, 2021. https://researchspace.ukzn.ac.za/handle/10413/18092.

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

MLA Handbook (7th Edition):

Ragalo, Anisa Waganda. “Evolving dynamic fitness measures for genetic programming.” 2018. Web. 18 Apr 2021.

Vancouver:

Ragalo AW. Evolving dynamic fitness measures for genetic programming. [Internet] [Thesis]. University of KwaZulu-Natal; 2018. [cited 2021 Apr 18]. Available from: https://researchspace.ukzn.ac.za/handle/10413/18092.

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

Council of Science Editors:

Ragalo AW. Evolving dynamic fitness measures for genetic programming. [Thesis]. University of KwaZulu-Natal; 2018. Available from: https://researchspace.ukzn.ac.za/handle/10413/18092

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


Georgia Tech

14. 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 April 18, 2021. http://hdl.handle.net/1853/51862.

MLA Handbook (7th Edition):

Angulo Olivares, Gustavo, I. “Integer programming approaches for semicontinuous and stochastic optimization.” 2014. Web. 18 Apr 2021.

Vancouver:

Angulo Olivares, Gustavo I. Integer programming approaches for semicontinuous and stochastic optimization. [Internet] [Doctoral dissertation]. Georgia Tech; 2014. [cited 2021 Apr 18]. 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


NSYSU

15. 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 April 18, 2021. 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. 18 Apr 2021.

Vancouver:

Cheng K. The Longest Common Subsequence Problem with a Gapped Constraint. [Internet] [Thesis]. NSYSU; 2012. [cited 2021 Apr 18]. 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

16. 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 April 18, 2021. 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. 18 Apr 2021.

Vancouver:

Ho W. A Fast Algorithm for the Constrained Longest Common Subsequence Problem with Small Alphabet. [Internet] [Thesis]. NSYSU; 2017. [cited 2021 Apr 18]. 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

17. 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 April 18, 2021. 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. 18 Apr 2021.

Vancouver:

Graaff LWvd. Dynamic programming on Nice Tree Decompositions. [Internet] [Masters thesis]. Universiteit Utrecht; 2015. [cited 2021 Apr 18]. 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


University of Alberta

18. 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 April 18, 2021. 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. 18 Apr 2021.

Vancouver:

Arefi A. On the Optimal Set of Channels to Sense in Cognitive Radio Networks. [Internet] [Masters thesis]. University of Alberta; 2015. [cited 2021 Apr 18]. 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

19. 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 April 18, 2021. https://era.library.ualberta.ca/files/12579t58k.

MLA Handbook (7th Edition):

Zeng, Linghang. “Trading Large VWAP Orders in Discrete Time.” 2013. Web. 18 Apr 2021.

Vancouver:

Zeng L. Trading Large VWAP Orders in Discrete Time. [Internet] [Masters thesis]. University of Alberta; 2013. [cited 2021 Apr 18]. 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

20. 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 April 18, 2021. 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. 18 Apr 2021.

Vancouver:

Karimipour H. Parallel Dynamic State Estimation of Large-scale Cyber-physical Power Systems. [Internet] [Doctoral dissertation]. University of Alberta; 2016. [cited 2021 Apr 18]. 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

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

Degree: PhD, Civil and Environmental Engineering, 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. (Doctoral Dissertation). Cornell University. Retrieved from http://hdl.handle.net/1813/39482

Chicago Manual of Style (16th Edition):

Lamontagne, Jonathan. “Representation Of Uncertainty And Corridor Dp For Hydropower Optimization.” 2015. Doctoral Dissertation, Cornell University. Accessed April 18, 2021. http://hdl.handle.net/1813/39482.

MLA Handbook (7th Edition):

Lamontagne, Jonathan. “Representation Of Uncertainty And Corridor Dp For Hydropower Optimization.” 2015. Web. 18 Apr 2021.

Vancouver:

Lamontagne J. Representation Of Uncertainty And Corridor Dp For Hydropower Optimization. [Internet] [Doctoral dissertation]. Cornell University; 2015. [cited 2021 Apr 18]. Available from: http://hdl.handle.net/1813/39482.

Council of Science Editors:

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


Cornell University

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

Degree: M.S., Agricultural Economics, Agricultural Economics, 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. (Masters Thesis). Cornell University. Retrieved from http://hdl.handle.net/1813/29472

Chicago Manual of Style (16th Edition):

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

MLA Handbook (7th Edition):

Finseth, Ryan. “Cost-Effective Recovery Of An Endangered Species: The Red-Cockaded Woodpecker.” 2012. Web. 18 Apr 2021.

Vancouver:

Finseth R. Cost-Effective Recovery Of An Endangered Species: The Red-Cockaded Woodpecker. [Internet] [Masters thesis]. Cornell University; 2012. [cited 2021 Apr 18]. Available from: http://hdl.handle.net/1813/29472.

Council of Science Editors:

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


Texas A&M University

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

Degree: MS, Mechanical Engineering, 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. (Masters Thesis). Texas A&M University. Retrieved from http://hdl.handle.net/1969.1/ETD-TAMU-2011-05-9520

Chicago Manual of Style (16th Edition):

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

MLA Handbook (7th Edition):

Walton, Zachary. “Optimal Control of Perimeter Patrol Using Reinforcement Learning.” 2011. Web. 18 Apr 2021.

Vancouver:

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

Council of Science Editors:

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


Texas A&M University

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

Degree: PhD, Electrical Engineering, 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. (Doctoral Dissertation). Texas A&M University. Retrieved from http://hdl.handle.net/1969.1/149289

Chicago Manual of Style (16th Edition):

Lai, Lin. “A Development of Design and Control Methodology for Next Generation Parallel Hybrid Electric Vehicle.” 2013. Doctoral Dissertation, Texas A&M University. Accessed April 18, 2021. http://hdl.handle.net/1969.1/149289.

MLA Handbook (7th Edition):

Lai, Lin. “A Development of Design and Control Methodology for Next Generation Parallel Hybrid Electric Vehicle.” 2013. Web. 18 Apr 2021.

Vancouver:

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

Council of Science Editors:

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


Texas A&M University

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

Degree: PhD, Industrial Engineering, 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. (Doctoral Dissertation). Texas A&M University. Retrieved from http://hdl.handle.net/1969.1/150943

Chicago Manual of Style (16th Edition):

Zhang, Liqing. “Stochastic Dynamic Demand Inventory Models with Explicit Transportation Costs and Decisions.” 2011. Doctoral Dissertation, Texas A&M University. Accessed April 18, 2021. http://hdl.handle.net/1969.1/150943.

MLA Handbook (7th Edition):

Zhang, Liqing. “Stochastic Dynamic Demand Inventory Models with Explicit Transportation Costs and Decisions.” 2011. Web. 18 Apr 2021.

Vancouver:

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

Council of Science Editors:

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


University of Waterloo

26. Qian, David. Dynamic Programming: Salesman to Surgeon.

Degree: 2013, University of Waterloo

Dynamic Programming is an optimization technique used in computer science and mathematics. Introduced in the 1950s, it has been applied to many classic combinatorial optimization… (more)

Subjects/Keywords: Dynamic Programming; TSP; Optimization; Traveling Salesman Problem

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Qian, D. (2013). Dynamic Programming: Salesman to Surgeon. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/7526

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

Qian, David. “Dynamic Programming: Salesman to Surgeon.” 2013. Thesis, University of Waterloo. Accessed April 18, 2021. http://hdl.handle.net/10012/7526.

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

MLA Handbook (7th Edition):

Qian, David. “Dynamic Programming: Salesman to Surgeon.” 2013. Web. 18 Apr 2021.

Vancouver:

Qian D. Dynamic Programming: Salesman to Surgeon. [Internet] [Thesis]. University of Waterloo; 2013. [cited 2021 Apr 18]. Available from: http://hdl.handle.net/10012/7526.

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

Council of Science Editors:

Qian D. Dynamic Programming: Salesman to Surgeon. [Thesis]. University of Waterloo; 2013. Available from: http://hdl.handle.net/10012/7526

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


Penn State University

27. You, Fan. Unit Commitment Problems: A Comparison of Algorithms and Heuristics.

Degree: 2015, Penn State University

 Unit commitment problems have been an area of research interest for many decades. The general unit commitment problem is a model used to determine when… (more)

Subjects/Keywords: Unit Commitment; Dynamic Programming; PCA; Neural Networks

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

You, F. (2015). Unit Commitment Problems: A Comparison of Algorithms and Heuristics. (Thesis). Penn State University. Retrieved from https://submit-etda.libraries.psu.edu/catalog/27420

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

You, Fan. “Unit Commitment Problems: A Comparison of Algorithms and Heuristics.” 2015. Thesis, Penn State University. Accessed April 18, 2021. https://submit-etda.libraries.psu.edu/catalog/27420.

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

MLA Handbook (7th Edition):

You, Fan. “Unit Commitment Problems: A Comparison of Algorithms and Heuristics.” 2015. Web. 18 Apr 2021.

Vancouver:

You F. Unit Commitment Problems: A Comparison of Algorithms and Heuristics. [Internet] [Thesis]. Penn State University; 2015. [cited 2021 Apr 18]. Available from: https://submit-etda.libraries.psu.edu/catalog/27420.

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

Council of Science Editors:

You F. Unit Commitment Problems: A Comparison of Algorithms and Heuristics. [Thesis]. Penn State University; 2015. Available from: https://submit-etda.libraries.psu.edu/catalog/27420

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


Texas Tech University

28. 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 April 18, 2021. http://hdl.handle.net/2346/74397.

MLA Handbook (7th Edition):

Middleton, Marty. “Uncertainty effects on Ogallala aquifer withdrawal: Is regulation needed?.” 2018. Web. 18 Apr 2021.

Vancouver:

Middleton M. Uncertainty effects on Ogallala aquifer withdrawal: Is regulation needed?. [Internet] [Doctoral dissertation]. Texas Tech University; 2018. [cited 2021 Apr 18]. 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


Addis Ababa University

29. 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 April 18, 2021. 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. 18 Apr 2021.

Vancouver:

Jalele G. Optimization of Hydropower Plant Expansion . [Internet] [Thesis]. Addis Ababa University; 2008. [cited 2021 Apr 18]. 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


Victoria University of Wellington

30. Roberts, Richard. Converting Motion Capture Into Editable Keyframe Animation: Fast, Optimal, and Generic Keyframe Selection.

Degree: 2018, Victoria University of Wellington

 Motion capture is attractive to visual effects studios because it offers a fast and automatic way to create animation directly from actors' movements. Despite extensive… (more)

Subjects/Keywords: Dynamic programming; Animation principles; Motion editing

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Roberts, R. (2018). Converting Motion Capture Into Editable Keyframe Animation: Fast, Optimal, and Generic Keyframe Selection. (Doctoral Dissertation). Victoria University of Wellington. Retrieved from http://hdl.handle.net/10063/6924

Chicago Manual of Style (16th Edition):

Roberts, Richard. “Converting Motion Capture Into Editable Keyframe Animation: Fast, Optimal, and Generic Keyframe Selection.” 2018. Doctoral Dissertation, Victoria University of Wellington. Accessed April 18, 2021. http://hdl.handle.net/10063/6924.

MLA Handbook (7th Edition):

Roberts, Richard. “Converting Motion Capture Into Editable Keyframe Animation: Fast, Optimal, and Generic Keyframe Selection.” 2018. Web. 18 Apr 2021.

Vancouver:

Roberts R. Converting Motion Capture Into Editable Keyframe Animation: Fast, Optimal, and Generic Keyframe Selection. [Internet] [Doctoral dissertation]. Victoria University of Wellington; 2018. [cited 2021 Apr 18]. Available from: http://hdl.handle.net/10063/6924.

Council of Science Editors:

Roberts R. Converting Motion Capture Into Editable Keyframe Animation: Fast, Optimal, and Generic Keyframe Selection. [Doctoral Dissertation]. Victoria University of Wellington; 2018. Available from: http://hdl.handle.net/10063/6924

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

.