Results 11 to 20 of about 601,117 (314)
Online Bottleneck Matching Problem with Two Heterogeneous Sensors in a Metric Space
Computation, 2022 In this paper, we consider the online matching problem with two heterogeneous sensors s1 and s2 in a metric space (X,d). If a request r is assigned to sensor s1, the service cost of r is the distance d(r,s1).
Man Xiao, Yaru Yang, Weidong Li
doaj +1 more source
Online Algorithms for Multilevel Aggregation [PDF]
Operations Research, 2020 Online Algorithms for Hierarchical Aggregation Problems Data and inventory aggregation problems arise in multicasting, sensor networks, communication in organization hierarchies, and in supply chain management. These problems are naturally online, in the sense that aggregation decisions need to be made without information about future requests.
Marcin Bienkowski +9 more
openaire +8 more sources
IEEE Access, 2021 With the rapid development of economy and technology, large-scale integrated energy buildings account for an increasing proportion of urban load. However, the randomness of EV owner behaviors, electricity price and outdoor temperature have brought ...
Renli Cheng +7 more
doaj +1 more source
Competitive Algorithms for Online Pricing [PDF]
Discrete Mathematics, Algorithms and Applications, 2011 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 +4 more sources
Online Learning Algorithms [PDF]
Foundations of Computational Mathematics, 2005 In this paper, we study an online learning algorithm in Reproducing Kernel Hilbert Spaces (RKHSs) and general Hilbert spaces. We present a general form of the stochastic gradient method to minimize a quadratic potential function by an independent identically distributed (i.i.d.) sample sequence, and show a probabilistic upper bound for its convergence.
Smale, Steve, Yao, Yuan
openaire +2 more sources
Bin-Packing-Based Online Dynamic Bandwidth and Wavelength Allocation Algorithm in Super-PON
IEEE Access, 2021 Super passive optical network (Super-PON) is a next-generation Ethernet PON (NG-EPON) candidate that is envisaged to provide high data rate and low latency.
Sukriti Garg, Abhishek Dixit
doaj +1 more source
Online Course on the History of Algorithms [PDF]
IEEE Revista Iberoamericana de Tecnologias del Aprendizaje, 2013 This paper describes the objectives, content, learning methodology and results of an online course on the History of Algorithms for engineering students at Polytechnic University of Madrid (UPM). This course is conducted in a virtual environment based on Moodle, with a student-centred educational model which includes a detailed planning of learning ...
García López, Alfonsa +2 more
openaire +2 more sources
Online Robust Subspace Clustering With Application to Power Grid Monitoring
IEEE Access, 2023 In this work, a robust subspace clustering algorithm is developed to exploit the inherent union-of-subspaces structure in the data for reconstructing missing measurements and detecting anomalies.
Young-Hwan Lee +3 more
doaj +1 more source
Online Regularized Classification Algorithms [PDF]
IEEE Transactions on Information Theory, 2006 Summary: This paper considers online classification learning algorithms based on regularization schemes in reproducing kernel Hilbert spaces associated with general convex loss functions. A novel capacity independent approach is presented. It verifies the strong convergence of the algorithm under a very weak assumption of the step sizes and yields ...
Yiming Ying, Ding-Xuan Zhou
openaire +1 more source
Online metaheuristic algorithm selection
, 2022 The performance of optimization algorithms significantly depends on the landscape of the problems. It is known that there is no single algorithm that outperforms others on problems with different fitness landscapes.
Meidani, Kazem +2 more
core +1 more source