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 27 for “"Competitive ratio"”.
-
Online optimization in routing and scheduling
… for a variety of problems. We utilize worst-case competitive ratio (and relaxations thereof), asymptotic and Monte Carlo simulation analyses in our study of these algorithms. The focus of this thesis is on online routing problems in arbitrary metric spaces. We begin our study with online versions …
-
Supporting Software Transactional Memory in Distributed Systems: Protocols for Cache-Coherence, Conflict Resolution and Replication
… the performance of D-STM by measuring the competitive ratio of its makespan --- i.e., the ratio of its makespan (the last completion time for a given set of transactions) to the makespan of an optimal off-line clairvoyant scheduler. We show that the performance of D-STM for metric-space …
-
Online scheduling algorithms for average flow time and its variants
… measure for online scheduling algorithms is competitive ratio. An algorithm is said to be $c$-competitive if its objective is within a multiplicative factor $c$ of the optimal scheduler's objective for any sequence of requests. Roughly speaking, an algorithm with a small competitive ratio …
-
Online t-interval scheduling
… extent. The performance of the algorithm is the ratio between the number of tintervals in its output vs. the optimal offline schedule. If the intervals are weighted, the performance is the ratio between the total weight of these sets. The maximum ratio, taken over all input instances, is the …
-
Online algorithms for content caching: an economic perspective
… content, is an effective way to optimize the operations of computer networks. Therefore, content caching reduces the delivery delay and improves the users’ Quality of Experience (QoE). The current literature either proposes offline algorithms that have complete knowledge of the request profile a …
-
Algorithms for Allocation Problems in Online Settings
… computational challenge that arises in the operation of online systems, services, and platforms is that of resource allocation. Broadly defined, a resource allocation problem is one where set of users generate demands, which then have to be satisfied using a limited set of resources. In many of …
-
Some combinational optimization problems on radio network communication and machine scheduling
… shown that Hu 's algorithm yields an asymptotic competitive ratio of 3/2 for intree precedence constraints and an asymptotic competitive ratio of 1 for outtree precedences, and Coffinan-Graham algorithm yields an asymptotic competitive ratio of 1 for arbitrary precedence constraints and two …
-
Optimization problems with incomplete information
… the performance of algorithms by the worst-case ratio between their objective values and the optimal objective value obtained by algorithms knowing the entire problem instance. Better algorithms have ratios closer to one. For online problems, this ratio is known as the competitive ratio. First, …
-
Dynamic, data-driven decision-making in revenue management
… platform. We take the perspective of worst-case competitive ratio analysis, and aim to develop algorithms whose performance guarantees do not depend on the customer arrival process. We provide the first solution to this problem when there are both multiple items and multiple prices at which they …
-
Input Sensitive Analysis of a Minimum Metric Bipartite Matching Algorithm
… are many well-studied models for request generation. We study the problem in the adversarial model where an adversary who knows the decisions made by the algorithm generates a request sequence to maximize ratio of the cost of the online matching and the minimum-cost matching (also called the …
-
Learning to Update: Using Reinforcement Learning to Discover Policies for List Update
… a new list update algorithm, we also prove a competitive ratio for the transposition heuristic, which is a well-known algorithm for the list update problem. Finally, we discuss key ideas and insights from the reinforcement learning agent that hints towards optimal behavior for the list update …
-
Studies on optimization problems with dynamically arriving information
… 50%, as it is shown to be asymptotically two-competitive. A computational study confirms that Reopt’s gaps to the complete-information optimum are small, e.g. averaging less than 5% for a cost-minimization objective. A pattern analysis of Complete-Information Optimal Solutions (CIOSs), …
-
Online packet buffering
… knows the whole input sequence in advance. In a competitive analysis, we determine the competitive ratio of the online algorithm, which is defined to be the asymptotic worst case ratio between the profit of the <br>optimal offline algorithm and the profit of the online algorithm, where if the …
-
Optimal self assembly of modular manipulators with active and passive modules
… We prove that the same optimality - quadratic competitive ratio - as for the static graph can be achieved for the algorithms. We demonstrate how this algorithm can be used to build truss-like structures. We present results from physical experiments in which two 3DOF Shady3D robots and one rigid …
-
Online Optimization for Edge Computing under Uncertainty in Wireless Networks
… the computational tasks, and update a target competitive ratio defined as the ratio between the latency achieved by the proposed online algorithm and the optimal latency. The results show that the proposed framework achieves the target competitive ratio that is affected by the wireless data …
-
Optimization problems in network connectivity
… Steiner tree problem that has a poly-logarithmic competitive ratio when the input graph has both node and edge costs. -- Network Activation Problems. In the design of real-life wireless networks, a typical objective is to select one among a possible set of parameter values at each node such that …
-
Multi-Robot Coordination for Hazardous Environmental Monitoring
… search-based algorithm that yields a constant competitive ratio for exploring a translating plume. Last, we take into account a heterogeneous team of robots to map and sample a translating plume. These contributions can be applied to a team of aerial robots and a robotic boat monitoring and …
-
ONLINE RESOURCE ALLOCATION AND ITS APPLICATIONS
… is one of the most important problems in operations research. This thesis focus on algorithm design for different ORA models. In Chapter 2, we study the online resource allocation problem in which the resources are substitutable in two directions. To tackle the complicated substitution effect …
-
Reducing Physician Burnout and Costs in Outpatient Healthcare Settings via Advanced Analytics
… team dynamics and structure through the integration of EHR data with social network modeling. Machine learning models are then developed to predict different dimensions of physicians’ well being using predictors related to team care dynamics and structure and work composition. Chapter 4 …
-
Optimization problems in networks and queues
… offline optimal algorithm and a constant-competitive online algorithm that does not rely on distributional assumptions about arrivals. We also provide a lower bound on the competitive ratio for this problem that no online algorithm can beat. The third problem studies dynamic resource …
Page 1 of 2