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 35 for “"dynamic programming method"”.

  1. Methods of scheduling a hydro-thermal power system for optimum economy

    … made to improve upon and to compare existing methods of scheduling a hydro-thermal power system. Two methods in particular, the coordination-equations method and the incremental dynamic programming method, were investigated in detail. Numerical calculations based on these two methods were …

    ubc Repository record for Methods of scheduling a hydro-thermal power system for optimum economy (opens in a new tab) Download PDF for Methods of scheduling a hydro-thermal power system for optimum economy (opens in a new tab)

  2. Dynamic modelling of optimal pricing and trading policies under uncertainty

    … Specifically, we study three applications of dynamic planning: dynamic pricing of non-durable products in the context of Markov processes, dynamic pricing of high end fashionable products with autoregressive demand, and the dynamic trading of financial securities with added sign …

    soton Download PDF for Dynamic modelling of optimal pricing and trading policies under uncertainty (opens in a new tab)

  3. An Algorithm for the Solution of Zero-One Resource Allocation Problems

    … single constraint problem is first formulated in dynamic programming. This formulation then undergoes a number of modifications to develop the algorithm. This algorithm leads to a significant reduction in computational requirements as compared to the dynamic programming method. Three theorems and …

    mcmaster Repository record for An Algorithm for the Solution of Zero-One Resource Allocation Problems (opens in a new tab)

  4. Scheduling jobs on two uniform parallel machines to minimize the makespan

    … using pseudo-polynomial algorithms based on dynamic programming method. The pseudo-polynomial algorithm has time complexity O (n T2) and can be run on reasonable time for small number of jobs and small processing times. This optimal offline algorithm is used to benchmark the efficiency of the …

    unlv Repository record for Scheduling jobs on two uniform parallel machines to minimize the makespan (opens in a new tab) Download PDF for Scheduling jobs on two uniform parallel machines to minimize the makespan (opens in a new tab)

  5. Merton Investment Problem for the Hawkes-based Risk Model

    … is an optimal control problem and we use the dynamic programming method to derive the stochastic Hamilton-Jacobi-Bellman (SHJB) equation satisfied by the value function. The stochastic HJB equation yields a means to obtain the optimal control and thus the optimally controlled stochastic …

    calgary Repository record for Merton Investment Problem for the Hawkes-based Risk Model (opens in a new tab)

  6. Optimal profit for hotel operation

    … day. Previous endeavors have developed heuristic methods for approximating the optimal rule. Found here are the optimal rules for the cases with no reservations allowed and either a single room type or multiple room types. A Dynamic Programming method is used to generate the optimal rules. There …

    ut-knoxville Repository record for Optimal profit for hotel operation (opens in a new tab)

  7. A Grid-Based Path Planning Approach for a Two Vehicle Team with Localization Constraints

    This research proposes a path-finding method for two unmanned vehicles with localization constraints using a modified shortest-path algorithm. A beacon vehicle has GPS or other absolute positioning information, and a target vehicle has only bearing information taken relative to the beacon vehicle …

    tamu Repository record for A Grid-Based Path Planning Approach for a Two Vehicle Team with Localization Constraints (opens in a new tab)

  8. Optimum aircraft weapons selection and sequential firing strategy for targets of opportunity

    … targets within the target area which lead to a dynamic programming formulation of the decision problem. This yields a system of ordinary differential equations which are solvable recursively. In addition to the dynamic programming model, a sub-optimum determination of a 'best load' is discussed. …

    nps Repository record for Optimum aircraft weapons selection and sequential firing strategy for targets of opportunity (opens in a new tab)

  9. Numerical optimization of recursive systems of equations with an application to optimal swine genetic selection

    <p>A new dynamic programming method is developed for numerical optimization of recursive systems of equations, in which continuous choice variables determine the allowed choices in subsequent stages of the problem. The method works by dynamically creating bubbles, or subspaces, of the total search …

    iastate Repository record for Numerical optimization of recursive systems of equations with an application to optimal swine genetic selection (opens in a new tab)

  10. Template-based sketch recognition using Hidden Markov Models

    … can be recognized and identified. We provide a method to recognize objects in sketches by casting the problem in terms of searching for known 2D template shapes in the sketch. The template is defined as an ordered polyline and the recognition requires searching for a similarly-shaped sequential …

    ubc Repository record for Template-based sketch recognition using Hidden Markov Models (opens in a new tab) Download PDF for Template-based sketch recognition using Hidden Markov Models (opens in a new tab)

  11. Chebyshev approximation by piecewise continuous functions

    … than minimize a function. Results obtained by a dynamic programming method using a digital computer (IBM 7090) are used for illustration.

    bu Repository record for Chebyshev approximation by piecewise continuous functions (opens in a new tab) Embargoed until 2999-01-01

  12. Adaptive Dynamic Programming in a Subspace for Some Discrete-Time Vehicle Systems

    … Because their working environments are highly dynamic or unknown, autonomous vehicles need to make decisions and react to their changing environments at every time instance. This decision-making problem can be solved using constrained optimal control methods. However, solving such problems in …

    ucf Repository record for Adaptive Dynamic Programming in a Subspace for Some Discrete-Time Vehicle Systems (opens in a new tab)

  13. Extraction of Contextual Knowledge and Ambiguity Handling for Ontology in Virtual Environment

    … The dissertation suggests two construction methodologies. The first method generates a scene structure from a 2D image. Unlike other scene understanding techniques, the suggested method generates scene ontology without prior knowledge and human intervention. As an intermediate process, a new …

    tamu Repository record for Extraction of Contextual Knowledge and Ambiguity Handling for Ontology in Virtual Environment (opens in a new tab)

  14. Automatic segmentation of continuous speech

    … The whole spoken sentence is matched using a dynamic programming approach, and only when the best match has been found is the sentence segmented, and the user presented with a visual representation of his speech. Since the dynamic programming method optimises the match, the segmentation too is …

    city-london Download PDF for Automatic segmentation of continuous speech (opens in a new tab)

  15. A linear dynamic programming approach to modeling the effects of producer interaction on optimal groundwater use in the southern high plains of Texas

    … for a common groundwater supply. A linear dynamic programming method (LDP) is applied to derive optimal intertemporal use of the stock resource and long-term cropping plans. First parametric linear programming (PLP) is used to maximize periodic profits subject to specified values of state …

    ttu Repository record for A linear dynamic programming approach to modeling the effects of producer interaction on optimal groundwater use in the southern high plains of Texas (opens in a new tab)

  16. Designing a robust supply chain network against disruptions

    … in the model and (1) a two-stage stochastic programming model; (2) a multi-objective stochastic programming model; and (3) a dynamic programming model are developed to explore the tradeoffs between cost and risk. Three methods are developed to identify optimal and robust solutions: an integer …

    missouri Repository record for Designing a robust supply chain network against disruptions (opens in a new tab)

  17. Large-Scale Optimization for Deep Neural Network Architecture: A Dynamical System Theory Perspective

    … This thesis delves into large-scale optimization methods that are not only aware of but also leverage the underlying deep architectural structures being optimized. Specifically, we demonstrate that the dynamical system and optimal control theory pave a profound foundation for algorithmic …

    gatech Repository record for Large-Scale Optimization for Deep Neural Network Architecture: A Dynamical System Theory Perspective (opens in a new tab)

  18. Simulation and Optimization of Wind Farm Operations under Stochastic Conditions

    This dissertation develops a new methodology and associated solution tools to achieve optimal operations and maintenance strategies for wind turbines, helping reduce operational costs and enhance the marketability of wind generation. The integrated framework proposed includes two optimization …

    tamu Repository record for Simulation and Optimization of Wind Farm Operations under Stochastic Conditions (opens in a new tab)

  19. Adaptive remote visualization system with optimized network performance for large scale scientific data

    … rendering, and display into groups, and dynamically assign them to appropriate network nodes to achieve minimal total delay for post-processing or maximal frame rate for streaming applications. We propose polynomial-time algorithms using the dynamic programming method to compute the …

    lsu-thes Repository record for Adaptive remote visualization system with optimized network performance for large scale scientific data (opens in a new tab)

Page 1 of 2