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 78 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: 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 10, 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. 10 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 10]. 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


Delft University of Technology

2. Snoeij, V. (author). Emergency Trajectory Management for Transport Aircraft.

Degree: 2016, Delft University of Technology

Over the years gradually flight management systems have been added to airplanes which reduce pilot workload and increase safety. These systems however do not provide… (more)

Subjects/Keywords: Emergeny Trajectory Planner; Approximate Dynamic Programming

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Snoeij, V. (. (2016). Emergency Trajectory Management for Transport Aircraft. (Masters Thesis). Delft University of Technology. Retrieved from http://resolver.tudelft.nl/uuid:b68ac652-edcc-43ac-8bc0-bbba4113e047

Chicago Manual of Style (16th Edition):

Snoeij, V (author). “Emergency Trajectory Management for Transport Aircraft.” 2016. Masters Thesis, Delft University of Technology. Accessed April 10, 2021. http://resolver.tudelft.nl/uuid:b68ac652-edcc-43ac-8bc0-bbba4113e047.

MLA Handbook (7th Edition):

Snoeij, V (author). “Emergency Trajectory Management for Transport Aircraft.” 2016. Web. 10 Apr 2021.

Vancouver:

Snoeij V(. Emergency Trajectory Management for Transport Aircraft. [Internet] [Masters thesis]. Delft University of Technology; 2016. [cited 2021 Apr 10]. Available from: http://resolver.tudelft.nl/uuid:b68ac652-edcc-43ac-8bc0-bbba4113e047.

Council of Science Editors:

Snoeij V(. Emergency Trajectory Management for Transport Aircraft. [Masters Thesis]. Delft University of Technology; 2016. Available from: http://resolver.tudelft.nl/uuid:b68ac652-edcc-43ac-8bc0-bbba4113e047


University of Edinburgh

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

Degree: PhD, 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 April 10, 2021. http://hdl.handle.net/1842/5883.

MLA Handbook (7th Edition):

Yang, Xinan. “Top-percentile traffic routing problem.” 2012. Web. 10 Apr 2021.

Vancouver:

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

4. 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 10, 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. 10 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 10]. 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


Cornell University

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

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

Chicago Manual of Style (16th Edition):

Maxwell, Matthew. “Approximate Dynamic Programming Policies And Performance Bounds For Ambulance Redeployment.” 2011. Doctoral Dissertation, Cornell University. Accessed April 10, 2021. http://hdl.handle.net/1813/29425.

MLA Handbook (7th Edition):

Maxwell, Matthew. “Approximate Dynamic Programming Policies And Performance Bounds For Ambulance Redeployment.” 2011. Web. 10 Apr 2021.

Vancouver:

Maxwell M. Approximate Dynamic Programming Policies And Performance Bounds For Ambulance Redeployment. [Internet] [Doctoral dissertation]. Cornell University; 2011. [cited 2021 Apr 10]. Available from: http://hdl.handle.net/1813/29425.

Council of Science Editors:

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


Cornell University

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

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

Chicago Manual of Style (16th Edition):

Stasko, Timon. “Parallel Real Asset Management With Environmental Regulation: Integer Programming And Approximate Dynamic Programming Approaches.” 2011. Doctoral Dissertation, Cornell University. Accessed April 10, 2021. http://hdl.handle.net/1813/30732.

MLA Handbook (7th Edition):

Stasko, Timon. “Parallel Real Asset Management With Environmental Regulation: Integer Programming And Approximate Dynamic Programming Approaches.” 2011. Web. 10 Apr 2021.

Vancouver:

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

Council of Science Editors:

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


Cornell University

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

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

Chicago Manual of Style (16th Edition):

Chan, Collin. “Decomposition Methods For Managing Service Parts With Coupled Demands.” 2012. Doctoral Dissertation, Cornell University. Accessed April 10, 2021. http://hdl.handle.net/1813/31002.

MLA Handbook (7th Edition):

Chan, Collin. “Decomposition Methods For Managing Service Parts With Coupled Demands.” 2012. Web. 10 Apr 2021.

Vancouver:

Chan C. Decomposition Methods For Managing Service Parts With Coupled Demands. [Internet] [Doctoral dissertation]. Cornell University; 2012. [cited 2021 Apr 10]. Available from: http://hdl.handle.net/1813/31002.

Council of Science Editors:

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


University of Ottawa

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

Vancouver:

Astaraky D. A Simulation Based Approximate Dynamic Programming Approach to Multi-class, Multi-resource Surgical Scheduling . [Internet] [Thesis]. University of Ottawa; 2013. [cited 2021 Apr 10]. 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

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

Vancouver:

Southerland J. USING APPROXIMATE DYNAMIC PROGRAMMING TO ADAPT A MILITARY FORCE MIX . [Internet] [Thesis]. George Mason University; 2017. [cited 2021 Apr 10]. 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


University of New South Wales

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

Vancouver:

Le TM. An adaptive signal-vehicle cooperative control system. [Internet] [Doctoral dissertation]. University of New South Wales; 2013. [cited 2021 Apr 10]. 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


Princeton University

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

Vancouver:

Jiang DR. Risk-Neutral and Risk-Averse Approximate Dynamic Programming Methods . [Internet] [Doctoral dissertation]. Princeton University; 2016. [cited 2021 Apr 10]. 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 Texas – Austin

12. Gurfein, Kate Elizabeth. Evaluation of basis functions for generating approximate linear programming (ALP) average cost solutions and policies for multiclass queueing networks.

Degree: MSin Engineering, Operations Research & Industrial Engineering, 2012, University of Texas – Austin

 The average cost of operating a queueing network depends on several factors such as the complexity of the network and the service policy used. Approximate(more)

Subjects/Keywords: Approximate linear programming; ALP; Multiclass queueing networks; Dynamic programming; Optimal policy; Optimality gap

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Gurfein, K. E. (2012). Evaluation of basis functions for generating approximate linear programming (ALP) average cost solutions and policies for multiclass queueing networks. (Masters Thesis). University of Texas – Austin. Retrieved from http://hdl.handle.net/2152/ETD-UT-2012-05-5441

Chicago Manual of Style (16th Edition):

Gurfein, Kate Elizabeth. “Evaluation of basis functions for generating approximate linear programming (ALP) average cost solutions and policies for multiclass queueing networks.” 2012. Masters Thesis, University of Texas – Austin. Accessed April 10, 2021. http://hdl.handle.net/2152/ETD-UT-2012-05-5441.

MLA Handbook (7th Edition):

Gurfein, Kate Elizabeth. “Evaluation of basis functions for generating approximate linear programming (ALP) average cost solutions and policies for multiclass queueing networks.” 2012. Web. 10 Apr 2021.

Vancouver:

Gurfein KE. Evaluation of basis functions for generating approximate linear programming (ALP) average cost solutions and policies for multiclass queueing networks. [Internet] [Masters thesis]. University of Texas – Austin; 2012. [cited 2021 Apr 10]. Available from: http://hdl.handle.net/2152/ETD-UT-2012-05-5441.

Council of Science Editors:

Gurfein KE. Evaluation of basis functions for generating approximate linear programming (ALP) average cost solutions and policies for multiclass queueing networks. [Masters Thesis]. University of Texas – Austin; 2012. Available from: http://hdl.handle.net/2152/ETD-UT-2012-05-5441


University of Oxford

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

Vancouver:

Stellato B. Mixed-integer optimal control of fast dynamical systems. [Internet] [Doctoral dissertation]. University of Oxford; 2017. [cited 2021 Apr 10]. 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

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

Vancouver:

Medury A. Incorporating Network Considerations into System-level Pavement Management Systems. [Internet] [Thesis]. University of California – Berkeley; 2013. [cited 2021 Apr 10]. 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


Princeton University

15. Durante, Joseph Lawrence. Stochastic Dual Dynamic Programming and Backward Approximate Dynamic Programming with Integrated Crossing State Stochastic Models for Wind Power in Energy Storage Optimization .

Degree: PhD, 2020, Princeton University

 This dissertation brings to light the importance of stochastic models that accurately capture the crossing times of stochastic processes. A crossing time is a contiguous… (more)

Subjects/Keywords: Backward Approximate Dynamic Programming; Crossing State Stochastic Model; Energy Storage Optimization; Risk-Directed Importance Sampling; Stochastic Dual Dynamic Programming

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Durante, J. L. (2020). Stochastic Dual Dynamic Programming and Backward Approximate Dynamic Programming with Integrated Crossing State Stochastic Models for Wind Power in Energy Storage Optimization . (Doctoral Dissertation). Princeton University. Retrieved from http://arks.princeton.edu/ark:/88435/dsp013x816q57c

Chicago Manual of Style (16th Edition):

Durante, Joseph Lawrence. “Stochastic Dual Dynamic Programming and Backward Approximate Dynamic Programming with Integrated Crossing State Stochastic Models for Wind Power in Energy Storage Optimization .” 2020. Doctoral Dissertation, Princeton University. Accessed April 10, 2021. http://arks.princeton.edu/ark:/88435/dsp013x816q57c.

MLA Handbook (7th Edition):

Durante, Joseph Lawrence. “Stochastic Dual Dynamic Programming and Backward Approximate Dynamic Programming with Integrated Crossing State Stochastic Models for Wind Power in Energy Storage Optimization .” 2020. Web. 10 Apr 2021.

Vancouver:

Durante JL. Stochastic Dual Dynamic Programming and Backward Approximate Dynamic Programming with Integrated Crossing State Stochastic Models for Wind Power in Energy Storage Optimization . [Internet] [Doctoral dissertation]. Princeton University; 2020. [cited 2021 Apr 10]. Available from: http://arks.princeton.edu/ark:/88435/dsp013x816q57c.

Council of Science Editors:

Durante JL. Stochastic Dual Dynamic Programming and Backward Approximate Dynamic Programming with Integrated Crossing State Stochastic Models for Wind Power in Energy Storage Optimization . [Doctoral Dissertation]. Princeton University; 2020. Available from: http://arks.princeton.edu/ark:/88435/dsp013x816q57c


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

Vancouver:

Keerthisinghe C. Fast Solution Techniques for Energy Management in Smart Homes . [Internet] [Thesis]. University of Sydney; 2016. [cited 2021 Apr 10]. 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


Vrije Universiteit Amsterdam

17. 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 April 10, 2021. http://hdl.handle.net/1871/16056.

MLA Handbook (7th Edition):

Roubos, D. “The application of Approximate Dynamic Programming techniques .” 2010. Web. 10 Apr 2021.

Vancouver:

Roubos D. The application of Approximate Dynamic Programming techniques . [Internet] [Doctoral dissertation]. Vrije Universiteit Amsterdam; 2010. [cited 2021 Apr 10]. 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

18. 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 April 10, 2021. https://ir.uiowa.edu/etd/2052.

MLA Handbook (7th Edition):

Cakir, Fahrettin. “Data-centric solution methodologies for vehicle routing problems.” 2016. Web. 10 Apr 2021.

Vancouver:

Cakir F. Data-centric solution methodologies for vehicle routing problems. [Internet] [Doctoral dissertation]. University of Iowa; 2016. [cited 2021 Apr 10]. 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

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

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 2021 Apr 10]. 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


Georgia Tech

20. Baubaid, Ahmad Ali. Advances in Tactical & Operational Planning for Less-than-Truckload Carriers.

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

 This thesis explores tactical and operational planning problems in the context of the Less-than-Truckload (LTL) industry. LTL carriers transport shipments that occupy a small fraction… (more)

Subjects/Keywords: Freight transportation; Less-than-truckload; Load planning; Approximate Dynamic Programming; Value function approximation

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Baubaid, A. A. (2020). Advances in Tactical & Operational Planning for Less-than-Truckload Carriers. (Doctoral Dissertation). Georgia Tech. Retrieved from http://hdl.handle.net/1853/64160

Chicago Manual of Style (16th Edition):

Baubaid, Ahmad Ali. “Advances in Tactical & Operational Planning for Less-than-Truckload Carriers.” 2020. Doctoral Dissertation, Georgia Tech. Accessed April 10, 2021. http://hdl.handle.net/1853/64160.

MLA Handbook (7th Edition):

Baubaid, Ahmad Ali. “Advances in Tactical & Operational Planning for Less-than-Truckload Carriers.” 2020. Web. 10 Apr 2021.

Vancouver:

Baubaid AA. Advances in Tactical & Operational Planning for Less-than-Truckload Carriers. [Internet] [Doctoral dissertation]. Georgia Tech; 2020. [cited 2021 Apr 10]. Available from: http://hdl.handle.net/1853/64160.

Council of Science Editors:

Baubaid AA. Advances in Tactical & Operational Planning for Less-than-Truckload Carriers. [Doctoral Dissertation]. Georgia Tech; 2020. Available from: http://hdl.handle.net/1853/64160


Kansas State University

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

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 2021 Apr 10]. 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

