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 38 for “"online algorithms"”.
-
Online algorithms for content caching: an economic perspective
… 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 current …
-
Primal-Dual Techniques for Online Algorithms and Mechanisms
… 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 algorithms are often …
-
Distributed online algorithms for energy management in smart grids
… initialization vector. The proposed distributed online solutions leverage a dynamic average consensus algorithm to track the time-variant linearly coupled constraint that allows an abrupt change in power demand of the network because of the high penetration of VRE resources. The problems are …
-
Analysis of online algorithms for resource allocation applied to the stock market
Thesis (S.B. and M.Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1999.
-
Optimization problems with incomplete information
… is concerned with the design and analysis of algorithms for new variants of optimization problems where the problem instance is not completely known. Specifically, we consider two online problems where the problem instance is revealed over time, and one distributed problem involving many …
-
Wireless transmission with energy harvesting and storage
In this dissertation, online power control strategies are proposed for wireless communication systems equipped with energy harvesting devices and finite-capacity batteries. The methods are proposed for the unbounded fading environment. Due to the time-dependent and random behavior of the energy …
-
Adaptive challenge for algebraic and realistic dynamic optimisation benchmarks.
… representing the adaptive challenge of online algorithms to different dynamic features in benchmark generators, ensuring that only problems that obtain effective adaptation of online algorithms are classified as "dynamic". However, academic research often simulates changes in the problem …
-
Online optimization problems
In this thesis, we study online optimization problems in routing and allocation applications. Online problems are problems where information is revealed incrementally, and decisions must be made before all information is available. We design and analyze algorithms for a variety of online problems, …
-
Learning sparse features and metric in signal and image processing
… margin criterion. We propose both batch and online algorithms. The regret bounds are given for online algorithms. Experiments are conducted on 3D human body shape matching problem and state-of-the-art performance is achieved.
-
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. …
-
A robust optimization approach to online problems
In this thesis, we consider online optimization problems that are characterized by incrementally revealed input data and sequential irrevocable decisions that must be made without complete knowledge of the future. We employ a combination of mixed integer optimization (MIO) and robust optimization …
-
Angle constrained paths in sensor networks
… angles. We present a critical review of existing algorithms for generating angle constrained paths. We then consider the construction of routes having directional properties---d-monotone routes which are special cases of angle constrained paths. We develop a centralized algorithm for computing …
-
Online optimization in routing and scheduling
In this thesis we study online optimization problems in routing and scheduling. An online problem is one where the problem instance is revealed incrementally. Decisions can (and sometimes must) be made before all information is available. We design and analyze (polynomial-time) online algorithms …
-
Efficient coordinate descent for ranking with domination loss
… generally performed similarly to existing algorithms when rated by average precision and precision at top k. It does not train as quickly as online algorithms, but offers extensions to multiple layers, and perhaps most importantly, can be used to produce extremely sparse weight vectors. …
-
Dynamic online resource allocation problems
Online resource allocation problems consider assigning a limited number of available resources to sequentially arriving requests with the objective to maximize rewards. With the emergence of e-business, applications such as online order fulfillment and customer service require real-time resource …
-
Efficient orchestration of data centers via comprehensive and application-aware trade-off exploration
… of these VMs in a single atomic step, leading to online algorithms that are one order of magnitude faster than existing solutions for placing data center workloads. For an instance of the SDN orchestration problem subject to four independent NCFs attempting to optimize network survivability, …
-
Methods for Ripple Detection and Spike Sorting During Hippocampal Replay
… observed during ripples. This necessitates online algorithms for both spike sorting and ripple detection at low latencies. In my work, I have developed and tested an improved method for ripple detection and tested its performance against previous methods. Further, I have optimized a recently …
-
The Locality-First Strategy for Developing Efficient Multicore Algorithm
… developing efficient parallel and cache-friendly algorithms for multicores. That is, they should first understand and exploit locality as much as possible before introducing parallelism. I argue that an algorithm developer can achieve high-performing code more easily with the locality-first …
-
Theoretical study of two prediction-centric problems : graphical model learning and recommendations
… recovering the underlying tree. PART II. Optimal online algorithms for a latent variable model of recommendation systems: We consider an online model for recommendation systems, with each user being recommended an item at each time-step and providing 'like' or 'dislike' feedback. The user …
-
Variations of online bipartite matching
The Online Bipartite Matching Problem is a well-studied problem in theoretical computer science that models several real-world applications including online investment, kidney transplantation, aviation security passenger screening, and enhanced Ebola entry screening. However, the original version …
Page 1 of 2