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 19 of 19 for “"Greedy policy"”.

  1. On the Optimality of the Greedy Policy for Battery Limited Energy Harvesting Communications

    … architecture, it is shown that the greedy policy achieves the maximum throughput if and only if the battery capacity is below a certain positive threshold that admits a precise characterization. Simple lower and upper bounds on this threshold are established. The asymptotic …

    mcmaster Repository record for On the Optimality of the Greedy Policy for Battery Limited Energy Harvesting Communications (opens in a new tab)

  2. On Linear Power Control Policies for Energy Harvesting Communications

    … communications. In the first part of the thesis, greedy policy is investigated as a special case of linear policies. The tight upper and lower bounds on the greedy threshold (c*) are provided in semi-universal settings where few parameters are known from the actual arrival distribution and clipped …

    mcmaster Repository record for On Linear Power Control Policies for Energy Harvesting Communications (opens in a new tab)

  3. Simple policies in dynamic matching markets

    … considered special cases. The performance of greedy policies – which identify a set of “acceptable” matches up front, and perform these matches as soon as possible – is compared to that of an omniscient benchmark which knows the full arrival and departure sequence. A novel family of linear …

    umn Repository record for Simple policies in dynamic matching markets (opens in a new tab)

  4. Stochastic Scheduling: Strategies for Abandonment Management

    … unknown amount of time, and we aim to design a policy that maximizes the expected total value obtained from jobs run on the server. Natural formulations of this problem suffer from the curse of dimensionality. Furthermore we show that even when the service and departure times are deterministic, …

    rice Repository record for Stochastic Scheduling: Strategies for Abandonment Management (opens in a new tab)

  5. PROBLEMS ORIGINATING FROM THE PLANNING OF AIR TRAFFIC MANAGEMENT INITIATIVES

    … a wider context. We show that a certain type of greedy policy is optimal for planning a ground delay program when no air delays are allowed. More generally, we characterize the conditions under which policies are optimal for a dynamic stochastic transportation problem. We also provide results …

    maryland Repository record for PROBLEMS ORIGINATING FROM THE PLANNING OF AIR TRAFFIC MANAGEMENT INITIATIVES (opens in a new tab)

  6. Value-Gradient Learning

    … which is valid for control problems with a greedy policy, and a general nonlinear function approximator to represent the critic. This is a non-trivial accomplishment, since most or all other related algorithms can be made to diverge under similar conditions, and new divergence proofs …

    city-london Download PDF for Value-Gradient Learning (opens in a new tab)

  7. PRESCRIPTIVE ANALYTICS WITH INTERNET OF THINGS

    … trained using the Bellman equation which uses a greedy policy for optimality. The use of DQL has shown significant improvements over past research based on cumulative reward and downtime.

    nus Repository record for PRESCRIPTIVE ANALYTICS WITH INTERNET OF THINGS (opens in a new tab) Download file for PRESCRIPTIVE ANALYTICS WITH INTERNET OF THINGS (opens in a new tab)

  8. Bounding Box Improvement with Reinforcement Learning

    … with exploitation in training using an ε-greedy policy. I find that the performance of the model is sensitive to the ε-greedy configuration used during training, performing best when the epsilon parameter is set to very low values over the course of training. With = 0.01, I find the …

    portland-state Repository record for Bounding Box Improvement with Reinforcement Learning (opens in a new tab)

  9. Minimizing age of information for semi-periodic arrivals of multiple packets

    … (RMAB) and propose an index-based scheduling policy by applying Whittle index. We also propose a new transmission strategy based on erasure codes to improve the performance of scheduling policies in lossy networks. Performance evaluation results demonstrate that our solution outperforms other …

    uvic Repository record for Minimizing age of information for semi-periodic arrivals of multiple packets (opens in a new tab)

  10. Multi-Objective Deep Reinforcement Learning for Multi-Agent Environmental Tasks using Autonomous Surface Vehicles

    … distintas duraciones de fase. Finalmente, Reward-Greedy Policy Selection evita fijar dichas duraciones de antemano y selecciona, para cada vehículo, el valor de ?más adecuado según el estado actual de la misión. El marco propuesto se evalúa mediante simulación en escenarios realistas de distintas …

    sevilla Repository record for Multi-Objective Deep Reinforcement Learning for Multi-Agent Environmental Tasks using Autonomous Surface Vehicles (opens in a new tab)

  11. Understanding uncertainty : a reinforcement learning approach for project-level pavement management systems

    … Finally, the Q-learning algorithm with an ε-greedy policy efficiently learns an optimal management policy for infrastructure assets while simultaneously incorporating several sources of uncertainty. An important advantage of this approach is that it is model-free and non-parametric, imposing …

    ubc Repository record for Understanding uncertainty : a reinforcement learning approach for project-level pavement management systems (opens in a new tab) Download PDF for Understanding uncertainty : a reinforcement learning approach for project-level pavement management systems (opens in a new tab)

  12. Prioritizing Patients for Emergency Evacuation From a Healthcare Facility

    … into the creation of a prioritization policy via dynamic programming. Dynamic programming is a problem-solving technique to recursively optimize a series of decisions. The results of the dynamic programming provide optimal prioritization policies, and these are tested with simulation …

    clemson Repository record for Prioritizing Patients for Emergency Evacuation From a Healthcare Facility (opens in a new tab)

  13. Value Function Approximation Algorithms for Reinforcement Learning in Delay-Sensitive Wireless Communications

    … aim to find the optimal transmission scheduling policy that minimizes the packet queuing delay given the available harvested energy. We formulate the problem as a Markov decision process (MDP) over a state-space spanned by the transmitter’s buffer, battery, and channel states, and analyze the …

    buffalo Repository record for Value Function Approximation Algorithms for Reinforcement Learning in Delay-Sensitive Wireless Communications (opens in a new tab)

  14. Aprendizagem por reforço profundo uma nova perspectiva sobre o problema dos k-servos

    … larger dimensions, Q-learning together with the greedy algorithm were applied to a small number of nodes separated into different clusters (hierarchical approach). The local policy obtained from each cluster, together with greedy policy, were used to form a global policy satisfactorily addressing …

    brazil-ufrn Repository record for Aprendizagem por reforço profundo uma nova perspectiva sobre o problema dos k-servos (opens in a new tab)

  15. Relaxations for the dynamic knapsack problem with stochastic item sizes

    … asymptotic analysis of MCK by comparing it to a greedy policy. Subject to certain technical conditions, we show the MCK bound is asymptotically tight under two distinct but related regimes: a fixed infinite sequence of items under increasing capacity, and where capacity and the number of items …

    gatech Repository record for Relaxations for the dynamic knapsack problem with stochastic item sizes (opens in a new tab)

  16. Practical Algorithms for Managing Uncertain Demand in Complex Systems

    … and show that for each one, a well designed policy can give close to optimal performance for either cost or profit metrics. To prove our results we use a variety of techniques from the theory of optimization and applied probability.</p><p>First, we study assemble-to-order (ATO) problems, …

    duke Repository record for Practical Algorithms for Managing Uncertain Demand in Complex Systems (opens in a new tab)

  17. Online learning for network resource allocation

    … for each arm is computationally hard. The oracle greedy strategy that plays the available arm with the highest mean reward in each time slot provides an (1 − 1/e) fraction of the optimal reward. Furthermore, when the mean rewards are not known, playing the available arm with the highest upper …

    texas Repository record for Online learning for network resource allocation (opens in a new tab)

  18. Learning from expert advice framework: Algorithms and applications

    … as a Markov decision process (MDP) and apply policy iteration to solve it. For the logarithmic loss, we prove that the optimal strategy for the adversary is the greedy policy, whereas for the absolute loss, in the $2$-experts, discounted cost setting, we prove that the optimal strategy is a …

    uiuc Repository record for Learning from expert advice framework: Algorithms and applications (opens in a new tab)

  19. Optimal admission control in tandem and parallel queueing systems with applications to computer networks

    … has size one, the structure of the optimal policy is threshold and that only two particular policies can be optimal. We provide the exact optimality thresholds for small systems. For larger systems, we formulate heuristic policies and use numerical experiments to show that these policies …

    gatech Repository record for Optimal admission control in tandem and parallel queueing systems with applications to computer networks (opens in a new tab)