22. 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 April 10, 2021. https://tigerprints.clemson.edu/all_dissertations/2343.

MLA Handbook (7th Edition):

Nasrollahzadeh, Amir Ali. “Approximate Dynamic Programming: Health Care Applications.” 2019. Web. 10 Apr 2021.

Vancouver:

Nasrollahzadeh AA. Approximate Dynamic Programming: Health Care Applications. [Internet] [Doctoral dissertation]. Clemson University; 2019. [cited 2021 Apr 10]. 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


Universitat Politècnica de València

23. Díaz Iza, Henry Paúl. Value Function Estimation in Optimal Control via Takagi-Sugeno Models and Linear Programming .

Degree: 2020, Universitat Politècnica de València

 [ES] La presente Tesis emplea técnicas de programación dinámica y aprendizaje por refuerzo para el control de sistemas no lineales en espacios discretos y continuos.… (more)

Subjects/Keywords: Optimal control; Linear programming; Approximate dynamic programming; Control applications; Neural networks; Adaptive dynamic programming fitted Q function; Reinforcement learning; Takagi-Sugeno; Linear matrix inequality; Intelligent control

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Díaz Iza, H. P. (2020). Value Function Estimation in Optimal Control via Takagi-Sugeno Models and Linear Programming . (Doctoral Dissertation). Universitat Politècnica de València. Retrieved from http://hdl.handle.net/10251/139135

