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:(Approximate dynamic programming). Showing records 1 – 30 of 62 total matches.

[1] [2] [3]

Search Limiters

Last 2 Years | English Only

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

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


University of Edinburgh

2. 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 September 22, 2019. http://hdl.handle.net/1842/5883.

MLA Handbook (7th Edition):

Yang, Xinan. “Top-percentile traffic routing problem.” 2012. Web. 22 Sep 2019.

Vancouver:

Yang X. Top-percentile traffic routing problem. [Internet] [Doctoral dissertation]. University of Edinburgh; 2012. [cited 2019 Sep 22]. 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


Penn State University

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

Vancouver:

Guo Y. Unit Commitment with Electrochemical Storage: an Investigation of Dynamic Programming Schemes. [Internet] [Masters thesis]. Penn State University; 2015. [cited 2019 Sep 22]. 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

4. Petrik, Marek. Optimization-based Approximate Dynamic Programming.

Degree: PhD, Computer Science, 2010, U of Massachusetts : PhD

 Reinforcement learning algorithms hold promise in many complex domains, such as resource management and planning under uncertainty. Most reinforcement learning algorithms are iterative - they… (more)

Subjects/Keywords: Approximate Dynamic Programming; Approximate Linear Programming; Markov Decision Problem; Mathematical Optimization; Reinforcement Learning; Computer Sciences

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Petrik, M. (2010). Optimization-based Approximate Dynamic Programming. (Doctoral Dissertation). U of Massachusetts : PhD. Retrieved from https://scholarworks.umass.edu/open_access_dissertations/308

Chicago Manual of Style (16th Edition):

Petrik, Marek. “Optimization-based Approximate Dynamic Programming.” 2010. Doctoral Dissertation, U of Massachusetts : PhD. Accessed September 22, 2019. https://scholarworks.umass.edu/open_access_dissertations/308.

MLA Handbook (7th Edition):

Petrik, Marek. “Optimization-based Approximate Dynamic Programming.” 2010. Web. 22 Sep 2019.

Vancouver:

Petrik M. Optimization-based Approximate Dynamic Programming. [Internet] [Doctoral dissertation]. U of Massachusetts : PhD; 2010. [cited 2019 Sep 22]. Available from: https://scholarworks.umass.edu/open_access_dissertations/308.

Council of Science Editors:

Petrik M. Optimization-based Approximate Dynamic Programming. [Doctoral Dissertation]. U of Massachusetts : PhD; 2010. Available from: https://scholarworks.umass.edu/open_access_dissertations/308


Cornell University

5. Chan, Collin. Decomposition Methods For Managing Service Parts With Coupled Demands .

Degree: 2012, Cornell University

 We consider the inventory management problem of procurement and allocation for a non-stationary equipment overhaul problem with stochastic demands for multiple job types requiring different… (more)

Subjects/Keywords: Service Parts Supply Chains; Decomposition Methods; Approximate Dynamic Programming

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Chan, C. (2012). Decomposition Methods For Managing Service Parts With Coupled Demands . (Thesis). Cornell University. Retrieved from http://hdl.handle.net/1813/31002

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

Chan, Collin. “Decomposition Methods For Managing Service Parts With Coupled Demands .” 2012. Thesis, Cornell University. Accessed September 22, 2019. http://hdl.handle.net/1813/31002.

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

MLA Handbook (7th Edition):

Chan, Collin. “Decomposition Methods For Managing Service Parts With Coupled Demands .” 2012. Web. 22 Sep 2019.

Vancouver:

Chan C. Decomposition Methods For Managing Service Parts With Coupled Demands . [Internet] [Thesis]. Cornell University; 2012. [cited 2019 Sep 22]. Available from: http://hdl.handle.net/1813/31002.

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

Council of Science Editors:

Chan C. Decomposition Methods For Managing Service Parts With Coupled Demands . [Thesis]. Cornell University; 2012. Available from: http://hdl.handle.net/1813/31002

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


Cornell University

6. Stasko, Timon. Parallel Real Asset Management With Environmental Regulation: Integer Programming And Approximate Dynamic Programming Approaches .

Degree: 2011, Cornell University

 This dissertation presents a pair of models designed to assist in the management of multiple deteriorating real assets, given financial and environmental concerns. Whether the… (more)

Subjects/Keywords: fleet management; parallel asset replacement; approximate dynamic programming

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Stasko, T. (2011). Parallel Real Asset Management With Environmental Regulation: Integer Programming And Approximate Dynamic Programming Approaches . (Thesis). Cornell University. Retrieved from http://hdl.handle.net/1813/30732

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

Stasko, Timon. “Parallel Real Asset Management With Environmental Regulation: Integer Programming And Approximate Dynamic Programming Approaches .” 2011. Thesis, Cornell University. Accessed September 22, 2019. http://hdl.handle.net/1813/30732.

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

MLA Handbook (7th Edition):

Stasko, Timon. “Parallel Real Asset Management With Environmental Regulation: Integer Programming And Approximate Dynamic Programming Approaches .” 2011. Web. 22 Sep 2019.

Vancouver:

Stasko T. Parallel Real Asset Management With Environmental Regulation: Integer Programming And Approximate Dynamic Programming Approaches . [Internet] [Thesis]. Cornell University; 2011. [cited 2019 Sep 22]. Available from: http://hdl.handle.net/1813/30732.

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

Council of Science Editors:

Stasko T. Parallel Real Asset Management With Environmental Regulation: Integer Programming And Approximate Dynamic Programming Approaches . [Thesis]. Cornell University; 2011. Available from: http://hdl.handle.net/1813/30732

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


Cornell University

7. Maxwell, Matthew. Approximate Dynamic Programming Policies And Performance Bounds For Ambulance Redeployment .

Degree: 2011, Cornell University

 Ambulance redeployment is the practice of dynamically relocating idle ambulances based upon real-time information to reduce expected response times for future emergency calls. Ambulance redeployment… (more)

