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 18 of 18 for “"Dynamic programs"”.

  1. Performance Analysis in Large-Scale Stochastic Dynamic Programs

    … studies approximations to large-scale stochastic dynamic programs, with an emphasis on applications in revenue management and operations.</p><p>Many sequential decision problems from a wide variety of fields can be formulated as stochastic dynamic programs, with optimal policies characterized by …

    duke Repository record for Performance Analysis in Large-Scale Stochastic Dynamic Programs (opens in a new tab)

  2. Weakly Coupled Stochastic Dynamic Programs with Shared Signals

    … applications and can be formulated as stochastic dynamic programs (DPs), which in principal can be solved optimally through the corresponding Bellman equations. However, problems with such a structure suffer from the "curse of dimensionality," rendering a solution of the Bellman equations …

    duke Repository record for Weakly Coupled Stochastic Dynamic Programs with Shared Signals (opens in a new tab)

  3. Efficient computation in stochastic optimization and simulation: Dynamic programs, risk quantification, and risk optimization

    … optimization and simulation. First, for general dynamic programs, we propose a regression approach to solve the information relaxation dual problems by exploring the structure of the function space of dual penalties. Compared with most of the existing approaches, the proposed one is more …

    gatech Repository record for Efficient computation in stochastic optimization and simulation: Dynamic programs, risk quantification, and risk optimization (opens in a new tab)

  4. Automating the Analysis and Improvement of Dynamic Programming Algorithms with Applications to Natural Language Processing

    … system for automatically analyzing and improving dynamic programs, such as those that have driven progress in natural language processing and computer science, more generally, for decades. Finding a correct program with the optimal asymptotic runtime can be unintuitive, time-consuming, and …

    jhu Repository record for Automating the Analysis and Improvement of Dynamic Programming Algorithms with Applications to Natural Language Processing (opens in a new tab)

  5. Optimizing bioinformatics algorithms with automatic index set splitting

    … belong to the class of non-serial polyadic dynamic programs (NPDPs). NPDPs tend to admit clever optimizations in the form of index-set splitting: a technique which involves partitioning a nested loop before applying separate transformations to each partition. Unfortunately, these partitions …

    colostate Repository record for Optimizing bioinformatics algorithms with automatic index set splitting (opens in a new tab)

  6. Response-Adaptive Resource Allocation With Many Treatments

    … formulated as weakly coupled stochastic dynamic programs (DPs) that are difficult to solve as the state space grows exponentially in the number of treatments. In this dissertation, we use Lagrangian relaxation to characterize an optimal relaxed policy and its feasible version under …

    duke Repository record for Response-Adaptive Resource Allocation With Many Treatments (opens in a new tab)

  7. Waiting times for target detection models

    … to be visited, and adapts the traditional dynamic programming algorithms to this added stochastic feature. A countably infinite version of this stochastic modification is formulated. For this formulation, typical ingredients of infinite dynamic programs are explored; these include: the …

    iastate Repository record for Waiting times for target detection models (opens in a new tab)

  8. Algorithms and data structures for cache-efficient computation: theory and experimental evaluation

    … Elimination Paradigm (GEP), and problems with dynamic programming algorithms. Among graph problems we concentrate on shortest path computation, and for the computation-intensive problems in the latter two domains we also present efficient parallelizations of our cacheoblivious algorithms for …

    texas Repository record for Algorithms and data structures for cache-efficient computation: theory and experimental evaluation (opens in a new tab)

  9. Bayesian Designs For Sequential Learning Problems

    … are able to efficiently solve the corresponding dynamic programs. We develop a new value-of-information-based procedure for the problem of Bayesian optimization via simulation, which incorporates both correlated prior beliefs and correlated sampling distributions. We also introduce a sequential …

    cornell Repository record for Bayesian Designs For Sequential Learning Problems (opens in a new tab)

  10. Span-based Neural Structured Prediction

    … incompatibility of neural representations with dynamic programs from traditional structured prediction algorithms, we can leverage these rich representations to learn more accurate models while using simpler or lazier inference. We focus on algorithms that model the most basic substructure of …

    washington Repository record for Span-based Neural Structured Prediction (opens in a new tab)

  11. Efficient Algorithms for High-Dimensional Data-Driven Sequential Decision-Making

    … often boiling down to solving stochastic dynamic programs (DP). The ongoing big data revolution allows decision makers to incorporate relevant data in their decision-making processes, which in many cases leads to significant performance upgrade/revenue increase. However, such data-driven …

    cornell Repository record for Efficient Algorithms for High-Dimensional Data-Driven Sequential Decision-Making (opens in a new tab)

  12. Designing the Hardware and Software of Synthetic Hydrogel Machines Using DNA Circuits, Transcription Networks and Machine Learning Guided Algorithms

    … nodes and other regulatory elements, I created dynamic programs capable of specific behaviors such as signal propagation, oscillation, and multi- state stability. These programs may serve as the building blocks in designing functional modules to program synthetic robot behaviors. In Chapter 4 …

    jhu Repository record for Designing the Hardware and Software of Synthetic Hydrogel Machines Using DNA Circuits, Transcription Networks and Machine Learning Guided Algorithms (opens in a new tab)

  13. 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)

  14. Dynamic programming with recursive preferences

    … within the context of recursive preferences and dynamic programming. The focus is particularly on showing existence and uniqueness of recursive utility processes under stationary and non-stationary consumption growth specifications, and on solving the closely related problem of optimality of …

    anu Repository record for Dynamic programming with recursive preferences (opens in a new tab)

  15. Improving effective bandwidth through compiler enhancement of global and dynamic cache reuse

    … compile-time optimality. Locality grouping and dynamic packing: the first set of compiler-inserted and compiler-optimized computation and data transformations at run time. These optimizations have been implemented in a research compiler and evaluated on real-world applications on SGI Origin2000. …

    rice Repository record for Improving effective bandwidth through compiler enhancement of global and dynamic cache reuse (opens in a new tab)

  16. Dynamic Programming Decomposition Methods For Capacity Allocation And Network Revenue Management Problems

    … we develop decomposition-based approximate dynamic programming methods for problems in capacity allocation and network revenue management. Noting that the dynamic programming formulation of these problems suffers from the “curse of dimensionality”, we demonstrate that a set of …

    cornell Repository record for Dynamic Programming Decomposition Methods For Capacity Allocation And Network Revenue Management Problems (opens in a new tab)

  17. Multi-scale & multi-resolution experimental and analytical methods for mitigating blast risk with barrier walls

    … such as hydrocodes and computational fluid dynamic programs are often used to model airblast propagation and its impact on structures. However, in more complex environments, where blast loading in large areas of interest may occur, using high-fidelity computational modeling software could be …

    colostate Repository record for Multi-scale & multi-resolution experimental and analytical methods for mitigating blast risk with barrier walls (opens in a new tab)

  18. Systémy řízení skladových operací

    … ABB. Následuje část tvorby vlastních reportů a dynamických programů v programovacím jazyku ABAP se zaměřením na osvojení architektury systému SAP. Součástí práce je rekapitulace produktivity práce ve společnosti a hodnocení vlivu zavedení systému řízení skladových operací na vývoj efektivity …

    brno-tech Repository record for Systémy řízení skladových operací (opens in a new tab)