Chicago Manual of Style (16th Edition):

Díaz Iza, Henry Paúl. “Value Function Estimation in Optimal Control via Takagi-Sugeno Models and Linear Programming .” 2020. Doctoral Dissertation, Universitat Politècnica de València. Accessed April 10, 2021. http://hdl.handle.net/10251/139135.

MLA Handbook (7th Edition):

Díaz Iza, Henry Paúl. “Value Function Estimation in Optimal Control via Takagi-Sugeno Models and Linear Programming .” 2020. Web. 10 Apr 2021.

Vancouver:

Díaz Iza HP. Value Function Estimation in Optimal Control via Takagi-Sugeno Models and Linear Programming . [Internet] [Doctoral dissertation]. Universitat Politècnica de València; 2020. [cited 2021 Apr 10]. Available from: http://hdl.handle.net/10251/139135.

Council of Science Editors:

Díaz Iza HP. Value Function Estimation in Optimal Control via Takagi-Sugeno Models and Linear Programming . [Doctoral Dissertation]. Universitat Politècnica de València; 2020. Available from: http://hdl.handle.net/10251/139135


George Mason University

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

Vancouver:

Woodaman RFA. The Wartime Portfolio Selection Problem . [Internet] [Thesis]. George Mason University; 2015. [cited 2021 Apr 10]. 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