Subjects/Keywords: emergency services; approximate dynamic programming; post-decision state

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Maxwell, M. (2011). Approximate Dynamic Programming Policies And Performance Bounds For Ambulance Redeployment . (Thesis). Cornell University. Retrieved from http://hdl.handle.net/1813/29425

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

Maxwell, Matthew. “Approximate Dynamic Programming Policies And Performance Bounds For Ambulance Redeployment .” 2011. Thesis, Cornell University. Accessed September 22, 2019. http://hdl.handle.net/1813/29425.

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

MLA Handbook (7th Edition):

Maxwell, Matthew. “Approximate Dynamic Programming Policies And Performance Bounds For Ambulance Redeployment .” 2011. Web. 22 Sep 2019.

Vancouver:

Maxwell M. Approximate Dynamic Programming Policies And Performance Bounds For Ambulance Redeployment . [Internet] [Thesis]. Cornell University; 2011. [cited 2019 Sep 22]. Available from: http://hdl.handle.net/1813/29425.

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

Council of Science Editors:

Maxwell M. Approximate Dynamic Programming Policies And Performance Bounds For Ambulance Redeployment . [Thesis]. Cornell University; 2011. Available from: http://hdl.handle.net/1813/29425

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


Princeton University

8. Jiang, Daniel Ruoling. Risk-Neutral and Risk-Averse Approximate Dynamic Programming Methods .

Degree: PhD, 2016, Princeton University

 In this thesis, we propose approximate dynamic programming (ADP) methods for solving risk-neutral and risk-averse sequential decision problems under uncertainty, focusing on models that are… (more)

Subjects/Keywords: approximate dynamic programming; energy bidding; monotonicity; risk averse

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Jiang, D. R. (2016). Risk-Neutral and Risk-Averse Approximate Dynamic Programming Methods . (Doctoral Dissertation). Princeton University. Retrieved from http://arks.princeton.edu/ark:/88435/dsp016969z3194

Chicago Manual of Style (16th Edition):

Jiang, Daniel Ruoling. “Risk-Neutral and Risk-Averse Approximate Dynamic Programming Methods .” 2016. Doctoral Dissertation, Princeton University. Accessed September 22, 2019. http://arks.princeton.edu/ark:/88435/dsp016969z3194.

MLA Handbook (7th Edition):

Jiang, Daniel Ruoling. “Risk-Neutral and Risk-Averse Approximate Dynamic Programming Methods .” 2016. Web. 22 Sep 2019.

Vancouver:

Jiang DR. Risk-Neutral and Risk-Averse Approximate Dynamic Programming Methods . [Internet] [Doctoral dissertation]. Princeton University; 2016. [cited 2019 Sep 22]. Available from: http://arks.princeton.edu/ark:/88435/dsp016969z3194.

Council of Science Editors:

Jiang DR. Risk-Neutral and Risk-Averse Approximate Dynamic Programming Methods . [Doctoral Dissertation]. Princeton University; 2016. Available from: http://arks.princeton.edu/ark:/88435/dsp016969z3194


University of Ottawa

9. Astaraky, Davood. A Simulation Based Approximate Dynamic Programming Approach to Multi-class, Multi-resource Surgical Scheduling .

Degree: 2013, University of Ottawa

 The thesis focuses on a model that seeks to address patient scheduling step of the surgical scheduling process to determine the number of surgeries to… (more)

Subjects/Keywords: Approximate Dynamic Programming; Surgical Scheduling; Markov Decision Process

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Astaraky, D. (2013). A Simulation Based Approximate Dynamic Programming Approach to Multi-class, Multi-resource Surgical Scheduling . (Thesis). University of Ottawa. Retrieved from http://hdl.handle.net/10393/23622

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

Astaraky, Davood. “A Simulation Based Approximate Dynamic Programming Approach to Multi-class, Multi-resource Surgical Scheduling .” 2013. Thesis, University of Ottawa. Accessed September 22, 2019. http://hdl.handle.net/10393/23622.

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

MLA Handbook (7th Edition):

Astaraky, Davood. “A Simulation Based Approximate Dynamic Programming Approach to Multi-class, Multi-resource Surgical Scheduling .” 2013. Web. 22 Sep 2019.

Vancouver:

Astaraky D. A Simulation Based Approximate Dynamic Programming Approach to Multi-class, Multi-resource Surgical Scheduling . [Internet] [Thesis]. University of Ottawa; 2013. [cited 2019 Sep 22]. Available from: http://hdl.handle.net/10393/23622.

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

Council of Science Editors:

Astaraky D. A Simulation Based Approximate Dynamic Programming Approach to Multi-class, Multi-resource Surgical Scheduling . [Thesis]. University of Ottawa; 2013. Available from: http://hdl.handle.net/10393/23622

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


George Mason University

10. Southerland, Jason. USING APPROXIMATE DYNAMIC PROGRAMMING TO ADAPT A MILITARY FORCE MIX .

Degree: 2017, George Mason University

 Adaptation, “the ability to bring about timely and effective adjustment or change in response to the surrounding environment” (Defense Science Board, 2010), is critical to… (more)

Subjects/Keywords: Operations research; Approximate dynamic programming; Force structure; Value function approximation

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Southerland, J. (2017). USING APPROXIMATE DYNAMIC PROGRAMMING TO ADAPT A MILITARY FORCE MIX . (Thesis). George Mason University. Retrieved from http://hdl.handle.net/1920/11307

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

Southerland, Jason. “USING APPROXIMATE DYNAMIC PROGRAMMING TO ADAPT A MILITARY FORCE MIX .” 2017. Thesis, George Mason University. Accessed September 22, 2019. http://hdl.handle.net/1920/11307.

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

MLA Handbook (7th Edition):

