-
81
Carpooling in social networks
Published 2016“…<p>We consider the online carpool fairness problem of [Fagin and Williams, 1983] in which an online algorithm is presented with a sequence of pairs drawn from a group of n potential drivers. …”
Conference item -
82
Online Scheduling on a Single Machine with Grouped Processing Times
Published 2015-01-01“…When the capacity of the vehicle is infinite, we provide an online algorithm with the best competitive ratio of (5+1)/2. …”
Get full text
Article -
83
Learning-augmented dynamic power management with multiple states via new ski rental bounds
Published 2022“…We develop a learning-augmented online algorithm that makes decisions based on (potentially inaccurate) predicted lengths of the idle periods. …”
Conference item -
84
Spatial Two-Sided Online Bottleneck Matching With Deadlines
Published 2020-01-01“…To settle the FOBMD problem, we consider three baseline algorithms and propose an online algorithm, namely Local Isolated Point Greedy (LIPG). …”
Get full text
Article -
85
Virtual Belt Algorithm for the Management of Isolated Autonomous Intersection
Published 2018-11-01“…The online algorithm is designed for the real-time application of the virtual belt algorithm. …”
Get full text
Article -
86
Online traveling salesman problems with rejection options
Published 2015“…For the basic version, we provide a best possible 2-competitive online algorithm for the problem on a general metric space. …”
Get full text
Get full text
Article -
87
Developing a measure of online wellbeing and user trust
Published 2020“…The second scale, the Trust Index includes three subscales covering the importance of trust to the user, trusting beliefs, and contextual factors; the aim for this scale is to examine trust in online algorithm-driven systems. The scales will be used together to aid researchers in understanding how trust (or lack of trust) relates to overall wellbeing online. …”
Conference item -
88
Mobility Patterns Mining Algorithms with Fast Speed
Published 2015-11-01“…The benefit of applying the UMP_Online algorithm is that the system can run online in real time. …”
Get full text
Article -
89
Shortest paths without a map, but with an entropic regularizer
Published 2024“…In the same paper, Ramesh also gave an 𝑂(𝑘 13)-competitive randomized online algorithm. Between 1993 and the results obtained in this paper, no progress has been reported on the randomized competitive ratio of layered graph traversal. …”
Journal article -
90
Shortest paths without a map, but with an entropic regularizer
Published 2022“…In the same paper, Ramesh also gave an O(k13)-competitive randomized online algorithm. Since 1993, no progress has been reported on the randomized competitive ratio of layered graph traversal. …”
Conference item -
91
Power Allocation Algorithm for an Energy-Harvesting Wireless Transmission System Considering Energy Losses
Published 2019-01-01“…Furthermore, inspired by the optimal offline algorithm, a low-complexity online algorithm with adaptive thresholds is derived. Finally, the simulation results show that the offline power allocation algorithms proposed in this paper are better than other algorithms, the performance of the online algorithm proposed is close to the offline one, and these algorithms can help improve the average throughput of the system.…”
Get full text
Article -
92
Joint scheduling and instantaneously decodable network coding
Published 2011“…The online algorithm requires computation of stable sets in an appropriately defined conflict graph. …”
Get full text
Get full text
Article -
93
Optimal Dynamic Reserved Bandwidth Allocation for Cloud-Integrated Cyber-Physical Systems
Published 2017-01-01“…Then we develop an online algorithm based on the proposed strategy using the Lyapunov optimization theory. …”
Get full text
Article -
94
Dynamic priority-based resource provisioning for video transcoding with heterogeneous QoS
Published 2020“…We adopt the model predictive control framework to design an online algorithm for dynamic resource provisioning to accommodate time-varying workloads by predicting future workloads. …”
Get full text
Journal Article -
95
RBF-ARX Model-Based Robust Predictive Control Strategy With One Degree-of-Freedom
Published 2024-01-01“…Then, a quasi-min-max MPC problem was formulated as a complex linear matrix inequalities (LMIs) optimization problem, which can be solved through a fast computation strategy that contains an online algorithm and an offline algorithm. To reduce its conservatism, this paper introduced one free variable(s) to control variable(s) and designed a new online algorithm, which means that a simple online optimization problem was formulated to solve for the introduced free variable(s). …”
Get full text
Article -
96
Contrastive Transformer Network for Track Segment Association with Two-Stage Online Method
Published 2024-09-01“…Additionally, we tackle dynamic association scenarios with a two-stage online algorithm designed to manage tracks that appear or disappear at any time. …”
Get full text
Article -
97
Competitive algorithms for block-aware caching
Published 2022“…We show the following suite of results: • For the eviction cost model, we show an O(log k)-approximate offline algorithm, a k-competitive deterministic online algorithm, and an O(log2k)-competitive randomized online algorithm. • For the fetching cost model, we show an integrality gap of O(ß) for the natural LP relaxation of the problem, and an O(ß +log k) lower bound for randomized online algorithms. …”
Conference item -
98
On on-line algorithms for Bin, Strip and Box Packing, and their worstand average-case analysis
Published 2018-10-01“…In this survey, online algorithms for such packing problems as Bin Packing, Strip Packing and their generalizations, such as Multidimensional Bin Packing, Multiple Strip Packing and packing into strips of different width were considered. …”
Get full text
Article -
99
Extending the Birkhoff-von Neumann switching strategy to multicast switching
Published 2006Get full text
Thesis -
100