Cornell University

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

Vancouver:

Kunnumkal S. Approximate Dynamic Programming and Stochastic Approximation Methods for Inventory Control and Revenue Management. [Internet] [Thesis]. Cornell University; 2007. [cited 2021 Apr 10]. 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

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

Vancouver:

Annear Camero LM. An approximate dynamic approach to workforce planning in job-hops . [Internet] [Thesis]. Universidad de los Andes; 2014. [cited 2021 Apr 10]. 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


Brno University of Technology

27. Jásenský, Michal. Dynamická aproximace číslicových obvodů: Dynamic Approximation of Digital Circuits.

Degree: 2018, Brno University of Technology

 This bachelor's thesis deals with design of a method based on cartesian genetic programming, which allows the evolutionary design of circuits capable of dynamic reconfiguration.… (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. (2018). Dynamická aproximace číslicových obvodů: Dynamic Approximation of Digital Circuits. (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ů: Dynamic Approximation of Digital Circuits.” 2018. Thesis, Brno University of Technology. Accessed April 10, 2021. 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ů: Dynamic Approximation of Digital Circuits.” 2018. Web. 10 Apr 2021.

Vancouver:

Jásenský M. Dynamická aproximace číslicových obvodů: Dynamic Approximation of Digital Circuits. [Internet] [Thesis]. Brno University of Technology; 2018. [cited 2021 Apr 10]. 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ů: Dynamic Approximation of Digital Circuits. [Thesis]. Brno University of Technology; 2018. 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