Southerland, Jason. “USING APPROXIMATE DYNAMIC PROGRAMMING TO ADAPT A MILITARY FORCE MIX .” 2017. Web. 22 Sep 2019.

Vancouver:

Southerland J. USING APPROXIMATE DYNAMIC PROGRAMMING TO ADAPT A MILITARY FORCE MIX . [Internet] [Thesis]. George Mason University; 2017. [cited 2019 Sep 22]. Available from: http://hdl.handle.net/1920/11307.

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

Council of Science Editors:

Southerland J. USING APPROXIMATE DYNAMIC PROGRAMMING TO ADAPT A MILITARY FORCE MIX . [Thesis]. George Mason University; 2017. Available from: http://hdl.handle.net/1920/11307

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


George Mason University

11. Balakrishna, Poornima. Scalable Approximate Dynamic Programming Models with Applications in Air Transportation .

Degree: 2009, George Mason University

 The research objective of the dissertation is to develop methods to address the curse of dimensionality in the field of approximate dynamic programming, to enhance… (more)

Subjects/Keywords: approximate dynamic programming; scalability; taxi-out time; air transportation; dimensionality

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Balakrishna, P. (2009). Scalable Approximate Dynamic Programming Models with Applications in Air Transportation . (Thesis). George Mason University. Retrieved from http://hdl.handle.net/1920/5619

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

Balakrishna, Poornima. “Scalable Approximate Dynamic Programming Models with Applications in Air Transportation .” 2009. Thesis, George Mason University. Accessed September 22, 2019. http://hdl.handle.net/1920/5619.

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

MLA Handbook (7th Edition):

Balakrishna, Poornima. “Scalable Approximate Dynamic Programming Models with Applications in Air Transportation .” 2009. Web. 22 Sep 2019.

Vancouver:

Balakrishna P. Scalable Approximate Dynamic Programming Models with Applications in Air Transportation . [Internet] [Thesis]. George Mason University; 2009. [cited 2019 Sep 22]. Available from: http://hdl.handle.net/1920/5619.

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

Council of Science Editors:

Balakrishna P. Scalable Approximate Dynamic Programming Models with Applications in Air Transportation . [Thesis]. George Mason University; 2009. Available from: http://hdl.handle.net/1920/5619

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


Cornell University

12. Perline, Kyle Robert. Improving the Computational Efficiency of Approximate Dynamic Programming using Neural Networks, with Application to a Multi-Reservoir Hydropower and Wind Power System .

Degree: 2017, Cornell University

 This dissertation develops a more computationally efficient Approximate Dynamic Programming (ADP) method that can be applied to optimal control problems that are stochastic, nonconvex, and… (more)

Subjects/Keywords: Approximate Dynamic Programming; Hydropower; Wind Power; Applied mathematics

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Perline, K. R. (2017). Improving the Computational Efficiency of Approximate Dynamic Programming using Neural Networks, with Application to a Multi-Reservoir Hydropower and Wind Power System . (Thesis). Cornell University. Retrieved from http://hdl.handle.net/1813/59053

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

Perline, Kyle Robert. “Improving the Computational Efficiency of Approximate Dynamic Programming using Neural Networks, with Application to a Multi-Reservoir Hydropower and Wind Power System .” 2017. Thesis, Cornell University. Accessed September 22, 2019. http://hdl.handle.net/1813/59053.

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

MLA Handbook (7th Edition):

Perline, Kyle Robert. “Improving the Computational Efficiency of Approximate Dynamic Programming using Neural Networks, with Application to a Multi-Reservoir Hydropower and Wind Power System .” 2017. Web. 22 Sep 2019.

Vancouver:

Perline KR. Improving the Computational Efficiency of Approximate Dynamic Programming using Neural Networks, with Application to a Multi-Reservoir Hydropower and Wind Power System . [Internet] [Thesis]. Cornell University; 2017. [cited 2019 Sep 22]. Available from: http://hdl.handle.net/1813/59053.

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

Council of Science Editors:

Perline KR. Improving the Computational Efficiency of Approximate Dynamic Programming using Neural Networks, with Application to a Multi-Reservoir Hydropower and Wind Power System . [Thesis]. Cornell University; 2017. Available from: http://hdl.handle.net/1813/59053

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


University of New South Wales

13. Le, Tung Mai. An adaptive signal-vehicle cooperative control system.

Degree: Computer Science & Engineering, 2013, University of New South Wales

 In this thesis, we propose a fully cooperative control scheme that produces both effective traffic schedules for the traffic lights and suitable speeds for oncoming… (more)

Subjects/Keywords: Signal-vehicle communication; Approximate dynamic programming; Adaptive traffic control; Intelligent vehicles

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Le, T. M. (2013). An adaptive signal-vehicle cooperative control system. (Doctoral Dissertation). University of New South Wales. Retrieved from http://handle.unsw.edu.au/1959.4/52967 ; https://unsworks.unsw.edu.au/fapi/datastream/unsworks:11645/SOURCE01?view=true

Chicago Manual of Style (16th Edition):

Le, Tung Mai. “An adaptive signal-vehicle cooperative control system.” 2013. Doctoral Dissertation, University of New South Wales. Accessed September 22, 2019. http://handle.unsw.edu.au/1959.4/52967 ; https://unsworks.unsw.edu.au/fapi/datastream/unsworks:11645/SOURCE01?view=true.

MLA Handbook (7th Edition):

Le, Tung Mai. “An adaptive signal-vehicle cooperative control system.” 2013. Web. 22 Sep 2019.

Vancouver:

Le TM. An adaptive signal-vehicle cooperative control system. [Internet] [Doctoral dissertation]. University of New South Wales; 2013. [cited 2019 Sep 22]. Available from: http://handle.unsw.edu.au/1959.4/52967 ; https://unsworks.unsw.edu.au/fapi/datastream/unsworks:11645/SOURCE01?view=true.

