Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 20 of 476 for “"dynamic programming"”.

  1. Accelerating dynamic programming

    Dynamic Programming (DP) is a fundamental problem-solving technique that has been widely used for solving a broad range of search and optimization problems. While DP can be invoked when more specialized methods fail, this generality often incurs a cost in efficiency. We explore a unifying toolkit …

    mit Repository record for Accelerating dynamic programming (opens in a new tab)

  2. Approximate Dynamic Programming with Applications

    … is usually restricted to systems with slow dynamics. One reason for this is that the delay between measurement and actuation introduced by computing the control signal on-line can severely degrade systems with fast dynamics. A method to improve robustness against such delays and other …

    lund Repository record for Approximate Dynamic Programming with Applications (opens in a new tab)

  3. Studies in discrete dynamic programming

    Thesis (Sc. D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering, 1958.

    mit Repository record for Studies in discrete dynamic programming (opens in a new tab)

  4. RNA folding via algebraic dynamic programming

    … thesis is to apply the framework of Algebraic Dynamic Programming (short ADP) to a well known problem with established significance in bioinformatics, to implement the current "state of the art", and finally to go one step further and solve one of the open problems. Ab initio RNA secondary …

    bielefeld Repository record for RNA folding via algebraic dynamic programming (opens in a new tab)

  5. Dynamic Programming in Complete Separable Spaces

    Made available in DSpace on 2014-12-14T13:09:34Z (GMT). No. of bitstreams: 1 7715015.pdf: 4298340 bytes, checksum: c2079e690274847165be49296605ff35 (MD5) Previous issue date: 1977

    uiuc Repository record for Dynamic Programming in Complete Separable Spaces (opens in a new tab)

  6. Dynamic Programming meets Fine-grained Complexity

    … term was coined by Richard Bellman in the 1940s, Dynamic Programming (DP) has remained one of the most popular technique in theoretical computer science, and has found applications in a wide range of problems. In this thesis, I summarize my three recent works covering applications of DP to three …

    mit Repository record for Dynamic Programming meets Fine-grained Complexity (opens in a new tab)

  7. Multi-person tracking using dynamic programming

    Thesis (M.Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2001.

    mit Repository record for Multi-person tracking using dynamic programming (opens in a new tab)

  8. Process control: a dynamic programming approach

    … based process control model is formulated. A dynamic programming approach is used and along with the techniques of Bayesian decision theory, an optimal set of steady state control policies are shown to exist which are dependent upon prior beliefs about the condition of the process. It is the …

    vt Repository record for Process control: a dynamic programming approach (opens in a new tab)

  9. Scheduling Policy Design using Stochastic Dynamic Programming

    Scheduling policies for open soft real-time systems must be able to balance the competing concerns of meeting their objectives under exceptional conditions while achieving good performance in the average case. Balancing these concerns requires modeling strategies that represent the range of …

    wustl Repository record for Scheduling Policy Design using Stochastic Dynamic Programming (opens in a new tab)

  10. Dynamic Programming and Time-Varying Delay Systems

    … into two separate parts. The first part is about Dynamic Programming for non-trivial optimal control problems. The second part introduces some useful tools for analysis of stability and performance of systems with time-varying delays. The two papers presented in the first part attacks optimal …

    lund Repository record for Dynamic Programming and Time-Varying Delay Systems (opens in a new tab)

  11. Approximate dynamic programming for large scale systems

    … problems. These problems can be cast as dynamic programs and the optimal value function can be computed by solving Bellman's equation. However, this approach is limited in its applicability. As the number of state variables increases, the state space size grows exponentially, a phenomenon …

    columbia-diss Repository record for Approximate dynamic programming for large scale systems (opens in a new tab)

  12. Topics in Dynamic programming and Economic Networks

    Dynamic programming is a recursive method for finding optimal decision rules for sequential decision-making problems under uncertainty. It is the most fundamental tool for modern economics, addressing topics that include economic growth, optimal saving, asset pricing, business cycles, and fiscal …

    aus-cath Repository record for Topics in Dynamic programming and Economic Networks (opens in a new tab)

  13. Topics in Dynamic programming and Economic Networks

    Dynamic programming is a recursive method for finding optimal decision rules for sequential decision-making problems under uncertainty. It is the most fundamental tool for modern economics, addressing topics that include economic growth, optimal saving, asset pricing, business cycles, and fiscal …

    anu Repository record for Topics in Dynamic programming and Economic Networks (opens in a new tab)

  14. Stochastic Dynamic Programming for Optimal Reservoir Control

    … were performed to examine typical stochastic programming (SP) modeling issues for a hypothetical single reservoir system. The elements considered in these analyses include the partitions of inflow and storage states, the hydrologic characteristics of inflows, the types of system performance …

    uiuc Repository record for Stochastic Dynamic Programming for Optimal Reservoir Control (opens in a new tab)

  15. Approximate dynamic programming for some queueing problems

    Thesis (M.S.)--Massachusetts Institute of Technology, Dept. of Mechanical Engineering, 1997, and Thesis (M.S.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering, 1997.

    mit Repository record for Approximate dynamic programming for some queueing problems (opens in a new tab)

  16. Dynamic programming applied to electromagnetic satellite actuation

    … close-proximity EMFF control, where the system dynamics are quite complex. Dynamic programming has been heavily used in the optimization world, but not on embedded systems. In this thesis, dynamic programming is applied to satellite control, using close-proximity EMFF control as a case study. …

    mit Repository record for Dynamic programming applied to electromagnetic satellite actuation (opens in a new tab)

  17. Parallelization of dynamic programming recurrences in computational biology

    … novel computing platforms to accelerate dynamic programming algorithms, which are popular in bioinformatics workloads. We study algorithm-specific hardware architectures that exploit fine-grained parallelism in dynamic programming kernels using field-programmable gate arrays: FPGAs). We …

    wustl Repository record for Parallelization of dynamic programming recurrences in computational biology (opens in a new tab)

  18. Approximate Dynamic Programming with Parallel Stochastic Planning Operators

    This thesis presents an approximate dynamic programming (ADP) technique for environment modelling agents. The agent learns a set of parallel stochastic planning operators (P-SPOs) by evaluating changes in its environment in response to actions, using an association rule mining approach. An …

    city-london Repository record for Approximate Dynamic Programming with Parallel Stochastic Planning Operators (opens in a new tab)

  19. Optimal control of quantum systems using dynamic programming

    … themes 1. The theoretical underpinnings of the dynamic programming method for quantum spin systems. 2. The efficient numerical implementation of algorithms to generate optimal control laws. The use of the dynamic programming principle from optimal control theory for the control of quantum …

    aus-cath Repository record for Optimal control of quantum systems using dynamic programming (opens in a new tab)

  20. Optimal control of quantum systems using dynamic programming

    … themes 1. The theoretical underpinnings of the dynamic programming method for quantum spin systems. 2. The efficient numerical implementation of algorithms to generate optimal control laws. The use of the dynamic programming principle from optimal control theory for the control of quantum …

    anu Repository record for Optimal control of quantum systems using dynamic programming (opens in a new tab)

Page 1 of 24