Northeastern University

28. Ulusan, Aybike. Optimizing Post-disruption Response And Recovery Operations To Improve Resilience Of Critical Infrastructure Systems.

Degree: PhD, Department of Mechanical and Industrial Engineering, 2019, Northeastern University

 Critical infrastructure systems (CIS) underpin almost every aspect of the modern society by providing the essential functions through overlaying service networks. In the case of… (more)

Subjects/Keywords: approximate dynamic programming; critical infrastructure systems; game design; humanitarian logistics; network optimization; post-disaster recovery; Operations research; Industrial engineering

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Ulusan, A. (2019). Optimizing Post-disruption Response And Recovery Operations To Improve Resilience Of Critical Infrastructure Systems. (Doctoral Dissertation). Northeastern University. Retrieved from http://hdl.handle.net/2047/D20324048

Chicago Manual of Style (16th Edition):

Ulusan, Aybike. “Optimizing Post-disruption Response And Recovery Operations To Improve Resilience Of Critical Infrastructure Systems.” 2019. Doctoral Dissertation, Northeastern University. Accessed April 10, 2021. http://hdl.handle.net/2047/D20324048.

MLA Handbook (7th Edition):

Ulusan, Aybike. “Optimizing Post-disruption Response And Recovery Operations To Improve Resilience Of Critical Infrastructure Systems.” 2019. Web. 10 Apr 2021.

Vancouver:

Ulusan A. Optimizing Post-disruption Response And Recovery Operations To Improve Resilience Of Critical Infrastructure Systems. [Internet] [Doctoral dissertation]. Northeastern University; 2019. [cited 2021 Apr 10]. Available from: http://hdl.handle.net/2047/D20324048.

Council of Science Editors:

Ulusan A. Optimizing Post-disruption Response And Recovery Operations To Improve Resilience Of Critical Infrastructure Systems. [Doctoral Dissertation]. Northeastern University; 2019. Available from: http://hdl.handle.net/2047/D20324048


Delft University of Technology

29. Konatala, Ramesh (author). Design of Reinforcement Learning based Incremental Flight Control Laws for the Cessna Citation II(PH-LAB) Aircraft.

Degree: 2020, Delft University of Technology

Online Adaptive Flight Control is interesting in the context of growing complexity of aircraft systems and their adaptability requirements to ensure safety. An Incremental Approximate(more)