Council of Science Editors:

Le TM. An adaptive signal-vehicle cooperative control system. [Doctoral Dissertation]. University of New South Wales; 2013. Available from: http://handle.unsw.edu.au/1959.4/52967 ; https://unsworks.unsw.edu.au/fapi/datastream/unsworks:11645/SOURCE01?view=true


University of Oxford

14. Stellato, Bartolomeo. Mixed-integer optimal control of fast dynamical systems.

Degree: PhD, 2017, University of Oxford

 Many applications in engineering, computer science and economics involve mixed-integer optimal control problems. Solving these problems in real-time is a challenging task because of the… (more)

Subjects/Keywords: 519.6; Mathematical optimization; Approximate dynamic programming; Optimal control; Hybrid systems; Integer programming

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Stellato, B. (2017). Mixed-integer optimal control of fast dynamical systems. (Doctoral Dissertation). University of Oxford. Retrieved from https://ora.ox.ac.uk/objects/uuid:b8a7323c-e36e-45ec-ae8d-6c9eb4350629 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.729414

Chicago Manual of Style (16th Edition):

Stellato, Bartolomeo. “Mixed-integer optimal control of fast dynamical systems.” 2017. Doctoral Dissertation, University of Oxford. Accessed September 22, 2019. https://ora.ox.ac.uk/objects/uuid:b8a7323c-e36e-45ec-ae8d-6c9eb4350629 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.729414.

MLA Handbook (7th Edition):

Stellato, Bartolomeo. “Mixed-integer optimal control of fast dynamical systems.” 2017. Web. 22 Sep 2019.

Vancouver:

Stellato B. Mixed-integer optimal control of fast dynamical systems. [Internet] [Doctoral dissertation]. University of Oxford; 2017. [cited 2019 Sep 22]. Available from: https://ora.ox.ac.uk/objects/uuid:b8a7323c-e36e-45ec-ae8d-6c9eb4350629 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.729414.

Council of Science Editors:

Stellato B. Mixed-integer optimal control of fast dynamical systems. [Doctoral Dissertation]. University of Oxford; 2017. Available from: https://ora.ox.ac.uk/objects/uuid:b8a7323c-e36e-45ec-ae8d-6c9eb4350629 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.729414


University of California – Berkeley

15. Medury, Aditya. Incorporating Network Considerations into System-level Pavement Management Systems.

Degree: Civil and Environmental Engineering, 2013, University of California – Berkeley

 The objective of transportation infrastructure management is to provide optimal maintenance, rehabilitation and replacement (MR&R) policies for a system of facilities over a planning horizon.… (more)

Subjects/Keywords: Transportation planning; Operations research; Approximate Dynamic Programming; Dynamic Programming; Markov Decision Process; Road Maintenance; Transportation Infrastructure Management

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Medury, A. (2013). Incorporating Network Considerations into System-level Pavement Management Systems. (Thesis). University of California – Berkeley. Retrieved from http://www.escholarship.org/uc/item/4x2073v0

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

Medury, Aditya. “Incorporating Network Considerations into System-level Pavement Management Systems.” 2013. Thesis, University of California – Berkeley. Accessed September 22, 2019. http://www.escholarship.org/uc/item/4x2073v0.

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

MLA Handbook (7th Edition):

Medury, Aditya. “Incorporating Network Considerations into System-level Pavement Management Systems.” 2013. Web. 22 Sep 2019.

Vancouver:

Medury A. Incorporating Network Considerations into System-level Pavement Management Systems. [Internet] [Thesis]. University of California – Berkeley; 2013. [cited 2019 Sep 22]. Available from: http://www.escholarship.org/uc/item/4x2073v0.

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

Council of Science Editors:

Medury A. Incorporating Network Considerations into System-level Pavement Management Systems. [Thesis]. University of California – Berkeley; 2013. Available from: http://www.escholarship.org/uc/item/4x2073v0

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


University of Sydney

16. Keerthisinghe, Chanaka. Fast Solution Techniques for Energy Management in Smart Homes .

Degree: 2016, University of Sydney

 In the future, residential energy users will seize the full potential of demand response schemes by using an automated smart home energy management system (SHEMS)… (more)

Subjects/Keywords: energy management in smart homes; approximate dynamic programming; dynamic programming; smart grid; demand response; PV-storage systems

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Keerthisinghe, C. (2016). Fast Solution Techniques for Energy Management in Smart Homes . (Thesis). University of Sydney. Retrieved from http://hdl.handle.net/2123/16033

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

Keerthisinghe, Chanaka. “Fast Solution Techniques for Energy Management in Smart Homes .” 2016. Thesis, University of Sydney. Accessed September 22, 2019. http://hdl.handle.net/2123/16033.

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

MLA Handbook (7th Edition):

Keerthisinghe, Chanaka. “Fast Solution Techniques for Energy Management in Smart Homes .” 2016. Web. 22 Sep 2019.

Vancouver:

Keerthisinghe C. Fast Solution Techniques for Energy Management in Smart Homes . [Internet] [Thesis]. University of Sydney; 2016. [cited 2019 Sep 22]. Available from: http://hdl.handle.net/2123/16033.

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

Council of Science Editors:

Keerthisinghe C. Fast Solution Techniques for Energy Management in Smart Homes . [Thesis]. University of Sydney; 2016. Available from: http://hdl.handle.net/2123/16033

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


Georgia Tech

17. Wong, Wee Chin. Estimation and control of jump stochastic systems.

Degree: PhD, Chemical Engineering, 2009, Georgia Tech

 Advanced process control solutions are oftentimes inadequate in their handling of uncertainty and disturbances. The main contribution of this work is to address this issue… (more)

Subjects/Keywords: Approximate dynamic programming; Hidden Markov Models; Stochastic process control; Stochastic systems; Markov processes; Dynamic programming; Process control

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Wong, W. C. (2009). Estimation and control of jump stochastic systems. (Doctoral Dissertation). Georgia Tech. Retrieved from http://hdl.handle.net/1853/31775

