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 31 for “"offline algorithms"”.

  1. Online and offline algorithms for circuit switch scheduling

    … during which no data can be transmitted. For the offline version of the problem, we present an almost (1- 1/e) approximation ratio. Since the natural linear programming relaxation for the problem has an unbounded integrality gap, we adopt a hybrid approach that combines the combinatorial greedy …

    gatech Repository record for Online and offline algorithms for circuit switch scheduling (opens in a new tab)

  2. Online Algorithms and Optimal Offline Algorithms for Dynamic Optimal Power Flow

    … computationally efficient to solve. An optimal offline optimization algorithm is designed for DOPF by solving the SDP and then recovering an optimal offline solution to DOPF. Addressing the dynamic nature of DOPF, our work further proposes the first online algorithm for DOPF. Partially motivated …

    calgary Repository record for Online Algorithms and Optimal Offline Algorithms for Dynamic Optimal Power Flow (opens in a new tab)

  3. Online scheduling of periodic lightpath request with flexibility

    Lightpath scheduling algorithms are the algorithms that assign wavelengths and time periods to lightpaths [4] [5]. There are two types of scheduling algorithms: online scheduling algorithms and offline scheduling algorithms. For online scheduling algorithms, lightpath requests arrive one at a time. …

    hawaii Repository record for Online scheduling of periodic lightpath request with flexibility (opens in a new tab)

  4. Bandit learning with non-linear rewards: Submodularity and beyond

    … presenting a general framework for adapting offline algorithms to CMAB problems, applying them to ($k$-)submodular maximization problems under multiple settings by analyzing the robustness of the corresponding offline algorithm; and proposing gradient ascent algorithms for online monotone …

    iastate Repository record for Bandit learning with non-linear rewards: Submodularity and beyond (opens in a new tab)

  5. Leveraging offline data for safe and efficient autonomous navigation in multi-agent environments

    … collision avoidance into a single-agent offline reinforcement learning problem, where learning algorithms utilize pre-collected training data. Additionally, this work explores different dynamic state embeddings and evaluates performance in the offline setting. We trained several novel …

    iastate Repository record for Leveraging offline data for safe and efficient autonomous navigation in multi-agent environments (opens in a new tab)

  6. Online algorithms for content caching: an economic perspective

    … (QoE). The current literature either proposes offline algorithms that have complete knowledge of the request profile a priori, or proposes heuristics without provable performance. In this dissertation, online algorithms are presented for content caching in three different network settings: the …

    njit Repository record for Online algorithms for content caching: an economic perspective (opens in a new tab)

  7. Macro SOStream: um algoritmo evolutivo para agrupamento autoorganizado baseado em densidade

    … industrial monitoring, can make the usability of offline algorithms for machine learning infeasible. That is due to the need for data storage, infinite growth of data generation, and memory restrictions, making models impossible to redesign and retrain. As a consequence of that, algorithms that …

    brazil-ufrn Repository record for Macro SOStream: um algoritmo evolutivo para agrupamento autoorganizado baseado em densidade (opens in a new tab)

  8. On energy-efficient broadcasts

    … and the multi-page case. After presenting offline algorithms that compute an optimal sequence of broadcasts in polynomial time, we lower bound the achievable competitive ratio for the online version by providing worst-case instances. We point out that the obtained lower bounds hold for …

    freiburg-diss Repository record for On energy-efficient broadcasts (opens in a new tab)

  9. Asymptotic Worst-Case Analyses for the Open Bin Packing Problem

    … the OBPP is NP-hard and propose two heuristic algorithms instead of solving the problem to optimality. We propose two offline algorithms in which the information of the items is known in advance. First, we consider the First Fit Decreasing (FFD) which is a good approximation algorithm for the …

    vt Repository record for Asymptotic Worst-Case Analyses for the Open Bin Packing Problem (opens in a new tab)

  10. Geometric Approximation Algorithms in the Online and Data Stream Models

    … input items arrive one at a time, and the algorithms must decide based on the partial data received so far, without any secure information about the data that will arrive in the future. In this thesis, we investigate efficient algorithms for a number of fundamental geometric optimization …

    waterloo Repository record for Geometric Approximation Algorithms in the Online and Data Stream Models (opens in a new tab)

  11. On Algorithms for Multidimensional Packing Problems and on the Complexity of higher dimensional Knapsack

    … Instead we receive informations over time and algorithms have to handle not only the given instance at a specific time, but also the lack of information and an unknown future. We consider a slightly relaxed setting where the solution we generate is not fixed but can be altered. We do not allow …

    cau-kiel Repository record for On Algorithms for Multidimensional Packing Problems and on the Complexity of higher dimensional Knapsack (opens in a new tab)

  12. Learning-based crop management optimization using multi-stream convolutional neural networks

    … presents a class of learning-based optimization algorithms for spatial allocation of crop inputs, and a new framework for online coverage path planning with potential use in tasks such as planting and harvesting. The proposed algorithms use Multi-stream Convolutional Neural Networks (MSCNN) to …

    uiuc Repository record for Learning-based crop management optimization using multi-stream convolutional neural networks (opens in a new tab)

  13. Social computing for personalization and credible information mining using probabilistic graphical models

    … variables, and develop efficient computation algorithms that exploit the graph structure to solve the problems. In recommender systems, we propose probabilistic graphical models for Collaborative Filtering (CF) algorithms in various problem settings, and solve them using Belief Propagation …

    gatech Repository record for Social computing for personalization and credible information mining using probabilistic graphical models (opens in a new tab)

  14. On User Privacy In Personalized Mobile Services

    … correlations in the stream. • We also present offline algorithms that aggregate user contexts and activities. For example, we can count how many users in a specific context clicked on some ad. This implicit user feedback can be used to update how the personalization is done in the online …

    cornell Repository record for On User Privacy In Personalized Mobile Services (opens in a new tab)

  15. Resource allocation in cooperative and heterogeneous wireless networks with energy harvesting

    … the ``doubly near-far" problem. We propose algorithms to jointly optimize resource allocation for downlink energy harvesting and uplink information transmission in uplink WPC network with relay-based and user-based cooperation. Our algorithms improve throughput performance of user equipments …

    ubc Repository record for Resource allocation in cooperative and heterogeneous wireless networks with energy harvesting (opens in a new tab) Download PDF for Resource allocation in cooperative and heterogeneous wireless networks with energy harvesting (opens in a new tab)

  16. Tailoring traditional optimizations for runtime compilation

    … compilation time. The literature on traditional, offline compilers describes numerous program transformation techniques that strive to increase execution efficiency. However, while optimization passes for static compilers are well understood and have been thoroughly investigated, many such …

    rice Repository record for Tailoring traditional optimizations for runtime compilation (opens in a new tab)

  17. Interactive Change Point Detection Approaches in Time-Series

    … increase in size, where unsupervised detection algorithms can help users process data. This is of importance for datasets where multiple phases are present and need to be separated in order to be compared. To detect change points, a number of unsupervised algorithms have been developed which are …

    chalmers Repository record for Interactive Change Point Detection Approaches in Time-Series (opens in a new tab)

  18. Calibration of IMUs using Neural Networks and Adaptive Techniques: Targeting a Self-Calibrated IMU

    … operation. The most commonly used calibration algorithms today use linear sensor models although the characteristics of the sensor are often argued to be nonlinear. The thesis contains an investigation of whether neural networks efficiently can be used for nonlinear sensor model approximation. …

    chalmers Repository record for Calibration of IMUs using Neural Networks and Adaptive Techniques: Targeting a Self-Calibrated IMU (opens in a new tab)

  19. Efficient scheduling of periodic traffic for WDM networks

    … WDM fiber link connecting two nodes. Scheduling algorithms were proposed and analyzed by simulation. Performance was based on the number of wavelengths utilized assuming static traffic. To simplify analysis, for each simulation batch of lightpath requests, the flexibility values were identical. …

    hawaii Repository record for Efficient scheduling of periodic traffic for WDM networks (opens in a new tab)

  20. SEQUENTIAL DECISION MAKING FOR ACTIVE LEARNING AND INFERENCE IN ONLINE SETTINGS

    … we first focus on designing active learning algorithms for active inference. We consider an anomaly detection problem among heterogeneous processes. At each time, a subset of processes can be probed. The objective is to design a sequential probing strategy that dynamically determines which …

    cornell Repository record for SEQUENTIAL DECISION MAKING FOR ACTIVE LEARNING AND INFERENCE IN ONLINE SETTINGS (opens in a new tab)

Page 1 of 2