Subjects/Keywords: Reinforcement Learning; Intelligent Flight Control; Flight Control Systems; Machine Learning; Adaptive Flight Control; Incremental Control; Incremental Approximate Dynamic Programming

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Konatala, R. (. (2020). Design of Reinforcement Learning based Incremental Flight Control Laws for the Cessna Citation II(PH-LAB) Aircraft. (Masters Thesis). Delft University of Technology. Retrieved from http://resolver.tudelft.nl/uuid:fb731f87-8124-4c6b-b756-1723a6cae80f

Chicago Manual of Style (16th Edition):

Konatala, Ramesh (author). “Design of Reinforcement Learning based Incremental Flight Control Laws for the Cessna Citation II(PH-LAB) Aircraft.” 2020. Masters Thesis, Delft University of Technology. Accessed April 10, 2021. http://resolver.tudelft.nl/uuid:fb731f87-8124-4c6b-b756-1723a6cae80f.

MLA Handbook (7th Edition):

Konatala, Ramesh (author). “Design of Reinforcement Learning based Incremental Flight Control Laws for the Cessna Citation II(PH-LAB) Aircraft.” 2020. Web. 10 Apr 2021.

Vancouver:

Konatala R(. Design of Reinforcement Learning based Incremental Flight Control Laws for the Cessna Citation II(PH-LAB) Aircraft. [Internet] [Masters thesis]. Delft University of Technology; 2020. [cited 2021 Apr 10]. Available from: http://resolver.tudelft.nl/uuid:fb731f87-8124-4c6b-b756-1723a6cae80f.

Council of Science Editors:

Konatala R(. Design of Reinforcement Learning based Incremental Flight Control Laws for the Cessna Citation II(PH-LAB) Aircraft. [Masters Thesis]. Delft University of Technology; 2020. Available from: http://resolver.tudelft.nl/uuid:fb731f87-8124-4c6b-b756-1723a6cae80f


Indian Institute of Science

30. Lakshminarayanan, Chandrashekar. Approximate Dynamic Programming and Reinforcement Learning - Algorithms, Analysis and an Application.

Degree: PhD, Faculty of Engineering, 2018, Indian Institute of Science

 Problems involving optimal sequential making in uncertain dynamic systems arise in domains such as engineering, science and economics. Such problems can often be cast in… (more)

Subjects/Keywords: Dynamic Programming (DP); Reinforcement Learning - Machine Learning; Markov Decision Process (MDP); Bellman Equation CBE; Machine Learning; Bellman Operator; Crowdsourcing; Approximate Linear Programming (ALP); Reinforcement Learning; Stochastic Approximation; Approximate Dynamic Programming (ADP); Approximate Linear Program; Linear Function Approximation (LFA); Reduced Linear Program (RLP); Generalized Reduced Linear Program (GRLP); Crowd Sourcing; Computer Science and Automation

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Lakshminarayanan, C. (2018). Approximate Dynamic Programming and Reinforcement Learning - Algorithms, Analysis and an Application. (Doctoral Dissertation). Indian Institute of Science. Retrieved from http://etd.iisc.ac.in/handle/2005/3963

Chicago Manual of Style (16th Edition):

Lakshminarayanan, Chandrashekar. “Approximate Dynamic Programming and Reinforcement Learning - Algorithms, Analysis and an Application.” 2018. Doctoral Dissertation, Indian Institute of Science. Accessed April 10, 2021. http://etd.iisc.ac.in/handle/2005/3963.

MLA Handbook (7th Edition):

Lakshminarayanan, Chandrashekar. “Approximate Dynamic Programming and Reinforcement Learning - Algorithms, Analysis and an Application.” 2018. Web. 10 Apr 2021.

Vancouver:

Lakshminarayanan C. Approximate Dynamic Programming and Reinforcement Learning - Algorithms, Analysis and an Application. [Internet] [Doctoral dissertation]. Indian Institute of Science; 2018. [cited 2021 Apr 10]. Available from: http://etd.iisc.ac.in/handle/2005/3963.

Council of Science Editors:

Lakshminarayanan C. Approximate Dynamic Programming and Reinforcement Learning - Algorithms, Analysis and an Application. [Doctoral Dissertation]. Indian Institute of Science; 2018. Available from: http://etd.iisc.ac.in/handle/2005/3963

[1] [2] [3]

.