Chicago Manual of Style (16th Edition):

Wong, Wee Chin. “Estimation and control of jump stochastic systems.” 2009. Doctoral Dissertation, Georgia Tech. Accessed September 22, 2019. http://hdl.handle.net/1853/31775.

MLA Handbook (7th Edition):

Wong, Wee Chin. “Estimation and control of jump stochastic systems.” 2009. Web. 22 Sep 2019.

Vancouver:

Wong WC. Estimation and control of jump stochastic systems. [Internet] [Doctoral dissertation]. Georgia Tech; 2009. [cited 2019 Sep 22]. Available from: http://hdl.handle.net/1853/31775.

Council of Science Editors:

Wong WC. Estimation and control of jump stochastic systems. [Doctoral Dissertation]. Georgia Tech; 2009. Available from: http://hdl.handle.net/1853/31775


University of Cincinnati

18. Ramirez, Jose A. Optimal and Simulation-Based Approximate Dynamic Programming Approaches for the Control of Re-Entrant Line Manufacturing Models.

Degree: PhD, Engineering and Applied Science: Electrical Engineering, 2010, University of Cincinnati

 This dissertation considers the application of simulation-based Approximate Dynamic Programming Approaches (ADP) for near-optimal control of Re-entrant Line Manufacturing (RLM) models. This study departs from… (more)

Subjects/Keywords: Electrical Engineering; approximate dynamic programming; re-entrant lines; queueing networks; optimal control; Markov decision processes

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Ramirez, J. A. (2010). Optimal and Simulation-Based Approximate Dynamic Programming Approaches for the Control of Re-Entrant Line Manufacturing Models. (Doctoral Dissertation). University of Cincinnati. Retrieved from http://rave.ohiolink.edu/etdc/view?acc_num=ucin1282329260

Chicago Manual of Style (16th Edition):

Ramirez, Jose A. “Optimal and Simulation-Based Approximate Dynamic Programming Approaches for the Control of Re-Entrant Line Manufacturing Models.” 2010. Doctoral Dissertation, University of Cincinnati. Accessed September 22, 2019. http://rave.ohiolink.edu/etdc/view?acc_num=ucin1282329260.

MLA Handbook (7th Edition):

Ramirez, Jose A. “Optimal and Simulation-Based Approximate Dynamic Programming Approaches for the Control of Re-Entrant Line Manufacturing Models.” 2010. Web. 22 Sep 2019.

Vancouver:

Ramirez JA. Optimal and Simulation-Based Approximate Dynamic Programming Approaches for the Control of Re-Entrant Line Manufacturing Models. [Internet] [Doctoral dissertation]. University of Cincinnati; 2010. [cited 2019 Sep 22]. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=ucin1282329260.

Council of Science Editors:

Ramirez JA. Optimal and Simulation-Based Approximate Dynamic Programming Approaches for the Control of Re-Entrant Line Manufacturing Models. [Doctoral Dissertation]. University of Cincinnati; 2010. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=ucin1282329260


Vrije Universiteit Amsterdam

19. Roubos, D. The application of Approximate Dynamic Programming techniques .

Degree: 2010, Vrije Universiteit Amsterdam

Subjects/Keywords: approximate dynamic programming; markov decision process

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Roubos, D. (2010). The application of Approximate Dynamic Programming techniques . (Doctoral Dissertation). Vrije Universiteit Amsterdam. Retrieved from http://hdl.handle.net/1871/16056

Chicago Manual of Style (16th Edition):

Roubos, D. “The application of Approximate Dynamic Programming techniques .” 2010. Doctoral Dissertation, Vrije Universiteit Amsterdam. Accessed September 22, 2019. http://hdl.handle.net/1871/16056.

MLA Handbook (7th Edition):

Roubos, D. “The application of Approximate Dynamic Programming techniques .” 2010. Web. 22 Sep 2019.

Vancouver:

Roubos D. The application of Approximate Dynamic Programming techniques . [Internet] [Doctoral dissertation]. Vrije Universiteit Amsterdam; 2010. [cited 2019 Sep 22]. Available from: http://hdl.handle.net/1871/16056.

Council of Science Editors:

Roubos D. The application of Approximate Dynamic Programming techniques . [Doctoral Dissertation]. Vrije Universiteit Amsterdam; 2010. Available from: http://hdl.handle.net/1871/16056

20. Cakir, Fahrettin. Data-centric solution methodologies for vehicle routing problems.

Degree: PhD, Business Administration, 2016, University of Iowa

  Data-driven decision making has become more popular in today’s businesses including logistics and vehicle routing. Leveraging historical data, companies can achieve goals such as… (more)

Subjects/Keywords: approximate dynamic programming; clustering; consistency; orienteering; spatial correlation; vehicle routing; Business Administration, Management, and Operations

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Cakir, F. (2016). Data-centric solution methodologies for vehicle routing problems. (Doctoral Dissertation). University of Iowa. Retrieved from https://ir.uiowa.edu/etd/2052

Chicago Manual of Style (16th Edition):

Cakir, Fahrettin. “Data-centric solution methodologies for vehicle routing problems.” 2016. Doctoral Dissertation, University of Iowa. Accessed September 22, 2019. https://ir.uiowa.edu/etd/2052.

MLA Handbook (7th Edition):

Cakir, Fahrettin. “Data-centric solution methodologies for vehicle routing problems.” 2016. Web. 22 Sep 2019.

Vancouver:

Cakir F. Data-centric solution methodologies for vehicle routing problems. [Internet] [Doctoral dissertation]. University of Iowa; 2016. [cited 2019 Sep 22]. Available from: https://ir.uiowa.edu/etd/2052.

Council of Science Editors:

