Results 31 to 40 of about 299,812 (168)
Online Algorithm Selection [PDF]
Algorithm selection approaches have achieved impressive performance improvements in many areas of AI. Most of the literature considers the offline algorithm selection problem, where the initial selection model is never updated after training. However, new data from running algorithms on instances becomes available while an algorithm selection method is
openaire +1 more source
Competitive Algorithms for Online Pricing [PDF]
Given a seller with m amount of items, a sequence of users {u1, u2, ...} come one by one, the seller must set the unit price and assign some amount of items to each user on his/her arrival. Items can be sold fractionally. Each ui has his/her value function vi(ċ) such that vi(x) is the highest unit price ui is willing to pay for x items.
Zhang, Y, Chin, FYL, Ting, HF
openaire +3 more sources
Mixing predictions for online metric algorithms
A major technique in learning-augmented online algorithms is combining multiple algorithms or predictors. Since the performance of each predictor may vary over time, it is desirable to use not the single best predictor as a benchmark, but rather a dynamic combination which follows different predictors at different times.
Antoniadis, Antonios +4 more
openaire +7 more sources
Minimizing Query Frequency to Bound Congestion Potential for Moving Entities at a Fixed Target Time
Consider a collection of entities moving continuously with bounded speed, but otherwise unpredictably, in some low-dimensional space. Two such entities encroach upon one another at a fixed time if their separation is less than some specified threshold ...
William Evans, David Kirkpatrick
doaj +1 more source
Control of Hybrid Electric Vehicle Powertrain Using Offline-Online Hybrid Reinforcement Learning
Hybrid electric vehicles can achieve better fuel economy than conventional vehicles by utilizing multiple power sources. While these power sources have been controlled by rule-based or optimization-based control algorithms, recent studies have shown that
Zhengyu Yao, Hwan-Sik Yoon, Yang-Ki Hong
doaj +1 more source
Online Algorithmic Study of Facility Location Problems: A Survey
Facility Location problems are one of the most prominent optimization problems in computer science, operations research, and combinatorial optimization. Their simple yet intrinsic structure has led to their widespread application in diverse fields, such ...
Christine Markarian
doaj +1 more source
Formal Asymptotic Analysis of Online Scheduling Algorithms for Plug-In Electric Vehicles’ Charging
A large-scale integration of plug-in electric vehicles (PEVs) into the power grid system has necessitated the design of online scheduling algorithms to accommodate the after-effects of this new type of load, i.e., PEVs, on the overall efficiency of the ...
Asad Ahmed +4 more
doaj +1 more source
Weight-Based K-Truss Community Search via Edge Attachment
Community search is the task of discovering dense subgraph that satisfy a set of given query parameters. Most community search algorithms consider link structure while ignoring link weight.
Wafaa M. A. Habib +2 more
doaj +1 more source
Competitive Analysis of Algorithms for an Online Distribution Problem
We study an online distribution problem in which a producer has to send a load from an origin to a destination. At each time period before the deadline, they ask for transportation price quotes and have to decide to either accept or not accept the ...
Alessandro Barba +2 more
doaj +1 more source
Revisiting Online Algorithms: A Survey of Set Cover Solutions Beyond Competitive Analysis
Online algorithms are crucial for real-time decision-making and adaptability across diverse fields, such as operations research, computer science, and combinatorics. These algorithms handle data incrementally and make decisions without prior knowledge of
Christine Markarian +2 more
doaj +1 more source

