Competitive algorithms for online multidimensional knapsack problems
In this paper, we study the online multidimensional knapsack problem (called OMdKP) in
which there is a knapsack whose capacity is represented in m dimensions, each dimension …
which there is a knapsack whose capacity is represented in m dimensions, each dimension …
Competitive online scheduling algorithms with applications in deadline-constrained EV charging
B Alinia, MS Talebi, MH Hajiesmaili… - 2018 IEEE/ACM 26th …, 2018 - ieeexplore.ieee.org
This paper studies the classical problem of online scheduling of deadline-sensitive jobs with
partial values and investigates its extension to Electric Vehicle (EV) charging scheduling by …
partial values and investigates its extension to Electric Vehicle (EV) charging scheduling by …
Online linear optimization with inventory management constraints
This paper considers the problem of online linear optimization with inventory management
constraints. Specifically, we consider an online scenario where a decision maker needs to …
constraints. Specifically, we consider an online scenario where a decision maker needs to …
ORBBuf: A robust buffering method for remote visual SLAM
The data loss caused by unreliable network seriously impacts the results of remote visual
SLAM systems. From our experiment, a loss of less than 1 second of data can cause a visual …
SLAM systems. From our experiment, a loss of less than 1 second of data can cause a visual …
Competitive Online Age-of-Information Optimization for Energy Harvesting Systems
We consider the scenario where an energy harvesting source sends its updates to a
receiver. The source optimizes its energy allocation over a decision period to maximize a …
receiver. The source optimizes its energy allocation over a decision period to maximize a …
Online inventory management with application to energy procurement in data centers
Motivated by the application of energy storage management in electricity markets, this paper
considers the problem of online linear programming with inventory management constraints …
considers the problem of online linear programming with inventory management constraints …
Online linear programming with uncertain constraints
L Yang, MH Hajiesmaili… - 2019 53rd Annual …, 2019 - ieeexplore.ieee.org
There are many applications scenarios in different disciplines where the critical knowledge
of decision making arrives in a sequential manner, so the optimization must be done in an …
of decision making arrives in a sequential manner, so the optimization must be done in an …
Competitive bidding strategies for online linear optimization with inventory management constraints
This paper develops competitive bidding strategies for an online linear optimization problem
with inventory management constraints in both cost minimization and profit maximization …
with inventory management constraints in both cost minimization and profit maximization …
An optimal randomized online algorithm for QoS buffer management
The QoS buffer management problem, with significant and diverse computer applications,
eg, in online cloud resource allocation problems, is a classic online admission control …
eg, in online cloud resource allocation problems, is a classic online admission control …
[PDF][PDF] Orbbuf: A robust buffering method for collaborative visual slam
Collaborative simultaneous localization and mapping (SLAM) approaches provide a
solution for autonomous robots based on embedded devices. On the other hand, visual …
solution for autonomous robots based on embedded devices. On the other hand, visual …