Cakir F. Data-centric solution methodologies for vehicle routing problems. [Doctoral Dissertation]. University of Iowa; 2016. Available from: https://ir.uiowa.edu/etd/2052


George Mason University

21. DeGregory, Keith W. An Approximate Dynamic Program for Allocating Federal Air Marshals in Near Real-Time Under Uncertainty .

Degree: 2014, George Mason University

 The Federal Air Marshal Service provides front-line security in homeland defense by protecting civil aviation from potential terrorist attacks. Unique challenges arise in maximizing effective… (more)

Subjects/Keywords: diffusion wavelet; approximate dynamic programming; value function approximation; sequential decision making under uncertainty

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

DeGregory, K. W. (2014). An Approximate Dynamic Program for Allocating Federal Air Marshals in Near Real-Time Under Uncertainty . (Thesis). George Mason University. Retrieved from http://hdl.handle.net/1920/9012

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

DeGregory, Keith W. “An Approximate Dynamic Program for Allocating Federal Air Marshals in Near Real-Time Under Uncertainty .” 2014. Thesis, George Mason University. Accessed September 22, 2019. http://hdl.handle.net/1920/9012.

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

MLA Handbook (7th Edition):

DeGregory, Keith W. “An Approximate Dynamic Program for Allocating Federal Air Marshals in Near Real-Time Under Uncertainty .” 2014. Web. 22 Sep 2019.

Vancouver:

DeGregory KW. An Approximate Dynamic Program for Allocating Federal Air Marshals in Near Real-Time Under Uncertainty . [Internet] [Thesis]. George Mason University; 2014. [cited 2019 Sep 22]. Available from: http://hdl.handle.net/1920/9012.

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

Council of Science Editors:

DeGregory KW. An Approximate Dynamic Program for Allocating Federal Air Marshals in Near Real-Time Under Uncertainty . [Thesis]. George Mason University; 2014. Available from: http://hdl.handle.net/1920/9012

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


Colorado State University

22. Nozhati, Saeed. OPTIMAL STOCHASTIC SCHEDULING OF RESTORATION OF INFRASTRUCTURE SYSTEMS FROM HAZARDS: AN APPROXIMATE DYNAMIC PROGRAMMING APPROACH.

Degree: PhD, Civil and Environmental Engineering, 2019, Colorado State University

 This dissertation introduces approximate dynamic programming (ADP) techniques to identify near-optimal recovery strategies following extreme natural hazards. The proposed techniques are intended to support policymakers,… (more)

Subjects/Keywords: Community resilience; Markov decision process; Rollout; Food security; Approximate dynamic programming; Optimal recovery management

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Nozhati, S. (2019). OPTIMAL STOCHASTIC SCHEDULING OF RESTORATION OF INFRASTRUCTURE SYSTEMS FROM HAZARDS: AN APPROXIMATE DYNAMIC PROGRAMMING APPROACH. (Doctoral Dissertation). Colorado State University. Retrieved from http://hdl.handle.net/10217/197318

Chicago Manual of Style (16th Edition):

Nozhati, Saeed. “OPTIMAL STOCHASTIC SCHEDULING OF RESTORATION OF INFRASTRUCTURE SYSTEMS FROM HAZARDS: AN APPROXIMATE DYNAMIC PROGRAMMING APPROACH.” 2019. Doctoral Dissertation, Colorado State University. Accessed September 22, 2019. http://hdl.handle.net/10217/197318.

MLA Handbook (7th Edition):

Nozhati, Saeed. “OPTIMAL STOCHASTIC SCHEDULING OF RESTORATION OF INFRASTRUCTURE SYSTEMS FROM HAZARDS: AN APPROXIMATE DYNAMIC PROGRAMMING APPROACH.” 2019. Web. 22 Sep 2019.

Vancouver:

Nozhati S. OPTIMAL STOCHASTIC SCHEDULING OF RESTORATION OF INFRASTRUCTURE SYSTEMS FROM HAZARDS: AN APPROXIMATE DYNAMIC PROGRAMMING APPROACH. [Internet] [Doctoral dissertation]. Colorado State University; 2019. [cited 2019 Sep 22]. Available from: http://hdl.handle.net/10217/197318.

Council of Science Editors:

Nozhati S. OPTIMAL STOCHASTIC SCHEDULING OF RESTORATION OF INFRASTRUCTURE SYSTEMS FROM HAZARDS: AN APPROXIMATE DYNAMIC PROGRAMMING APPROACH. [Doctoral Dissertation]. Colorado State University; 2019. Available from: http://hdl.handle.net/10217/197318


Kansas State University

23. Wang, Li. An approximate dynamic programming based home energy management system and its impact on the distribution system.

Degree: MS, Department of Electrical and Computer Engineering, 2019, Kansas State University

 The residential sector consumes more than 20 percent of electricity in the United States. In order to shift peak load, a utility company provides time-of-use… (more)

Subjects/Keywords: Approximate dynamic programming; Home energy management system; Demand response; Smart home; Mixed integer linear programming; Electric vehicle

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Wang, L. (2019). An approximate dynamic programming based home energy management system and its impact on the distribution system. (Masters Thesis). Kansas State University. Retrieved from http://hdl.handle.net/2097/39600

Chicago Manual of Style (16th Edition):

Wang, Li. “An approximate dynamic programming based home energy management system and its impact on the distribution system.” 2019. Masters Thesis, Kansas State University. Accessed September 22, 2019. http://hdl.handle.net/2097/39600.

MLA Handbook (7th Edition):

Wang, Li. “An approximate dynamic programming based home energy management system and its impact on the distribution system.” 2019. Web. 22 Sep 2019.

Vancouver:

Wang L. An approximate dynamic programming based home energy management system and its impact on the distribution system. [Internet] [Masters thesis]. Kansas State University; 2019. [cited 2019 Sep 22]. Available from: http://hdl.handle.net/2097/39600.

