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 136 for “"Online algorithm"”.

  1. Online algorithm with predictions for trading problems

    In the online search problem, a sequence of asset prices appears in an online manner. A trader needs to trade an asset in "one-shot". In doing so, the trader's objective is to select the maximum price from the online sequence. Clearly, when the trader settles for a price (makes a trade), it cannot …

    manitoba Repository record for Online algorithm with predictions for trading problems (opens in a new tab)

  2. Online algorithm design via smoothing with application to online experiment selection

    … three topics, namely, the design and analysis of online convex optimization algorithms, convergence rate analysis of proximal gradient homotopy algorithm for structured convex problems, and application of computational methods for study of brain cells in the visual cortex of the primate brain. In …

    washington Repository record for Online algorithm design via smoothing with application to online experiment selection (opens in a new tab)

  3. VIVA: An Online Algorithm for Piecewise Curve Estimation Using ℓ0 Norm Regularization

    … they permit the use of convex optimization algorithms. However, these penalize the magnitude of input changes and therefore bias the piecewise estimates. Another disadvantage is that global optimization methods must be run after the end of data collection. One approach to unbiasing the …

    penn Repository record for VIVA: An Online Algorithm for Piecewise Curve Estimation Using ℓ0 Norm Regularization (opens in a new tab)

  4. An Online Algorithm for the 2-Server Problem On The Line with Improved Competitiveness

    In this thesis we present a randomized online algorithm for the 2-server problem on the line, named R-LINE (for Randomized Line). This algorithm achieves the lowest competitive ratio of any known randomized algorithm for the 2-server problem on the line. The competitiveness of R-LINE is less than …

    unlv Repository record for An Online Algorithm for the 2-Server Problem On The Line with Improved Competitiveness (opens in a new tab) Download PDF for An Online Algorithm for the 2-Server Problem On The Line with Improved Competitiveness (opens in a new tab)

  5. An online algorithm for separating sparse and low-dimensional signal sequences from their sum, and its applications in video processing

    … + sparse'' assumption, we design and evaluate an online algorithm, called practical recursive projected compressive sensing (prac-ReProCS) for recovering a time sequence of sparse vectors St and a time sequence of dense vectors Lt from their sum, Mt = St + Lt, when the Lt's lie in a slowly …

    iastate Repository record for An online algorithm for separating sparse and low-dimensional signal sequences from their sum, and its applications in video processing (opens in a new tab)

  6. Online problems in facility location

    We introduce two online models for the vertex k-center and the vertex k-median problems. Clients (i.e., graph vertices) and their corresponding links (i.e., graph edges) are revealed sequentially, determining the topology of a graph over time. Clients are revealed by an adversary to an online …

    manitoba Repository record for Online problems in facility location (opens in a new tab)

  7. A survey on online matching and ad allocation

    … first computer scientists to use matchings for online algorithms [8]. In our domain, an online algorithm operates in the online setting where a bipartite graph is given. On one side of the graph there is a set of advertisers and on the other side we have a set of impressions. During the online …

    njit Repository record for A survey on online matching and ad allocation (opens in a new tab)

  8. Online algorithms for dynamic aggregation problems

    In this PhD thesis, we study online variants of Dynamic Aggregation problems that are generalizations of prominent and well studied online problems. In the online setting, we additionally assume that the input arrives piece-by-piece and that the online algorithm has to provide a solution for the …

    greece Repository record for Online algorithms for dynamic aggregation problems (opens in a new tab)

  9. Online packet buffering

    … of computer networks. We develop and investigate algorithms for temporary data packet buffering, where information about the packets is not completely known in advance, but arrives by and by over time. In the classical approach of designing algorithms, all data are assumed to be known in advance. …

    freiburg-diss Repository record for Online packet buffering (opens in a new tab)

  10. Applications and extensions of the bin packing problem

    … of unit capacity bins. In doing so, an "offline" algorithm has access to all items before packing them, while an "online" algorithm receives items one by one and places each item into a bin without any knowledge about the forthcoming items. In this thesis, we study two variants of bin packing: …

    manitoba Repository record for Applications and extensions of the bin packing problem (opens in a new tab)

  11. Analysis of algorithms for online routing and scheduling in networks

    We study situations in which an algorithm must make decisions about how to best route and schedule data transfer requests in a communication network before each transfer leaves its source. For some situations, such as those requiring quality of service guarantees, this is essential. For other …

    wm-mary Repository record for Analysis of algorithms for online routing and scheduling in networks (opens in a new tab)

  12. A New Competitive Ratio for Network Applications with Hard Performance Guarantee

    Online algorithms are used to solve the problems which need to make decisions without future knowledge. Competitive ratio is used to evaluate the performance of an online algorithm. This ratio is the worst-case ratio between the performance of the online algorithm and the offline optimal algorithm. …

    tamu Repository record for A New Competitive Ratio for Network Applications with Hard Performance Guarantee (opens in a new tab)

  13. Primal-Dual Techniques for Online Algorithms and Mechanisms

    An offline algorithm is one that knows the entire input in advance. An online algorithm, however, processes its input in a serial fashion. In contrast to offline algorithms, an online algorithm works in a local fashion and has to make irrevocable decisions without having the entire input. Online …

    maryland Repository record for Primal-Dual Techniques for Online Algorithms and Mechanisms (opens in a new tab)

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

    … 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 by our offline …

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

  15. Empirical Analysis of Algorithms for the k-Server and Online Bipartite Matching Problems

    … we present an empirical analysis of a new online algorithm for k-server problem. This algorithm maintains two solutions, online solution, and an approximately optimal offline solution. When a request arrives we update the offline solution and use this update to inform the online assignment. …

    vt Repository record for Empirical Analysis of Algorithms for the k-Server and Online Bipartite Matching Problems (opens in a new tab)

  16. Convergence to Nash in the potential Linear Quadratic games and accelerated learning in games

    Game theory and online optimization have a close relationship with each other. In some literature, online optimization has been employed for solving game theory problems. Many accelerated algorithms are proposed for offline optimization problems. However, to the best of our knowledge, there is not …

    ubc Repository record for Convergence to Nash in the potential Linear Quadratic games and accelerated learning in games (opens in a new tab) Download PDF for Convergence to Nash in the potential Linear Quadratic games and accelerated learning in games (opens in a new tab)

  17. Mean-Variability-Fairness tradeoffs in resource allocation with applications to video delivery

    … as fairness across users. We propose a simple online algorithm to realize these tradeoffs, which, under stationary ergodic assumptions, is shown to be asymptotically optimal, i.e., achieves a long term performance equal to that of an offline algorithm with knowledge of the future variability in …

    texas Repository record for Mean-Variability-Fairness tradeoffs in resource allocation with applications to video delivery (opens in a new tab)

  18. Some results on linear discrepancy for partially ordered sets

    … posets of width 3, degree bounds, and online algorithms for linear discrepancy. The first principal component of this dissertation provides a forbidden subposet characterization of the posets with linear discrepancy equal to 2 by completing the determination of the posets that are …

    gatech Repository record for Some results on linear discrepancy for partially ordered sets (opens in a new tab)

  19. Online learning for scheduling in wireless networks

    Over the last few years, online learning has grown in importance as it allows us to build systems that can interact with the environment while continuously learning from past interactions to improve future decisions to maximize some objective. While online learning is used in several areas like …

    texas Repository record for Online learning for scheduling in wireless networks (opens in a new tab)

  20. Algorithmic Solutions for Interval and Rectangle Scheduling: Fairness, Prediction, and Beyond

    … One may consider these problems in both online and offline settings. In the offline setting, the input set is available at the beginning, and an algorithm makes a decision about selecting an interval (or rectangle) with complete information about the input. In the online setting, however, …

    york Repository record for Algorithmic Solutions for Interval and Rectangle Scheduling: Fairness, Prediction, and Beyond (opens in a new tab)

Page 1 of 7