Council of Science Editors:

Wang L. An approximate dynamic programming based home energy management system and its impact on the distribution system. [Masters Thesis]. Kansas State University; 2019. Available from: http://hdl.handle.net/2097/39600


Clemson University

24. Nasrollahzadeh, Amir Ali. Approximate Dynamic Programming: Health Care Applications.

Degree: PhD, Industrial Engineering, 2019, Clemson University

  This dissertation considers different approximate solutions to Markov decision problems formulated within the dynamic programming framework in two health care applications. Dynamic formulations are… (more)

Subjects/Keywords: Adaptive Clinical Trials; Ambulance Operations Management; Approximate Dynamic Programming; Dose-Finding Studies; Dynamic Learning; Optimal Stopping of Clinical Trials

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Nasrollahzadeh, A. A. (2019). Approximate Dynamic Programming: Health Care Applications. (Doctoral Dissertation). Clemson University. Retrieved from https://tigerprints.clemson.edu/all_dissertations/2343

Chicago Manual of Style (16th Edition):

Nasrollahzadeh, Amir Ali. “Approximate Dynamic Programming: Health Care Applications.” 2019. Doctoral Dissertation, Clemson University. Accessed September 22, 2019. https://tigerprints.clemson.edu/all_dissertations/2343.

MLA Handbook (7th Edition):

Nasrollahzadeh, Amir Ali. “Approximate Dynamic Programming: Health Care Applications.” 2019. Web. 22 Sep 2019.

Vancouver:

Nasrollahzadeh AA. Approximate Dynamic Programming: Health Care Applications. [Internet] [Doctoral dissertation]. Clemson University; 2019. [cited 2019 Sep 22]. Available from: https://tigerprints.clemson.edu/all_dissertations/2343.

Council of Science Editors:

Nasrollahzadeh AA. Approximate Dynamic Programming: Health Care Applications. [Doctoral Dissertation]. Clemson University; 2019. Available from: https://tigerprints.clemson.edu/all_dissertations/2343


George Mason University

25. Woodaman, Ronald Frederick Alexander. The Wartime Portfolio Selection Problem .

Degree: 2015, George Mason University

 This thesis describes the research conducted to support the optimal selection of a portfolio of military solutions during wartime. During peacetime, the United States military… (more)

Subjects/Keywords: Operations research; Statistics; Computer science; approximate dynamic programming; dynamic stochastic knapsack problem; multi-objective decision analysis; sequential decision analysis; stochastic integer programming; stochastic optimization

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Woodaman, R. F. A. (2015). The Wartime Portfolio Selection Problem . (Thesis). George Mason University. Retrieved from http://hdl.handle.net/1920/9691

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

Woodaman, Ronald Frederick Alexander. “The Wartime Portfolio Selection Problem .” 2015. Thesis, George Mason University. Accessed September 22, 2019. http://hdl.handle.net/1920/9691.

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

MLA Handbook (7th Edition):

Woodaman, Ronald Frederick Alexander. “The Wartime Portfolio Selection Problem .” 2015. Web. 22 Sep 2019.

Vancouver:

Woodaman RFA. The Wartime Portfolio Selection Problem . [Internet] [Thesis]. George Mason University; 2015. [cited 2019 Sep 22]. Available from: http://hdl.handle.net/1920/9691.

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

Council of Science Editors:

Woodaman RFA. The Wartime Portfolio Selection Problem . [Thesis]. George Mason University; 2015. Available from: http://hdl.handle.net/1920/9691

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


Université de Montréal

26. Morin, Léonard Ryo. A dynamic sequential route choice model for micro-simulation .

Degree: 2013, Université de Montréal

 Dans les études sur le transport, les modèles de choix de route décrivent la sélection par un utilisateur d’un chemin, depuis son origine jusqu’à sa… (more)

Subjects/Keywords: Choix de route; Programmation dynamique approximée; Choix séquentiel; Attraction; Répulsion; Route choice; Approximate dynamic programming; Sequential choice; Attraction; Repulsion

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Morin, L. R. (2013). A dynamic sequential route choice model for micro-simulation . (Thesis). Université de Montréal. Retrieved from http://hdl.handle.net/1866/9829

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

Morin, Léonard Ryo. “A dynamic sequential route choice model for micro-simulation .” 2013. Thesis, Université de Montréal. Accessed September 22, 2019. http://hdl.handle.net/1866/9829.

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

MLA Handbook (7th Edition):

Morin, Léonard Ryo. “A dynamic sequential route choice model for micro-simulation .” 2013. Web. 22 Sep 2019.

Vancouver:

Morin LR. A dynamic sequential route choice model for micro-simulation . [Internet] [Thesis]. Université de Montréal; 2013. [cited 2019 Sep 22]. Available from: http://hdl.handle.net/1866/9829.

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

Council of Science Editors:

Morin LR. A dynamic sequential route choice model for micro-simulation . [Thesis]. Université de Montréal; 2013. Available from: http://hdl.handle.net/1866/9829

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


University of Western Ontario

27. Ghafouri, Behzad. Optimal Trading of a Storable Commodity via Forward Markets.

Degree: 2018, University of Western Ontario

 A commodity market participant trading via her inventory has access to both spot and forward markets. To liquidate her inventory, she can sell at the… (more)

Subjects/Keywords: Storage Real Options; Cash and Carry Arbitrage; Forward Trading; Markov Decision Process; Approximate Dynamic Programming; Least Squares Monte Carlo; Operational Research

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Ghafouri, B. (2018). Optimal Trading of a Storable Commodity via Forward Markets. (Thesis). University of Western Ontario. Retrieved from https://ir.lib.uwo.ca/etd/5394

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

Ghafouri, Behzad. “Optimal Trading of a Storable Commodity via Forward Markets.” 2018. Thesis, University of Western Ontario. Accessed September 22, 2019. https://ir.lib.uwo.ca/etd/5394.

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

MLA Handbook (7th Edition):

Ghafouri, Behzad. “Optimal Trading of a Storable Commodity via Forward Markets.” 2018. Web. 22 Sep 2019.

Vancouver:

Ghafouri B. Optimal Trading of a Storable Commodity via Forward Markets. [Internet] [Thesis]. University of Western Ontario; 2018. [cited 2019 Sep 22]. Available from: https://ir.lib.uwo.ca/etd/5394.

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

Council of Science Editors:

Ghafouri B. Optimal Trading of a Storable Commodity via Forward Markets. [Thesis]. University of Western Ontario; 2018. Available from: https://ir.lib.uwo.ca/etd/5394

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

28. Annear Camero , Luis Mauricio. An approximate dynamic approach to workforce planning in job-hops .

Degree: 2014, Universidad de los Andes

 En este documento nosotros consideramos un taller de producción con un conjunto de estaciones, cada una con un número de máquinas idénticas. Los productos tienen… (more)

Subjects/Keywords: Approximate dynamic programming; workforce planning; job-shops

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Annear Camero , L. M. (2014). An approximate dynamic approach to workforce planning in job-hops . (Thesis). Universidad de los Andes. Retrieved from http://documentodegrado.uniandes.edu.co/documentos/200710865_fecha_2014_08_15_hora_20_12_00_parte_1.pdf

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

Annear Camero , Luis Mauricio. “An approximate dynamic approach to workforce planning in job-hops .” 2014. Thesis, Universidad de los Andes. Accessed September 22, 2019. http://documentodegrado.uniandes.edu.co/documentos/200710865_fecha_2014_08_15_hora_20_12_00_parte_1.pdf.

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

MLA Handbook (7th Edition):

Annear Camero , Luis Mauricio. “An approximate dynamic approach to workforce planning in job-hops .” 2014. Web. 22 Sep 2019.

Vancouver:

Annear Camero LM. An approximate dynamic approach to workforce planning in job-hops . [Internet] [Thesis]. Universidad de los Andes; 2014. [cited 2019 Sep 22]. Available from: http://documentodegrado.uniandes.edu.co/documentos/200710865_fecha_2014_08_15_hora_20_12_00_parte_1.pdf.

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

Council of Science Editors:

Annear Camero LM. An approximate dynamic approach to workforce planning in job-hops . [Thesis]. Universidad de los Andes; 2014. Available from: http://documentodegrado.uniandes.edu.co/documentos/200710865_fecha_2014_08_15_hora_20_12_00_parte_1.pdf

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


Cornell University

29. Kunnumkal, Sumit. Approximate Dynamic Programming and Stochastic Approximation Methods for Inventory Control and Revenue Management .

Degree: 2007, Cornell University

 In this thesis, we develop approximate dynamic programming and stochastic approximation methods for problems in inventory control and revenue management. A unifying feature of the… (more)

Subjects/Keywords: Approximate dynamic programming; Stochastic approximation; Revenue management; Inventory control

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Kunnumkal, S. (2007). Approximate Dynamic Programming and Stochastic Approximation Methods for Inventory Control and Revenue Management . (Thesis). Cornell University. Retrieved from http://hdl.handle.net/1813/7615

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

Kunnumkal, Sumit. “Approximate Dynamic Programming and Stochastic Approximation Methods for Inventory Control and Revenue Management .” 2007. Thesis, Cornell University. Accessed September 22, 2019. http://hdl.handle.net/1813/7615.

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

MLA Handbook (7th Edition):

Kunnumkal, Sumit. “Approximate Dynamic Programming and Stochastic Approximation Methods for Inventory Control and Revenue Management .” 2007. Web. 22 Sep 2019.

Vancouver:

Kunnumkal S. Approximate Dynamic Programming and Stochastic Approximation Methods for Inventory Control and Revenue Management . [Internet] [Thesis]. Cornell University; 2007. [cited 2019 Sep 22]. Available from: http://hdl.handle.net/1813/7615.

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

Council of Science Editors:

Kunnumkal S. Approximate Dynamic Programming and Stochastic Approximation Methods for Inventory Control and Revenue Management . [Thesis]. Cornell University; 2007. Available from: http://hdl.handle.net/1813/7615

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


Brno University of Technology

30. Jásenský, Michal. Dynamická aproximace číslicových obvodů .

Degree: 2016, Brno University of Technology

 Tato bakalářská práce se zabývá návrhem metody postavené na kartézském genetickém programování, která umožňuje evoluční návrh obvodů schopných dynamické rekonfigurace. Cílem rekonfigurace obvodu je dynamicky … (more)

Subjects/Keywords: dynamická aproximace; číslicové obvody; přibližné počítání; kartézské genetické programování; dynamic approximation; digital circuits; approximate computing; cartesian genetic programming

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Jásenský, M. (2016). Dynamická aproximace číslicových obvodů . (Thesis). Brno University of Technology. Retrieved from http://hdl.handle.net/11012/62253

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

Jásenský, Michal. “Dynamická aproximace číslicových obvodů .” 2016. Thesis, Brno University of Technology. Accessed September 22, 2019. http://hdl.handle.net/11012/62253.

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

MLA Handbook (7th Edition):

Jásenský, Michal. “Dynamická aproximace číslicových obvodů .” 2016. Web. 22 Sep 2019.

Vancouver:

Jásenský M. Dynamická aproximace číslicových obvodů . [Internet] [Thesis]. Brno University of Technology; 2016. [cited 2019 Sep 22]. Available from: http://hdl.handle.net/11012/62253.

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

Council of Science Editors:

Jásenský M. Dynamická aproximace číslicových obvodů . [Thesis]. Brno University of Technology; 2016. Available from: http://hdl.handle.net/11012/62253

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

[1] [2] [3]

.